{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VCCJCZYUAYQU57MJQYXC7CUNVV","short_pith_number":"pith:VCCJCZYU","schema_version":"1.0","canonical_sha256":"a88491671406214efd89862e2f8a8dad6ce2cb22ecac879e49d795f56c5877dc","source":{"kind":"arxiv","id":"1011.5549","version":4},"attestation_state":"computed","paper":{"title":"Exact Distance Oracles for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Christian Sommer, Shay Mozes","submitted_at":"2010-11-25T03:30:26Z","abstract_excerpt":"We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles. For any directed planar graph on n nodes with non-negative lengths we obtain the following:\n  * Given a desired space allocation $S\\in[n\\lg\\lg n,n^2]$, we show how to construct in $\\tilde O(S)$ time a data structure of size $O(S)$ that answers distance queries in $\\tilde O(n/\\sqrt S)$ time per query.\n  As a consequence, we obtain an improvement over the fastest algorithm for k-many distances in planar graphs whenever $k\\in[\\sqrt "},"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":"1011.5549","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-25T03:30:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0d51f4fff92c8242d5d3cd162e94c98b8562c786f83a21b3c7946fa200c1166b","abstract_canon_sha256":"6582d8ee45d18301b195b9762ff0699a34dec40647733d13ef3156352f284c76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:34.821032Z","signature_b64":"rAUnsgbkcHtVnZALcuWSKt6237ZgeIeLDzvGEupE2ctu7gS8NpgUGmDKE0lLBGYNnpGHGLjB4Z/dlcNLb9MDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a88491671406214efd89862e2f8a8dad6ce2cb22ecac879e49d795f56c5877dc","last_reissued_at":"2026-05-18T04:08:34.820540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:34.820540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Distance Oracles for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Christian Sommer, Shay Mozes","submitted_at":"2010-11-25T03:30:26Z","abstract_excerpt":"We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles. For any directed planar graph on n nodes with non-negative lengths we obtain the following:\n  * Given a desired space allocation $S\\in[n\\lg\\lg n,n^2]$, we show how to construct in $\\tilde O(S)$ time a data structure of size $O(S)$ that answers distance queries in $\\tilde O(n/\\sqrt S)$ time per query.\n  As a consequence, we obtain an improvement over the fastest algorithm for k-many distances in planar graphs whenever $k\\in[\\sqrt "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5549","kind":"arxiv","version":4},"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":"1011.5549","created_at":"2026-05-18T04:08:34.820618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5549v4","created_at":"2026-05-18T04:08:34.820618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5549","created_at":"2026-05-18T04:08:34.820618+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCCJCZYUAYQU","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCCJCZYUAYQU57MJ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCCJCZYU","created_at":"2026-05-18T12:26:15.391820+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/VCCJCZYUAYQU57MJQYXC7CUNVV","json":"https://pith.science/pith/VCCJCZYUAYQU57MJQYXC7CUNVV.json","graph_json":"https://pith.science/api/pith-number/VCCJCZYUAYQU57MJQYXC7CUNVV/graph.json","events_json":"https://pith.science/api/pith-number/VCCJCZYUAYQU57MJQYXC7CUNVV/events.json","paper":"https://pith.science/paper/VCCJCZYU"},"agent_actions":{"view_html":"https://pith.science/pith/VCCJCZYUAYQU57MJQYXC7CUNVV","download_json":"https://pith.science/pith/VCCJCZYUAYQU57MJQYXC7CUNVV.json","view_paper":"https://pith.science/paper/VCCJCZYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5549&json=true","fetch_graph":"https://pith.science/api/pith-number/VCCJCZYUAYQU57MJQYXC7CUNVV/graph.json","fetch_events":"https://pith.science/api/pith-number/VCCJCZYUAYQU57MJQYXC7CUNVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCCJCZYUAYQU57MJQYXC7CUNVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCCJCZYUAYQU57MJQYXC7CUNVV/action/storage_attestation","attest_author":"https://pith.science/pith/VCCJCZYUAYQU57MJQYXC7CUNVV/action/author_attestation","sign_citation":"https://pith.science/pith/VCCJCZYUAYQU57MJQYXC7CUNVV/action/citation_signature","submit_replication":"https://pith.science/pith/VCCJCZYUAYQU57MJQYXC7CUNVV/action/replication_record"}},"created_at":"2026-05-18T04:08:34.820618+00:00","updated_at":"2026-05-18T04:08:34.820618+00:00"}