pith. sign in
Pith Number

pith:USV2L4UB

pith:2026:USV2L4UB4A2J4TLKYPDII4Q5G6
not attested not anchored not stored refs resolved

Browsing Large Graphs with Tile Pyramids and Sleeve Routing in the Browser

Lev Nachmanson, Xiaoji Chen

Tile pyramids for semantic zoom combined with sleeve routing let large graphs be browsed interactively in the browser like online maps.

arxiv:2605.17498 v1 · 2026-05-17 · cs.CG

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{USV2L4UB4A2J4TLKYPDII4Q5G6}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We present a new way to visualize a large graph in the style of online geographic maps. The method builds a tile pyramid for semantic zoom: at every zoom level the labels of the highest-ranked nodes remain readable, just as the names of major geographical features stay readable on those maps.

C2weakest assumption

The assumption that sleeve routing, which searches the dual graph of a Constrained Delaunay Triangulation and applies the funnel algorithm with heuristics, remains efficient and produces usable paths for graphs with up to 32k nodes when run entirely client-side in a browser.

C3one line summary

A browser-based system creates tile pyramids for semantic zoom on large graphs and routes edges via sleeve routing on Constrained Delaunay Triangulations with funnel paths and heuristics for speed.

References

47 extracted · 47 resolved · 0 Pith anchors

[1] Cosmograph.https://cosmograph.app
[2] deck.gl: Large-scale WebGL-powered data visualization.https://deck.gl/
[3] facebookcombined.https://snap.stanford.edu/data/facebook_combined.txt.gz
[4] https://page.mi.fu-berlin.de/mulzer/notes/alggeo/polySP.pdf
[5] Graphviz.http://www.graphviz.org/

Formal links

2 machine-checked theorem links

Receipt and verification
First computed 2026-05-20T00:04:42.290758Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

a4aba5f281e0349e4d6ac3c684721d37ae01ba33efc761185247aa1481008d58

Aliases

arxiv: 2605.17498 · arxiv_version: 2605.17498v1 · doi: 10.48550/arxiv.2605.17498 · pith_short_12: USV2L4UB4A2J · pith_short_16: USV2L4UB4A2J4TLK · pith_short_8: USV2L4UB
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: a4aba5f281e0349e4d6ac3c684721d37ae01ba33efc761185247aa1481008d58
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "b3a08d9af3cd30a4304f46f41246fb2624e7e8b136646fdfc6e9ae5c741291bf",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.CG",
    "submitted_at": "2026-05-17T15:16:19Z",
    "title_canon_sha256": "b4ee968693e1eda3e2e6c13c4d2015e4755df9a851740584b88cd35b124f786f"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.17498",
    "kind": "arxiv",
    "version": 1
  }
}