{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:USV2L4UB4A2J4TLKYPDII4Q5G6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17498","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17498v1","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17498","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"USV2L4UB4A2J","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_16","alias_value":"USV2L4UB4A2J4TLK","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_8","alias_value":"USV2L4UB","created_at":"2026-05-20T00:04:42Z"}],"graph_snapshots":[{"event_id":"sha256:ca34c117479e57ed1ea0d71730921eb3c57fba9b66304e10d229c47726fef58a","target":"graph","created_at":"2026-05-20T00:04:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Tile pyramids for semantic zoom combined with sleeve routing let large graphs be browsed interactively in the browser like online maps."}],"snapshot_sha256":"2758a6158ec880478b5447b2c86347edd9bc8930a0f91da8b19397dd87d82dc1"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0ac6ca05ded100ca5ae1bfef98988f0c7c3975cc18711b9e535c301f7baa5d49"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.526748Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:41:16.986521Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.672304Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.638291Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17498/integrity.json","findings":[],"snapshot_sha256":"544feca09512f89ddb6e26fb6ce54dea4d21c3c3de9c7508434abe5d64d2512c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"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.\n  The edges are routed by a method we call sleeve routing, which searches the dual graph of a Constrained Delaunay Triangulation to select a sequence of triangles through the free space, then applies the funnel algorithm to compute a shortest path inside the selected sleeve. We apply several heuristics to","authors_text":"Lev Nachmanson, Xiaoji Chen","cross_cats":[],"headline":"Tile pyramids for semantic zoom combined with sleeve routing let large graphs be browsed interactively in the browser like online maps.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-17T15:16:19Z","title":"Browsing Large Graphs with Tile Pyramids and Sleeve Routing in the Browser"},"references":{"count":47,"internal_anchors":0,"resolved_work":47,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Cosmograph.https://cosmograph.app","work_id":"6e18d353-9f3c-488e-b69d-554a42126abf","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"deck.gl: Large-scale WebGL-powered data visualization.https://deck.gl/","work_id":"4f2ba9a3-5723-41b8-9928-68756f13e733","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"facebookcombined.https://snap.stanford.edu/data/facebook_combined.txt.gz","work_id":"aff2d688-b9eb-49ea-89d7-686ecac17540","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"https://page.mi.fu-berlin.de/mulzer/notes/alggeo/polySP.pdf","work_id":"3bf5773a-ebda-4632-9dc0-42b8f1b6fd20","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Graphviz.http://www.graphviz.org/","work_id":"6a02c5ba-6dba-4c3d-b1a4-918d34b07e9d","year":null}],"snapshot_sha256":"52ba382dfdb9a9f5f33f008d5710dea2dd29033910eacea0cbe1b50e281a1d6f"},"source":{"id":"2605.17498","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:30:11.852152Z","id":"340b1bea-d5fb-40c1-aec8-c8bde870012d","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Tile pyramids for semantic zoom combined with sleeve routing let large graphs be browsed interactively in the browser like online maps.","strongest_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.","weakest_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."}},"verdict_id":"340b1bea-d5fb-40c1-aec8-c8bde870012d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8b5fe60eb1ea9606e65a6d03df24810fbe26728c9248c495f3563ec5e5f8b11c","target":"record","created_at":"2026-05-20T00:04:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"a4aba5f281e0349e4d6ac3c684721d37ae01ba33efc761185247aa1481008d58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4aba5f281e0349e4d6ac3c684721d37ae01ba33efc761185247aa1481008d58","first_computed_at":"2026-05-20T00:04:42.290758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:42.290758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CMkrT6fajzQnPJIFN8ssFc5L8LGb2xljKGbO06O0haviYNM0FlIszuyjJrHp3cG/qce+1jz1iaXH/gUs5YTGDg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:42.291534Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b5fe60eb1ea9606e65a6d03df24810fbe26728c9248c495f3563ec5e5f8b11c","sha256:ca34c117479e57ed1ea0d71730921eb3c57fba9b66304e10d229c47726fef58a"],"state_sha256":"ddaee434046db4b09ef7c0f052e4f54379df9ce832af60fa83cffc856e5b16ec"}