{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2AOPYNQOZCQPRIKZ6T325NS3JX","short_pith_number":"pith:2AOPYNQO","schema_version":"1.0","canonical_sha256":"d01cfc360ec8a0f8a159f4f7aeb65b4dcbb5d33d9ad0bcfe42d4d8cef2bd6e47","source":{"kind":"arxiv","id":"1811.01551","version":1},"attestation_state":"computed","paper":{"title":"Almost Optimal Distance Oracles for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Weimann, Panagiotis Charalampopoulos, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2018-11-05T08:37:57Z","abstract_excerpt":"We present new tradeoffs between space and query-time for exact distance oracles in directed weighted planar graphs. These tradeoffs are almost optimal in the sense that they are within polylogarithmic, sub-polynomial or arbitrarily small polynomial factors from the na\\\"{\\i}ve linear space, constant query-time lower bound. These tradeoffs include: (i) an oracle with space $\\tilde{O}(n^{1+\\epsilon})$ and query-time $\\tilde{O}(1)$ for any constant $\\epsilon>0$, (ii) an oracle with space $\\tilde{O}(n)$ and query-time $\\tilde{O}(n^{\\epsilon})$ for any constant $\\epsilon>0$, and (iii) an oracle wit"},"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":"1811.01551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-05T08:37:57Z","cross_cats_sorted":[],"title_canon_sha256":"aa6d4301d7893586f6d7fd7793295be66c5e2ab861aba1ce2b9d86ab74777f45","abstract_canon_sha256":"d6be4e2ede99a34224e9e853033bea347e910b9296d4e7a36d2c8592b5813f66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:33.996930Z","signature_b64":"NV21BjJ6qruQOInWCby5VgG83Zd8fmoLatpnWsUnAphibICmuxTSJEDrbiRuqcLIBYXIAR0gijL8zkqiSNQ6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d01cfc360ec8a0f8a159f4f7aeb65b4dcbb5d33d9ad0bcfe42d4d8cef2bd6e47","last_reissued_at":"2026-05-18T00:01:33.996256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:33.996256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Optimal Distance Oracles for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Weimann, Panagiotis Charalampopoulos, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2018-11-05T08:37:57Z","abstract_excerpt":"We present new tradeoffs between space and query-time for exact distance oracles in directed weighted planar graphs. These tradeoffs are almost optimal in the sense that they are within polylogarithmic, sub-polynomial or arbitrarily small polynomial factors from the na\\\"{\\i}ve linear space, constant query-time lower bound. These tradeoffs include: (i) an oracle with space $\\tilde{O}(n^{1+\\epsilon})$ and query-time $\\tilde{O}(1)$ for any constant $\\epsilon>0$, (ii) an oracle with space $\\tilde{O}(n)$ and query-time $\\tilde{O}(n^{\\epsilon})$ for any constant $\\epsilon>0$, and (iii) an oracle wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01551","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":"1811.01551","created_at":"2026-05-18T00:01:33.996369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01551v1","created_at":"2026-05-18T00:01:33.996369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01551","created_at":"2026-05-18T00:01:33.996369+00:00"},{"alias_kind":"pith_short_12","alias_value":"2AOPYNQOZCQP","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2AOPYNQOZCQPRIKZ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2AOPYNQO","created_at":"2026-05-18T12:31:59.375834+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/2AOPYNQOZCQPRIKZ6T325NS3JX","json":"https://pith.science/pith/2AOPYNQOZCQPRIKZ6T325NS3JX.json","graph_json":"https://pith.science/api/pith-number/2AOPYNQOZCQPRIKZ6T325NS3JX/graph.json","events_json":"https://pith.science/api/pith-number/2AOPYNQOZCQPRIKZ6T325NS3JX/events.json","paper":"https://pith.science/paper/2AOPYNQO"},"agent_actions":{"view_html":"https://pith.science/pith/2AOPYNQOZCQPRIKZ6T325NS3JX","download_json":"https://pith.science/pith/2AOPYNQOZCQPRIKZ6T325NS3JX.json","view_paper":"https://pith.science/paper/2AOPYNQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01551&json=true","fetch_graph":"https://pith.science/api/pith-number/2AOPYNQOZCQPRIKZ6T325NS3JX/graph.json","fetch_events":"https://pith.science/api/pith-number/2AOPYNQOZCQPRIKZ6T325NS3JX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2AOPYNQOZCQPRIKZ6T325NS3JX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2AOPYNQOZCQPRIKZ6T325NS3JX/action/storage_attestation","attest_author":"https://pith.science/pith/2AOPYNQOZCQPRIKZ6T325NS3JX/action/author_attestation","sign_citation":"https://pith.science/pith/2AOPYNQOZCQPRIKZ6T325NS3JX/action/citation_signature","submit_replication":"https://pith.science/pith/2AOPYNQOZCQPRIKZ6T325NS3JX/action/replication_record"}},"created_at":"2026-05-18T00:01:33.996369+00:00","updated_at":"2026-05-18T00:01:33.996369+00:00"}