{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3ZR6PXKJ2PEWNRFOH4FCCFN77E","short_pith_number":"pith:3ZR6PXKJ","schema_version":"1.0","canonical_sha256":"de63e7dd49d3c966c4ae3f0a2115bff93ee7e6f4e5c95ead862f848b152c1ca4","source":{"kind":"arxiv","id":"1409.6397","version":1},"attestation_state":"computed","paper":{"title":"Optimal local routing on Delaunay triangulations defined by empty equilateral triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Prosenjit Bose, Rolf Fagerberg, Sander Verdonschot","submitted_at":"2014-09-23T02:50:23Z","abstract_excerpt":"We present a deterministic local routing algorithm that is guaranteed to find a path between any pair of vertices in a half-$\\theta_6$-graph (the half-$\\theta_6$-graph is equivalent to the Delaunay triangulation where the empty region is an equilateral triangle). The length of the path is at most $5/\\sqrt{3} \\approx 2.887$ times the Euclidean distance between the pair of vertices. Moreover, we show that no local routing algorithm can achieve a better routing ratio, thereby proving that our routing algorithm is optimal. This is somewhat surprising because the spanning ratio of the half-$\\theta_"},"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":"1409.6397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-23T02:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"b296f19204c5ef7ec11ac9d517730a54131b095bf98779f9006f4a3d045a5784","abstract_canon_sha256":"ce4a6d326cc2c6329d31a7a6d8ece7e7811a01eb2e7c9e37bd3011c12efc2b02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:07.230301Z","signature_b64":"P0xD+1FG9E7+4STg+tB2IyFk+a00XEonB/ImswNc06N64FttM/ioimAvlX9v64YQyZIrVCQFnRseYNh1pxjEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de63e7dd49d3c966c4ae3f0a2115bff93ee7e6f4e5c95ead862f848b152c1ca4","last_reissued_at":"2026-05-18T02:42:07.229771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:07.229771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal local routing on Delaunay triangulations defined by empty equilateral triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Prosenjit Bose, Rolf Fagerberg, Sander Verdonschot","submitted_at":"2014-09-23T02:50:23Z","abstract_excerpt":"We present a deterministic local routing algorithm that is guaranteed to find a path between any pair of vertices in a half-$\\theta_6$-graph (the half-$\\theta_6$-graph is equivalent to the Delaunay triangulation where the empty region is an equilateral triangle). The length of the path is at most $5/\\sqrt{3} \\approx 2.887$ times the Euclidean distance between the pair of vertices. Moreover, we show that no local routing algorithm can achieve a better routing ratio, thereby proving that our routing algorithm is optimal. This is somewhat surprising because the spanning ratio of the half-$\\theta_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6397","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":"1409.6397","created_at":"2026-05-18T02:42:07.229867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6397v1","created_at":"2026-05-18T02:42:07.229867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6397","created_at":"2026-05-18T02:42:07.229867+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZR6PXKJ2PEW","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZR6PXKJ2PEWNRFO","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZR6PXKJ","created_at":"2026-05-18T12:28:11.866339+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/3ZR6PXKJ2PEWNRFOH4FCCFN77E","json":"https://pith.science/pith/3ZR6PXKJ2PEWNRFOH4FCCFN77E.json","graph_json":"https://pith.science/api/pith-number/3ZR6PXKJ2PEWNRFOH4FCCFN77E/graph.json","events_json":"https://pith.science/api/pith-number/3ZR6PXKJ2PEWNRFOH4FCCFN77E/events.json","paper":"https://pith.science/paper/3ZR6PXKJ"},"agent_actions":{"view_html":"https://pith.science/pith/3ZR6PXKJ2PEWNRFOH4FCCFN77E","download_json":"https://pith.science/pith/3ZR6PXKJ2PEWNRFOH4FCCFN77E.json","view_paper":"https://pith.science/paper/3ZR6PXKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6397&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZR6PXKJ2PEWNRFOH4FCCFN77E/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZR6PXKJ2PEWNRFOH4FCCFN77E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZR6PXKJ2PEWNRFOH4FCCFN77E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZR6PXKJ2PEWNRFOH4FCCFN77E/action/storage_attestation","attest_author":"https://pith.science/pith/3ZR6PXKJ2PEWNRFOH4FCCFN77E/action/author_attestation","sign_citation":"https://pith.science/pith/3ZR6PXKJ2PEWNRFOH4FCCFN77E/action/citation_signature","submit_replication":"https://pith.science/pith/3ZR6PXKJ2PEWNRFOH4FCCFN77E/action/replication_record"}},"created_at":"2026-05-18T02:42:07.229867+00:00","updated_at":"2026-05-18T02:42:07.229867+00:00"}