{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BH2D43RT5NTTJ3EAJDEDPVOHSU","short_pith_number":"pith:BH2D43RT","canonical_record":{"source":{"id":"1501.01783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-08T10:09:06Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"e045fb41b58a397c05e34427cdd2acde94b18d88cdfbc1620835271de54619da","abstract_canon_sha256":"85cadc122c84e370362d16b23808ace82dca4741b703c271c2438f8094c6d6ab"},"schema_version":"1.0"},"canonical_sha256":"09f43e6e33eb6734ec8048c837d5c7950905c43fe22a9044d7903eb3afe855ec","source":{"kind":"arxiv","id":"1501.01783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01783","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01783v1","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01783","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"BH2D43RT5NTT","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BH2D43RT5NTTJ3EA","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BH2D43RT","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BH2D43RT5NTTJ3EAJDEDPVOHSU","target":"record","payload":{"canonical_record":{"source":{"id":"1501.01783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-08T10:09:06Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"e045fb41b58a397c05e34427cdd2acde94b18d88cdfbc1620835271de54619da","abstract_canon_sha256":"85cadc122c84e370362d16b23808ace82dca4741b703c271c2438f8094c6d6ab"},"schema_version":"1.0"},"canonical_sha256":"09f43e6e33eb6734ec8048c837d5c7950905c43fe22a9044d7903eb3afe855ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:46.383066Z","signature_b64":"k5PKOYNmS6vj3Xfmb3PXOh15kp//jDvnNw7NyLLn622tvJQVoyl+kJMK2yJp2XgkjytAi0wABsOBMKe5P0IvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09f43e6e33eb6734ec8048c837d5c7950905c43fe22a9044d7903eb3afe855ec","last_reissued_at":"2026-05-18T02:29:46.382640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:46.382640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.01783","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:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soThRnRjGmJriwZ1D3dcuPs2BzHaQV58IDMLKps3BL82IdZFUpuZPx2M1TuoNGf+KC9X/MqYgGFhrnpY86jDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:44.809700Z"},"content_sha256":"76d19f348ac02ab9325ccee23d9a7e203cbccc8d59070dce9456605ee9616b5b","schema_version":"1.0","event_id":"sha256:76d19f348ac02ab9325ccee23d9a7e203cbccc8d59070dce9456605ee9616b5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BH2D43RT5NTTJ3EAJDEDPVOHSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Andr\\'e Van Renssen (NII), Jean-Lou De Carufel, Ljubomir Perkovi\\'c (SOC), Nicolas Bonichon (LaBRI), Prosenjit Bose","submitted_at":"2015-01-08T10:09:06Z","abstract_excerpt":"Consider a weighted graph G where vertices are points in the plane and edges are line segments. The weight of each edge is the Euclidean distance between its two endpoints. A routing algorithm on G has a competitive ratio of c if the length of the path produced by the algorithm from any vertex s to any vertex t is at most c times the length of the shortest path from s to t in G. If the length of the path is at most c times the Euclidean distance from s to t, we say that the routing algorithm on G has a routing ratio of c.We present an online routing algorithm on the Delaunay triangulation with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01783","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:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ji4a3NUoYQvIDIQk2C3PcN0pIjpFMFXPuJhC/yIihOzKTpD9NG/Rp0nirtkWFB+9U8SvseFa6yk2C1rgxPfZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:44.810429Z"},"content_sha256":"539ddc040e0eb65fbcebd71f29bb8bc72403e2a67edd6d4eec55ecbacd41d5d0","schema_version":"1.0","event_id":"sha256:539ddc040e0eb65fbcebd71f29bb8bc72403e2a67edd6d4eec55ecbacd41d5d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/bundle.json","state_url":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/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-25T18:53:44Z","links":{"resolver":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU","bundle":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/bundle.json","state":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BH2D43RT5NTTJ3EAJDEDPVOHSU","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":"85cadc122c84e370362d16b23808ace82dca4741b703c271c2438f8094c6d6ab","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-08T10:09:06Z","title_canon_sha256":"e045fb41b58a397c05e34427cdd2acde94b18d88cdfbc1620835271de54619da"},"schema_version":"1.0","source":{"id":"1501.01783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01783","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01783v1","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01783","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"BH2D43RT5NTT","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BH2D43RT5NTTJ3EA","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BH2D43RT","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:539ddc040e0eb65fbcebd71f29bb8bc72403e2a67edd6d4eec55ecbacd41d5d0","target":"graph","created_at":"2026-05-18T02:29:46Z","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":"Consider a weighted graph G where vertices are points in the plane and edges are line segments. The weight of each edge is the Euclidean distance between its two endpoints. A routing algorithm on G has a competitive ratio of c if the length of the path produced by the algorithm from any vertex s to any vertex t is at most c times the length of the shortest path from s to t in G. If the length of the path is at most c times the Euclidean distance from s to t, we say that the routing algorithm on G has a routing ratio of c.We present an online routing algorithm on the Delaunay triangulation with","authors_text":"Andr\\'e Van Renssen (NII), Jean-Lou De Carufel, Ljubomir Perkovi\\'c (SOC), Nicolas Bonichon (LaBRI), Prosenjit Bose","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-08T10:09:06Z","title":"Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01783","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:76d19f348ac02ab9325ccee23d9a7e203cbccc8d59070dce9456605ee9616b5b","target":"record","created_at":"2026-05-18T02:29:46Z","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":"85cadc122c84e370362d16b23808ace82dca4741b703c271c2438f8094c6d6ab","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-08T10:09:06Z","title_canon_sha256":"e045fb41b58a397c05e34427cdd2acde94b18d88cdfbc1620835271de54619da"},"schema_version":"1.0","source":{"id":"1501.01783","kind":"arxiv","version":1}},"canonical_sha256":"09f43e6e33eb6734ec8048c837d5c7950905c43fe22a9044d7903eb3afe855ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09f43e6e33eb6734ec8048c837d5c7950905c43fe22a9044d7903eb3afe855ec","first_computed_at":"2026-05-18T02:29:46.382640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:46.382640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k5PKOYNmS6vj3Xfmb3PXOh15kp//jDvnNw7NyLLn622tvJQVoyl+kJMK2yJp2XgkjytAi0wABsOBMKe5P0IvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:46.383066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76d19f348ac02ab9325ccee23d9a7e203cbccc8d59070dce9456605ee9616b5b","sha256:539ddc040e0eb65fbcebd71f29bb8bc72403e2a67edd6d4eec55ecbacd41d5d0"],"state_sha256":"827884a73e8213179dd26e65d1218bde6e6bb92e80322d4e6997fe5c23585aec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLO/0wQ0+EDG13iQpLKLgOLhKOFB+/SDewUoRpnUn20KGfTitS+waCknGd9Mq8qXvzyNxiKkJaIHGYGZ+TnrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:53:44.815031Z","bundle_sha256":"8a1f149428ca86061e7c60e7925d0a51c3d588107a23a11d6793425defe6ab57"}}