{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SWCXZCJVN3GHM3XIFHFXFR3BX3","short_pith_number":"pith:SWCXZCJV","schema_version":"1.0","canonical_sha256":"95857c89356ecc766ee829cb72c761bec624b805d41e7c85dbdcde70880dccaa","source":{"kind":"arxiv","id":"1407.6730","version":3},"attestation_state":"computed","paper":{"title":"New routing techniques and their applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Liam Roditty, Roei Tov","submitted_at":"2014-07-24T20:32:09Z","abstract_excerpt":"Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges. We obtain the following new routing schemes:\n  - A routing scheme for unweighted graphs that uses $\\tilde O(\\frac{1}{\\epsilon} n^{2/3})$ space at each vertex and $\\tilde O(1/\\epsilon)$-bit headers, to route a message between any pair of vertices $u,v\\in V$ on a $(2 + \\epsilon,1)$-stretch path, i.e., a path of length at most $(2+\\epsilon)\\cdot d(u,v)+1$. This should be compared to the $(2,1)$-stretch and $\\tilde O(n^{5/3})$ space distance oracle of Patrascu and Roditty [FOCS'10 and SIAM J. Comput. 2014] and to the $(2,1)$-str"},"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":"1407.6730","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T20:32:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"987313652441caddad336f16369ad57715126b8926e8c1a28fe0604c5ceb5aea","abstract_canon_sha256":"e8b23e0a1d52a08b9da1266f1bf558963bc80781e50b5c7ae33fe86c64a89cde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:57.534590Z","signature_b64":"DneITLrTl6ztNj2JeHp3QQ7R18iJcNL3EENupeg5gxQIH3xmcb9jVgMm9GXOZej5a03U4OLuRtleWPWztQFQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95857c89356ecc766ee829cb72c761bec624b805d41e7c85dbdcde70880dccaa","last_reissued_at":"2026-05-18T02:45:57.534157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:57.534157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New routing techniques and their applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Liam Roditty, Roei Tov","submitted_at":"2014-07-24T20:32:09Z","abstract_excerpt":"Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges. We obtain the following new routing schemes:\n  - A routing scheme for unweighted graphs that uses $\\tilde O(\\frac{1}{\\epsilon} n^{2/3})$ space at each vertex and $\\tilde O(1/\\epsilon)$-bit headers, to route a message between any pair of vertices $u,v\\in V$ on a $(2 + \\epsilon,1)$-stretch path, i.e., a path of length at most $(2+\\epsilon)\\cdot d(u,v)+1$. This should be compared to the $(2,1)$-stretch and $\\tilde O(n^{5/3})$ space distance oracle of Patrascu and Roditty [FOCS'10 and SIAM J. Comput. 2014] and to the $(2,1)$-str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6730","kind":"arxiv","version":3},"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":"1407.6730","created_at":"2026-05-18T02:45:57.534216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6730v3","created_at":"2026-05-18T02:45:57.534216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6730","created_at":"2026-05-18T02:45:57.534216+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWCXZCJVN3GH","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWCXZCJVN3GHM3XI","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWCXZCJV","created_at":"2026-05-18T12:28:49.207871+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/SWCXZCJVN3GHM3XIFHFXFR3BX3","json":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3.json","graph_json":"https://pith.science/api/pith-number/SWCXZCJVN3GHM3XIFHFXFR3BX3/graph.json","events_json":"https://pith.science/api/pith-number/SWCXZCJVN3GHM3XIFHFXFR3BX3/events.json","paper":"https://pith.science/paper/SWCXZCJV"},"agent_actions":{"view_html":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3","download_json":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3.json","view_paper":"https://pith.science/paper/SWCXZCJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6730&json=true","fetch_graph":"https://pith.science/api/pith-number/SWCXZCJVN3GHM3XIFHFXFR3BX3/graph.json","fetch_events":"https://pith.science/api/pith-number/SWCXZCJVN3GHM3XIFHFXFR3BX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/action/storage_attestation","attest_author":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/action/author_attestation","sign_citation":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/action/citation_signature","submit_replication":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/action/replication_record"}},"created_at":"2026-05-18T02:45:57.534216+00:00","updated_at":"2026-05-18T02:45:57.534216+00:00"}