{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WCY2WRF37RUH23KBZBS5Z6PSRP","short_pith_number":"pith:WCY2WRF3","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"},"canonical_sha256":"b0b1ab44bbfc687d6d41c865dcf9f28be3e5034a02a19965448fd631588cd1a2","source":{"kind":"arxiv","id":"1708.01386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01386","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01386v1","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01386","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"WCY2WRF37RUH","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WCY2WRF37RUH23KB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WCY2WRF3","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WCY2WRF37RUH23KBZBS5Z6PSRP","target":"record","payload":{"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"},"canonical_sha256":"b0b1ab44bbfc687d6d41c865dcf9f28be3e5034a02a19965448fd631588cd1a2","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"},"source_kind":"arxiv","source_id":"1708.01386","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/O7AYIU9GKTsutjjIOuDuRid61vHD6H+mu42pXaQBSpQJVHw4kv6N9ab0MHYgRM+ALSDKptWAEcWMxt2ALXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:08:48.448885Z"},"content_sha256":"936ca135f5d580c3572b7a48d192df41c120abc14f820e887f148eb0255be364","schema_version":"1.0","event_id":"sha256:936ca135f5d580c3572b7a48d192df41c120abc14f820e887f148eb0255be364"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WCY2WRF37RUH23KBZBS5Z6PSRP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2dN5yoyo4rvZSzr0SW1vzvVC7AA9mjgx3L8qJppZXR0gw1InS4vxRwaz5DxtslF02YsY+DA9/kAcb10KFpjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:08:48.449601Z"},"content_sha256":"81120c66a258142764a264893eb9033ac49ef463334cea0a2f73d224c5015ca9","schema_version":"1.0","event_id":"sha256:81120c66a258142764a264893eb9033ac49ef463334cea0a2f73d224c5015ca9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/bundle.json","state_url":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T20:08:48Z","links":{"resolver":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP","bundle":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/bundle.json","state":"https://pith.science/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCY2WRF37RUH23KBZBS5Z6PSRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WCY2WRF37RUH23KBZBS5Z6PSRP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d98fe95bcb0927b08189ecab131bb04ed444df0a533370d181f3cb56aff39e23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-04T05:58:10Z","title_canon_sha256":"727191d558621aa7e57a96cc635b7f3b13e4e890efc5c05805707701d86182fe"},"schema_version":"1.0","source":{"id":"1708.01386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01386","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01386v1","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01386","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"WCY2WRF37RUH","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WCY2WRF37RUH23KB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WCY2WRF3","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:81120c66a258142764a264893eb9033ac49ef463334cea0a2f73d224c5015ca9","target":"graph","created_at":"2026-05-18T00:38:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christian Wulff-Nilsen, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-04T05:58:10Z","title":"Better Tradeoffs for Exact Distance Oracles in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01386","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:936ca135f5d580c3572b7a48d192df41c120abc14f820e887f148eb0255be364","target":"record","created_at":"2026-05-18T00:38:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d98fe95bcb0927b08189ecab131bb04ed444df0a533370d181f3cb56aff39e23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-04T05:58:10Z","title_canon_sha256":"727191d558621aa7e57a96cc635b7f3b13e4e890efc5c05805707701d86182fe"},"schema_version":"1.0","source":{"id":"1708.01386","kind":"arxiv","version":1}},"canonical_sha256":"b0b1ab44bbfc687d6d41c865dcf9f28be3e5034a02a19965448fd631588cd1a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0b1ab44bbfc687d6d41c865dcf9f28be3e5034a02a19965448fd631588cd1a2","first_computed_at":"2026-05-18T00:38:37.536441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:37.536441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hxGi4ABW7Sad94ez+J9pDuYSNWS8mfn/UDCo2QyF0c+BK1M5zwKeYQFMwI+TrQqEevM3v7HM8IKunEKP/M6rBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:37.536895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:936ca135f5d580c3572b7a48d192df41c120abc14f820e887f148eb0255be364","sha256:81120c66a258142764a264893eb9033ac49ef463334cea0a2f73d224c5015ca9"],"state_sha256":"bed1eb5fe8f05168f34796b4f3901e9691f35c8cf0ac73d3363943fc54bbb094"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rY7MKJkY3TNtfxAW3FDqvP0NRcnKiSFYN+Lb5P0Z2Us7BHgrD5hnRsSlSyKX5Vql1FULXjqzFAl3byOnyvmNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:08:48.453600Z","bundle_sha256":"4ce5959a7a2494e3236004f441cba430b21692a8b132044a161cb713577e5707"}}