{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NA2GWSUKS6MNANWVENZG5B77GI","short_pith_number":"pith:NA2GWSUK","schema_version":"1.0","canonical_sha256":"68346b4a8a9798d036d523726e87ff3214cf46d72e4388fa1542f2bb68e896a7","source":{"kind":"arxiv","id":"2606.01809","version":1},"attestation_state":"computed","paper":{"title":"A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Debarati Das, Maximilian Probst Gutenberg","submitted_at":"2026-06-01T07:27:10Z","abstract_excerpt":"In the planar, dynamic All-Pairs Shortest Paths (APSP) problem, a planar, weighted digraph $G$ undergoes a sequence of edge weight updates and the goal is to maintain a data structure on $G$, that can quickly answer distance queries between any two vertices $x,y \\in V(G)$.\n  The currently best algorithms for this problem require $\\tilde{O}(n^{2/3})$ worst-case update and query time, while conditional lower bounds show that either update or query time $n^{0.5-\\delta}$ is needed for any constant $\\delta > 0$.\n  In this article, we present the first algorithm with near-optimal $\\tilde{O}(\\sqrt{n}"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.01809","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T07:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"ff7883262935997b879fa13dad9afa288dae6559bbf1e8de158b7a881c374bf5","abstract_canon_sha256":"994747e4623b877f86146cc751222317bbf9066dfa2af5051471cbc3c1095b48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:57.465900Z","signature_b64":"Payfxw6vY2XC9Tfq9/DBjvLPEhLZpjnAT1hVkwEJ4yoEe4iBuCOUa6yxOuc8LIWs06X+P4pe5HpE4BgWycpoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68346b4a8a9798d036d523726e87ff3214cf46d72e4388fa1542f2bb68e896a7","last_reissued_at":"2026-06-02T02:04:57.465513Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:57.465513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Debarati Das, Maximilian Probst Gutenberg","submitted_at":"2026-06-01T07:27:10Z","abstract_excerpt":"In the planar, dynamic All-Pairs Shortest Paths (APSP) problem, a planar, weighted digraph $G$ undergoes a sequence of edge weight updates and the goal is to maintain a data structure on $G$, that can quickly answer distance queries between any two vertices $x,y \\in V(G)$.\n  The currently best algorithms for this problem require $\\tilde{O}(n^{2/3})$ worst-case update and query time, while conditional lower bounds show that either update or query time $n^{0.5-\\delta}$ is needed for any constant $\\delta > 0$.\n  In this article, we present the first algorithm with near-optimal $\\tilde{O}(\\sqrt{n}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01809","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01809/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"2606.01809","created_at":"2026-06-02T02:04:57.465577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01809v1","created_at":"2026-06-02T02:04:57.465577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01809","created_at":"2026-06-02T02:04:57.465577+00:00"},{"alias_kind":"pith_short_12","alias_value":"NA2GWSUKS6MN","created_at":"2026-06-02T02:04:57.465577+00:00"},{"alias_kind":"pith_short_16","alias_value":"NA2GWSUKS6MNANWV","created_at":"2026-06-02T02:04:57.465577+00:00"},{"alias_kind":"pith_short_8","alias_value":"NA2GWSUK","created_at":"2026-06-02T02:04:57.465577+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI","json":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI.json","graph_json":"https://pith.science/api/pith-number/NA2GWSUKS6MNANWVENZG5B77GI/graph.json","events_json":"https://pith.science/api/pith-number/NA2GWSUKS6MNANWVENZG5B77GI/events.json","paper":"https://pith.science/paper/NA2GWSUK"},"agent_actions":{"view_html":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI","download_json":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI.json","view_paper":"https://pith.science/paper/NA2GWSUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01809&json=true","fetch_graph":"https://pith.science/api/pith-number/NA2GWSUKS6MNANWVENZG5B77GI/graph.json","fetch_events":"https://pith.science/api/pith-number/NA2GWSUKS6MNANWVENZG5B77GI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI/action/storage_attestation","attest_author":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI/action/author_attestation","sign_citation":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI/action/citation_signature","submit_replication":"https://pith.science/pith/NA2GWSUKS6MNANWVENZG5B77GI/action/replication_record"}},"created_at":"2026-06-02T02:04:57.465577+00:00","updated_at":"2026-06-02T02:04:57.465577+00:00"}