{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UB4DXQZEWE5C5QHI7QAESUFQRC","short_pith_number":"pith:UB4DXQZE","canonical_record":{"source":{"id":"1402.6148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-25T12:28:04Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"314261c90a71f019bd8d7b30a1610eb1001f8d20be8c405d6114156339b34a3f","abstract_canon_sha256":"2428c42820a85caa6fdc5f6910f6b82ec2ef91370849735bfb71f676fd70b97b"},"schema_version":"1.0"},"canonical_sha256":"a0783bc324b13a2ec0e8fc004950b0888f78a91e15f8c8485e87ef3ff196b74c","source":{"kind":"arxiv","id":"1402.6148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6148","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6148v1","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6148","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"UB4DXQZEWE5C","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UB4DXQZEWE5C5QHI","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UB4DXQZE","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UB4DXQZEWE5C5QHI7QAESUFQRC","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-25T12:28:04Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"314261c90a71f019bd8d7b30a1610eb1001f8d20be8c405d6114156339b34a3f","abstract_canon_sha256":"2428c42820a85caa6fdc5f6910f6b82ec2ef91370849735bfb71f676fd70b97b"},"schema_version":"1.0"},"canonical_sha256":"a0783bc324b13a2ec0e8fc004950b0888f78a91e15f8c8485e87ef3ff196b74c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:51.509596Z","signature_b64":"EhvYnsAg2TZsTGdkvqomhXw+WYz1fVbtOS3J1SkJm1brxF+krbWFiPOkN03Ypm5LSpTxXdnbUi/6ewnFXxuiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0783bc324b13a2ec0e8fc004950b0888f78a91e15f8c8485e87ef3ff196b74c","last_reissued_at":"2026-05-18T02:57:51.509005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:51.509005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6148","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-18T02:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojjN9OxYLTK35L3BjVXRK4Fs92OYgh38i+dw66B32pSTpF/ilzUGoUSQMNgsJRifRmApAPrjuBkMHrZKBm1SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:07:26.922602Z"},"content_sha256":"23f26bfdd381bb39f369b03a754d999cc1f572a642cded0043655fbe9c4e46b5","schema_version":"1.0","event_id":"sha256:23f26bfdd381bb39f369b03a754d999cc1f572a642cded0043655fbe9c4e46b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UB4DXQZEWE5C5QHI7QAESUFQRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently navigating a random Delaunay triangulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"math.PR","authors_text":"Nicolas Broutin, Olivier Devillers, Ross Hemsley","submitted_at":"2014-02-25T12:28:04Z","abstract_excerpt":"Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to generate them under a random distribution hypothesis for the input. In this paper we analyse a new deterministic planar navigation algorithm with constant competitiveness which follows vertex adjacencies in the Delaunay triangulation. We call th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6148","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-18T02:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1f3cE4l/BEYK2lGKeHJXyypCAwHZR1wm2Kr97r6Ce4l0WWwKSG/byGG5hL0Z208EAx8fjxsEzxzmn/49L63Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:07:26.923277Z"},"content_sha256":"cdeb0a52833a88a6ff795fd309f7db46e6d55e2a5e22c6b702305244263b69e8","schema_version":"1.0","event_id":"sha256:cdeb0a52833a88a6ff795fd309f7db46e6d55e2a5e22c6b702305244263b69e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UB4DXQZEWE5C5QHI7QAESUFQRC/bundle.json","state_url":"https://pith.science/pith/UB4DXQZEWE5C5QHI7QAESUFQRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UB4DXQZEWE5C5QHI7QAESUFQRC/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-06-07T12:07:26Z","links":{"resolver":"https://pith.science/pith/UB4DXQZEWE5C5QHI7QAESUFQRC","bundle":"https://pith.science/pith/UB4DXQZEWE5C5QHI7QAESUFQRC/bundle.json","state":"https://pith.science/pith/UB4DXQZEWE5C5QHI7QAESUFQRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UB4DXQZEWE5C5QHI7QAESUFQRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UB4DXQZEWE5C5QHI7QAESUFQRC","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":"2428c42820a85caa6fdc5f6910f6b82ec2ef91370849735bfb71f676fd70b97b","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-25T12:28:04Z","title_canon_sha256":"314261c90a71f019bd8d7b30a1610eb1001f8d20be8c405d6114156339b34a3f"},"schema_version":"1.0","source":{"id":"1402.6148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6148","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6148v1","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6148","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"UB4DXQZEWE5C","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UB4DXQZEWE5C5QHI","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UB4DXQZE","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:cdeb0a52833a88a6ff795fd309f7db46e6d55e2a5e22c6b702305244263b69e8","target":"graph","created_at":"2026-05-18T02:57:51Z","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":"Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to generate them under a random distribution hypothesis for the input. In this paper we analyse a new deterministic planar navigation algorithm with constant competitiveness which follows vertex adjacencies in the Delaunay triangulation. We call th","authors_text":"Nicolas Broutin, Olivier Devillers, Ross Hemsley","cross_cats":["cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-25T12:28:04Z","title":"Efficiently navigating a random Delaunay triangulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6148","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:23f26bfdd381bb39f369b03a754d999cc1f572a642cded0043655fbe9c4e46b5","target":"record","created_at":"2026-05-18T02:57:51Z","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":"2428c42820a85caa6fdc5f6910f6b82ec2ef91370849735bfb71f676fd70b97b","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-25T12:28:04Z","title_canon_sha256":"314261c90a71f019bd8d7b30a1610eb1001f8d20be8c405d6114156339b34a3f"},"schema_version":"1.0","source":{"id":"1402.6148","kind":"arxiv","version":1}},"canonical_sha256":"a0783bc324b13a2ec0e8fc004950b0888f78a91e15f8c8485e87ef3ff196b74c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0783bc324b13a2ec0e8fc004950b0888f78a91e15f8c8485e87ef3ff196b74c","first_computed_at":"2026-05-18T02:57:51.509005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:51.509005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EhvYnsAg2TZsTGdkvqomhXw+WYz1fVbtOS3J1SkJm1brxF+krbWFiPOkN03Ypm5LSpTxXdnbUi/6ewnFXxuiAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:51.509596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23f26bfdd381bb39f369b03a754d999cc1f572a642cded0043655fbe9c4e46b5","sha256:cdeb0a52833a88a6ff795fd309f7db46e6d55e2a5e22c6b702305244263b69e8"],"state_sha256":"153a2789de936967f9cc3296af25d1ea0df208bfbbe2a3248b526fef2e0ec606"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGt5zg54O4LKjaKasF/UrJ0MJfVVUIwuU6GSG4gF0F/cGvyBflw6Q+pIwlI6S2vNaZ7hTDdEuR58vkipv6wxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:07:26.926576Z","bundle_sha256":"0da695d02626f4709d39e6296418787675d9e08e9d2710e9904140b847321d2d"}}