GET diva-portal.org HTTP 2004.1 s19.8 KB$0.000196 captured Aug 7, 2026

diva-portal.org, as data

One API turns any diva-portal.org page into markdown, structured JSON, its link graph or a screenshot, and crawls the whole site the same way. The panel shows the real response we captured.

target profile from the capture

Render mode: Plain HTTP, no browser needed
Response: HTTP 200 in 4.1 s
Page size: 19.8 KB of markdown, 246 lines
Fields: Business Name, Address, Phone, Category and 1 more
Captured: Aug 7, 2026

Start scraping diva-portal.org See the code

Free balance on signup, no card. This diva-portal.org page cost $0.000196 to fetch.

response 200 · 4.1 s · 19.8 KB

# Umeå University's logoFalgas-Ravry, V., Markström, K. & Räty, E. (2024). Rainbow variations on a theme by mantel: extremal problems for Gallai colouring templates. Combinatorica, 44, 997-1010Open this publication in new window or tab >>Rainbow variations on a theme by mantel: extremal problems for Gallai colouring templates2024 (English)In: Combinatorica, ISSN 0209-9683, E-ISSN 1439-6912, Vol. 44, p. 997-1010Article in journal (Refereed) PublishedLet G:=(G1,G2,G3) be a triple of graphs on the same vertex set V of size n. A rainbow triangle in G is a triple of edges (e1,e2,e3) with ei ∈ Gi for each i and {e1,e2,e3} forming a triangle in V. The triples G not containing rainbow triangles, also known as Gallai colouring templates, are a widely studied class of objects in extremal combinatorics. In the present work, we fully determine the set of edge densities (α1,α2,α3) such that if>αin2 for each i and n is sufficiently large, then G must contain a rainbow triangle. This resolves a problem raised by Aharoni, DeVos, de la Maza, Montejanos and Šámal, generalises several previous results on extremal Gallai colouring templates, and proves a recent conjecture of Frankl, Győri, He, Lv, Salia, Tompkins, Varga and Zhu.05C35, 05D99, Extremal graph theory, Gallai colourings, Mantel’s theorem, Rainbow trianglesurn:nbn:se:umu:diva-224095 (URN)10.1007/s00493-024-00102-6 (DOI)001209613600001 ()2-s2.0-85191690527 (Scopus ID)Swedish Research Council, 2021-03687Olle Engkvists stiftelse, 213-0204Available from: 2024-05-16 Created: 2024-05-16 Last updated: 2024-10-28Bibliographically approvedLeedham-Green, C., Markström, K. & Riis, S. (2024). The largest Condorcet domain on 8 alternatives. Social Choice and Welfare, 62(1), 109-116Open this publication in new window or tab >>The largest Condorcet domain on 8 alternatives2024 (English)In: Social Choice and Welfare, ISSN 0176-1714, E-ISSN 1432-217X, Vol. 62, no 1, p. 109-116Article in journal (Refereed) PublishedIn this note, we report on a Condorcet domain of record-breaking size for n = 8 alternatives. We show that there exists a Condorcet domain of size 224 and that this is the largest possible size for 8 alternatives. Our search also shows that this domain is unique up to isomorphism. In this note we investigate properties of the new domain and relate them to various open problems and conjectures.

POST /scrape · umu.diva-portal.org/smash/person.jsf.md · markdown · Showing 12 of 246 lines · captured Aug 7, 2026

What Spider does on diva-portal.org

Same key, five endpoints. The numbers under a cell were measured on this page.

/scrape

Page to markdown

Clean text for RAG and LLM context, boilerplate removed. The lane that runs without a key.

4.1 s · $0.000196

/fetch

Page to JSON

Spider reads the page and names the fields. Pass your own schema when you need exact keys.

/crawl

Whole site

Follows diva-portal.org's own links, respects robots, streams pages as they land.

/links

Link graph

Every internal and external URL on a page, before you decide what to fetch.

/screenshot

Rendered capture

Real Chromium, full-page PNG. The same call also returns the rendered HTML.

The call behind the panel

This request produced the response above. Paste it with your key and you get the same bytes.

request scrape.sh

curl -X POST https://api.spider.cloud/scrape \
  -H "Authorization: Bearer $SPIDER_API_KEY" \
  -H "Content-Type: application/json" \
  -d '{"url": "https://umu.diva-portal.org/smash/person.jsf?pid=authority-person%3A63648", "return_format": "markdown"}'

from spider import Spider

app = Spider()
params = {"return_format": "markdown"}
page = app.scrape_url("https://umu.diva-portal.org/smash/person.jsf?pid=authority-person%3A63648", params=params)
print(page[0]["content"])

import { Spider } from "@spider-cloud/spider-client";

const app = new Spider();
const [page] = await app.scrapeUrl("https://umu.diva-portal.org/smash/person.jsf?pid=authority-person%3A63648", {
  return_format: "markdown",
});
console.log(page.content);

plain request · no browser, no selectors

What diva-portal.org costs

Multiplied from the measured 19.8 KB page. Estimates round to the cent.

cost measured

This page, once 19.8 KB over HTTP, measured $0.000196

This page, daily for a month 30 fetches at the measured price ≈ $0.005882

1,000 pages this size 19.3 MB at the measured price ≈ $0.20

10,000 pages this size 193.1 MB at the measured price ≈ $1.96

1 GB of transfer costs $1, plus $0.001 per CPU minute, and failed requests cost $0. Crawling daily? The Unlimited plan is a flat monthly rate.

Point this at the rest of diva-portal.org.

The capture above took 4.1 s and cost $0.000196. The same call takes any URL on diva-portal.org.

Get an API key

More in Directories

All Directories scrapers