{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BH2D43RT5NTTJ3EAJDEDPVOHSU","short_pith_number":"pith:BH2D43RT","schema_version":"1.0","canonical_sha256":"09f43e6e33eb6734ec8048c837d5c7950905c43fe22a9044d7903eb3afe855ec","source":{"kind":"arxiv","id":"1501.01783","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.01783","created_at":"2026-05-18T02:29:46.382714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01783v1","created_at":"2026-05-18T02:29:46.382714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01783","created_at":"2026-05-18T02:29:46.382714+00:00"},{"alias_kind":"pith_short_12","alias_value":"BH2D43RT5NTT","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BH2D43RT5NTTJ3EA","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BH2D43RT","created_at":"2026-05-18T12:29:14.074870+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/BH2D43RT5NTTJ3EAJDEDPVOHSU","json":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU.json","graph_json":"https://pith.science/api/pith-number/BH2D43RT5NTTJ3EAJDEDPVOHSU/graph.json","events_json":"https://pith.science/api/pith-number/BH2D43RT5NTTJ3EAJDEDPVOHSU/events.json","paper":"https://pith.science/paper/BH2D43RT"},"agent_actions":{"view_html":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU","download_json":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU.json","view_paper":"https://pith.science/paper/BH2D43RT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01783&json=true","fetch_graph":"https://pith.science/api/pith-number/BH2D43RT5NTTJ3EAJDEDPVOHSU/graph.json","fetch_events":"https://pith.science/api/pith-number/BH2D43RT5NTTJ3EAJDEDPVOHSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/action/storage_attestation","attest_author":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/action/author_attestation","sign_citation":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/action/citation_signature","submit_replication":"https://pith.science/pith/BH2D43RT5NTTJ3EAJDEDPVOHSU/action/replication_record"}},"created_at":"2026-05-18T02:29:46.382714+00:00","updated_at":"2026-05-18T02:29:46.382714+00:00"}