{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EC6HX57W7VKZFPSOBB5XW5X32U","short_pith_number":"pith:EC6HX57W","schema_version":"1.0","canonical_sha256":"20bc7bf7f6fd5592be4e087b7b76fbd5165db6be9a4ffb9d335ba9ef3ea15df6","source":{"kind":"arxiv","id":"1602.02293","version":2},"attestation_state":"computed","paper":{"title":"On Efficient Distributed Construction of Near Optimal Routing Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Michael Elkin, Ofer Neiman","submitted_at":"2016-02-06T19:34:26Z","abstract_excerpt":"Given a distributed network represented by a weighted undirected graph $G=(V,E)$ on $n$ vertices, and a parameter $k$, we devise a distributed algorithm that computes a routing scheme in $(n^{1/2+1/k}+D)\\cdot n^{o(1)}$ rounds, where $D$ is the hop-diameter of the network. The running time matches the lower bound of $\\tilde{\\Omega}(n^{1/2}+D)$ rounds (which holds for any scheme with polynomial stretch), up to lower order terms. The routing tables are of size $\\tilde{O}(n^{1/k})$, the labels are of size $O(k\\log^2n)$, and every packet is routed on a path suffering stretch at most $4k-5+o(1)$. Ou"},"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":"1602.02293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-06T19:34:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1280da6cc4222a8338191bd403daa0dc9a1a723700f9e1755fee1884f931d6f5","abstract_canon_sha256":"8045d91c66e2f330c0814ec9e458ff4132dd5859c2b64d5859c42184e004b766"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:38.031353Z","signature_b64":"xxhqXjPpwn00XO8fcwWefL3o/vgt+3kT6D7g4qZ2klSBGte1AwT0NF63mIcm59j8JDb5rb4IFCOGo9aHicEIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20bc7bf7f6fd5592be4e087b7b76fbd5165db6be9a4ffb9d335ba9ef3ea15df6","last_reissued_at":"2026-05-18T00:57:38.030790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:38.030790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Efficient Distributed Construction of Near Optimal Routing Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Michael Elkin, Ofer Neiman","submitted_at":"2016-02-06T19:34:26Z","abstract_excerpt":"Given a distributed network represented by a weighted undirected graph $G=(V,E)$ on $n$ vertices, and a parameter $k$, we devise a distributed algorithm that computes a routing scheme in $(n^{1/2+1/k}+D)\\cdot n^{o(1)}$ rounds, where $D$ is the hop-diameter of the network. The running time matches the lower bound of $\\tilde{\\Omega}(n^{1/2}+D)$ rounds (which holds for any scheme with polynomial stretch), up to lower order terms. The routing tables are of size $\\tilde{O}(n^{1/k})$, the labels are of size $O(k\\log^2n)$, and every packet is routed on a path suffering stretch at most $4k-5+o(1)$. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02293","kind":"arxiv","version":2},"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":"1602.02293","created_at":"2026-05-18T00:57:38.030871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02293v2","created_at":"2026-05-18T00:57:38.030871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02293","created_at":"2026-05-18T00:57:38.030871+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC6HX57W7VKZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC6HX57W7VKZFPSO","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC6HX57W","created_at":"2026-05-18T12:30:12.583610+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/EC6HX57W7VKZFPSOBB5XW5X32U","json":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U.json","graph_json":"https://pith.science/api/pith-number/EC6HX57W7VKZFPSOBB5XW5X32U/graph.json","events_json":"https://pith.science/api/pith-number/EC6HX57W7VKZFPSOBB5XW5X32U/events.json","paper":"https://pith.science/paper/EC6HX57W"},"agent_actions":{"view_html":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U","download_json":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U.json","view_paper":"https://pith.science/paper/EC6HX57W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02293&json=true","fetch_graph":"https://pith.science/api/pith-number/EC6HX57W7VKZFPSOBB5XW5X32U/graph.json","fetch_events":"https://pith.science/api/pith-number/EC6HX57W7VKZFPSOBB5XW5X32U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/action/storage_attestation","attest_author":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/action/author_attestation","sign_citation":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/action/citation_signature","submit_replication":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/action/replication_record"}},"created_at":"2026-05-18T00:57:38.030871+00:00","updated_at":"2026-05-18T00:57:38.030871+00:00"}