{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:USV2L4UB4A2J4TLKYPDII4Q5G6","short_pith_number":"pith:USV2L4UB","schema_version":"1.0","canonical_sha256":"a4aba5f281e0349e4d6ac3c684721d37ae01ba33efc761185247aa1481008d58","source":{"kind":"arxiv","id":"2605.17498","version":1},"attestation_state":"computed","paper":{"title":"Browsing Large Graphs with Tile Pyramids and Sleeve Routing in the Browser","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Tile pyramids for semantic zoom combined with sleeve routing let large graphs be browsed interactively in the browser like online maps.","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lev Nachmanson, Xiaoji Chen","submitted_at":"2026-05-17T15:16:19Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.17498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-17T15:16:19Z","cross_cats_sorted":[],"title_canon_sha256":"b4ee968693e1eda3e2e6c13c4d2015e4755df9a851740584b88cd35b124f786f","abstract_canon_sha256":"b3a08d9af3cd30a4304f46f41246fb2624e7e8b136646fdfc6e9ae5c741291bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:42.291534Z","signature_b64":"CMkrT6fajzQnPJIFN8ssFc5L8LGb2xljKGbO06O0haviYNM0FlIszuyjJrHp3cG/qce+1jz1iaXH/gUs5YTGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4aba5f281e0349e4d6ac3c684721d37ae01ba33efc761185247aa1481008d58","last_reissued_at":"2026-05-20T00:04:42.290758Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:42.290758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Browsing Large Graphs with Tile Pyramids and Sleeve Routing in the Browser","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Tile pyramids for semantic zoom combined with sleeve routing let large graphs be browsed interactively in the browser like online maps.","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lev Nachmanson, Xiaoji Chen","submitted_at":"2026-05-17T15:16:19Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Tile pyramids for semantic zoom combined with sleeve routing let large graphs be browsed interactively in the browser like online maps.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2758a6158ec880478b5447b2c86347edd9bc8930a0f91da8b19397dd87d82dc1"},"source":{"id":"2605.17498","kind":"arxiv","version":1},"verdict":{"id":"340b1bea-d5fb-40c1-aec8-c8bde870012d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:30:11.852152Z","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.","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","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.","pith_extraction_headline":"Tile pyramids for semantic zoom combined with sleeve routing let large graphs be browsed interactively in the browser like online maps."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17498/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"544feca09512f89ddb6e26fb6ce54dea4d21c3c3de9c7508434abe5d64d2512c"},"references":{"count":47,"sample":[{"doi":"","year":null,"title":"Cosmograph.https://cosmograph.app","work_id":"6e18d353-9f3c-488e-b69d-554a42126abf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"deck.gl: Large-scale WebGL-powered data visualization.https://deck.gl/","work_id":"4f2ba9a3-5723-41b8-9928-68756f13e733","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"facebookcombined.https://snap.stanford.edu/data/facebook_combined.txt.gz","work_id":"aff2d688-b9eb-49ea-89d7-686ecac17540","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"https://page.mi.fu-berlin.de/mulzer/notes/alggeo/polySP.pdf","work_id":"3bf5773a-ebda-4632-9dc0-42b8f1b6fd20","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Graphviz.http://www.graphviz.org/","work_id":"6a02c5ba-6dba-4c3d-b1a4-918d34b07e9d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":47,"snapshot_sha256":"52ba382dfdb9a9f5f33f008d5710dea2dd29033910eacea0cbe1b50e281a1d6f","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0ac6ca05ded100ca5ae1bfef98988f0c7c3975cc18711b9e535c301f7baa5d49"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.17498","created_at":"2026-05-20T00:04:42.290887+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17498v1","created_at":"2026-05-20T00:04:42.290887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17498","created_at":"2026-05-20T00:04:42.290887+00:00"},{"alias_kind":"pith_short_12","alias_value":"USV2L4UB4A2J","created_at":"2026-05-20T00:04:42.290887+00:00"},{"alias_kind":"pith_short_16","alias_value":"USV2L4UB4A2J4TLK","created_at":"2026-05-20T00:04:42.290887+00:00"},{"alias_kind":"pith_short_8","alias_value":"USV2L4UB","created_at":"2026-05-20T00:04:42.290887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6","json":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6.json","graph_json":"https://pith.science/api/pith-number/USV2L4UB4A2J4TLKYPDII4Q5G6/graph.json","events_json":"https://pith.science/api/pith-number/USV2L4UB4A2J4TLKYPDII4Q5G6/events.json","paper":"https://pith.science/paper/USV2L4UB"},"agent_actions":{"view_html":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6","download_json":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6.json","view_paper":"https://pith.science/paper/USV2L4UB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17498&json=true","fetch_graph":"https://pith.science/api/pith-number/USV2L4UB4A2J4TLKYPDII4Q5G6/graph.json","fetch_events":"https://pith.science/api/pith-number/USV2L4UB4A2J4TLKYPDII4Q5G6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6/action/storage_attestation","attest_author":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6/action/author_attestation","sign_citation":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6/action/citation_signature","submit_replication":"https://pith.science/pith/USV2L4UB4A2J4TLKYPDII4Q5G6/action/replication_record"}},"created_at":"2026-05-20T00:04:42.290887+00:00","updated_at":"2026-05-20T00:04:42.290887+00:00"}