{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5NAAR27WA2OGUTZRG2CKPL5MXD","short_pith_number":"pith:5NAAR27W","schema_version":"1.0","canonical_sha256":"eb4008ebf6069c6a4f313684a7afacb8f77bd3648f9a668beababf70297d6b54","source":{"kind":"arxiv","id":"1702.03259","version":3},"attestation_state":"computed","paper":{"title":"Fast and Compact Exact Distance Oracle for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, S{\\o}ren Dahlgaard, Vincent Cohen-Addad","submitted_at":"2017-02-10T17:27:35Z","abstract_excerpt":"For a given a graph, a distance oracle is a data structure that answers distance queries between pairs of vertices. We introduce an $O(n^{5/3})$-space distance oracle which answers exact distance queries in $O(\\log n)$ time for $n$-vertex planar edge-weighted digraphs. All previous distance oracles for planar graphs with truly subquadratic space i.e., space $O(n^{2 - \\epsilon})$ for some constant $\\epsilon > 0$) either required query time polynomial in $n$ or could only answer approximate distance queries.\n  Furthermore, we show how to trade-off time and space: for any $S \\ge n^{3/2}$, we show"},"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":"1702.03259","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T17:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"6560e0f31ca3691f8b047ee39fcffbe5274040f07f4ba2fe029c0ed2e9cd3a65","abstract_canon_sha256":"efca47f88aabacaa874a3e081cbc83749ed1e9c4ea24e7cbff2ec2332db97532"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:13.850374Z","signature_b64":"hXjhpX2SxCmgBdDvkHcPNCY3VMgfsSHAK8AkneADVpdzukJPbG/TMa6KOf3nsnBHQW3bheWgIzP+MzhejD9tDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb4008ebf6069c6a4f313684a7afacb8f77bd3648f9a668beababf70297d6b54","last_reissued_at":"2026-05-18T00:45:13.849731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:13.849731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Compact Exact Distance Oracle for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, S{\\o}ren Dahlgaard, Vincent Cohen-Addad","submitted_at":"2017-02-10T17:27:35Z","abstract_excerpt":"For a given a graph, a distance oracle is a data structure that answers distance queries between pairs of vertices. We introduce an $O(n^{5/3})$-space distance oracle which answers exact distance queries in $O(\\log n)$ time for $n$-vertex planar edge-weighted digraphs. All previous distance oracles for planar graphs with truly subquadratic space i.e., space $O(n^{2 - \\epsilon})$ for some constant $\\epsilon > 0$) either required query time polynomial in $n$ or could only answer approximate distance queries.\n  Furthermore, we show how to trade-off time and space: for any $S \\ge n^{3/2}$, we show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03259","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1702.03259","created_at":"2026-05-18T00:45:13.849839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03259v3","created_at":"2026-05-18T00:45:13.849839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03259","created_at":"2026-05-18T00:45:13.849839+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NAAR27WA2OG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NAAR27WA2OGUTZR","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NAAR27W","created_at":"2026-05-18T12:31:00.734936+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/5NAAR27WA2OGUTZRG2CKPL5MXD","json":"https://pith.science/pith/5NAAR27WA2OGUTZRG2CKPL5MXD.json","graph_json":"https://pith.science/api/pith-number/5NAAR27WA2OGUTZRG2CKPL5MXD/graph.json","events_json":"https://pith.science/api/pith-number/5NAAR27WA2OGUTZRG2CKPL5MXD/events.json","paper":"https://pith.science/paper/5NAAR27W"},"agent_actions":{"view_html":"https://pith.science/pith/5NAAR27WA2OGUTZRG2CKPL5MXD","download_json":"https://pith.science/pith/5NAAR27WA2OGUTZRG2CKPL5MXD.json","view_paper":"https://pith.science/paper/5NAAR27W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03259&json=true","fetch_graph":"https://pith.science/api/pith-number/5NAAR27WA2OGUTZRG2CKPL5MXD/graph.json","fetch_events":"https://pith.science/api/pith-number/5NAAR27WA2OGUTZRG2CKPL5MXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NAAR27WA2OGUTZRG2CKPL5MXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NAAR27WA2OGUTZRG2CKPL5MXD/action/storage_attestation","attest_author":"https://pith.science/pith/5NAAR27WA2OGUTZRG2CKPL5MXD/action/author_attestation","sign_citation":"https://pith.science/pith/5NAAR27WA2OGUTZRG2CKPL5MXD/action/citation_signature","submit_replication":"https://pith.science/pith/5NAAR27WA2OGUTZRG2CKPL5MXD/action/replication_record"}},"created_at":"2026-05-18T00:45:13.849839+00:00","updated_at":"2026-05-18T00:45:13.849839+00:00"}