{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WCY2WRF37RUH23KBZBS5Z6PSRP","short_pith_number":"pith:WCY2WRF3","schema_version":"1.0","canonical_sha256":"b0b1ab44bbfc687d6d41c865dcf9f28be3e5034a02a19965448fd631588cd1a2","source":{"kind":"arxiv","id":"1708.01386","version":1},"attestation_state":"computed","paper":{"title":"Better Tradeoffs for Exact Distance Oracles in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2017-08-04T05:58:10Z","abstract_excerpt":"We present an $O(n^{1.5})$-space distance oracle for directed planar graphs that answers distance queries in $O(\\log n)$ time. Our oracle both significantly simplifies and significantly improves the recent oracle of Cohen-Addad, Dahlgaard and Wulff-Nilsen [FOCS 2017], which uses $O(n^{5/3})$-space and answers queries in $O(\\log n)$ time. We achieve this by designing an elegant and efficient point location data structure for Voronoi diagrams on planar graphs.\n  We further show a smooth tradeoff between space and query-time. For any $S\\in [n,n^2]$, we show an oracle of size $S$ that answers quer"},"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":"1708.01386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-04T05:58:10Z","cross_cats_sorted":[],"title_canon_sha256":"727191d558621aa7e57a96cc635b7f3b13e4e890efc5c05805707701d86182fe","abstract_canon_sha256":"d98fe95bcb0927b08189ecab131bb04ed444df0a533370d181f3cb56aff39e23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:37.536895Z","signature_b64":"hxGi4ABW7Sad94ez+J9pDuYSNWS8mfn/UDCo2QyF0c+BK1M5zwKeYQFMwI+TrQqEevM3v7HM8IKunEKP/M6rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0b1ab44bbfc687d6d41c865dcf9f28be3e5034a02a19965448fd631588cd1a2","last_reissued_at":"2026-05-18T00:38:37.536441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:37.536441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Tradeoffs for Exact Distance Oracles in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2017-08-04T05:58:10Z","abstract_excerpt":"We present an $O(n^{1.5})$-space distance oracle for directed planar graphs that answers distance queries in $O(\\log n)$ time. Our oracle both significantly simplifies and significantly improves the recent oracle of Cohen-Addad, Dahlgaard and Wulff-Nilsen [FOCS 2017], which uses $O(n^{5/3})$-space and answers queries in $O(\\log n)$ time. We achieve this by designing an elegant and efficient point location data structure for Voronoi diagrams on planar graphs.\n  We further show a smooth tradeoff between space and query-time. For any $S\\in [n,n^2]$, we show an oracle of size $S$ that answers quer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01386","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":""},"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":"1708.01386","created_at":"2026-05-18T00:38:37.536515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01386v1","created_at":"2026-05-18T00:38:37.536515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01386","created_at":"2026-05-18T00:38:37.536515+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCY2WRF37RUH","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCY2WRF37RUH23KB","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCY2WRF3","created_at":"2026-05-18T12:31:53.515858+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/WCY2WRF37RUH23KBZBS5Z6PSRP","json":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP.json","graph_json":"https://pith.science/api/pith-number/WCY2WRF37RUH23KBZBS5Z6PSRP/graph.json","events_json":"https://pith.science/api/pith-number/WCY2WRF37RUH23KBZBS5Z6PSRP/events.json","paper":"https://pith.science/paper/WCY2WRF3"},"agent_actions":{"view_html":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP","download_json":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP.json","view_paper":"https://pith.science/paper/WCY2WRF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01386&json=true","fetch_graph":"https://pith.science/api/pith-number/WCY2WRF37RUH23KBZBS5Z6PSRP/graph.json","fetch_events":"https://pith.science/api/pith-number/WCY2WRF37RUH23KBZBS5Z6PSRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/action/storage_attestation","attest_author":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/action/author_attestation","sign_citation":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/action/citation_signature","submit_replication":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/action/replication_record"}},"created_at":"2026-05-18T00:38:37.536515+00:00","updated_at":"2026-05-18T00:38:37.536515+00:00"}