{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EC6HX57W7VKZFPSOBB5XW5X32U","short_pith_number":"pith:EC6HX57W","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"},"canonical_sha256":"20bc7bf7f6fd5592be4e087b7b76fbd5165db6be9a4ffb9d335ba9ef3ea15df6","source":{"kind":"arxiv","id":"1602.02293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02293","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02293v2","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02293","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"EC6HX57W7VKZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EC6HX57W7VKZFPSO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EC6HX57W","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EC6HX57W7VKZFPSOBB5XW5X32U","target":"record","payload":{"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"},"canonical_sha256":"20bc7bf7f6fd5592be4e087b7b76fbd5165db6be9a4ffb9d335ba9ef3ea15df6","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"},"source_kind":"arxiv","source_id":"1602.02293","source_version":2,"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-18T00:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwznnAh868FxjZRL9w17HVg4md/PzufkaRZCBuOHcGjtp8BPn+Z+8hVNSeYaboLn6adJMjtCj+J7+AVuWM7uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:19:11.178996Z"},"content_sha256":"bb93504ff6d596650f45ffa7fb42edbb30e57625102aff81a2639bb98676a4b4","schema_version":"1.0","event_id":"sha256:bb93504ff6d596650f45ffa7fb42edbb30e57625102aff81a2639bb98676a4b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EC6HX57W7VKZFPSOBB5XW5X32U","target":"graph","payload":{"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"},"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-18T00:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OsPVsN0lBwPKBy9QpZpRBIA/q2JyEQh8rAFFJ66xSIbHGohOQSTfLhblgjueWul3pL+M5xWw/IG7+wBkbk1vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:19:11.179346Z"},"content_sha256":"fb0b4436fa01c5386d9eb5777d762e52352d213f68c884e252a2e4210ab59f2e","schema_version":"1.0","event_id":"sha256:fb0b4436fa01c5386d9eb5777d762e52352d213f68c884e252a2e4210ab59f2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/bundle.json","state_url":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EC6HX57W7VKZFPSOBB5XW5X32U/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-06-25T07:19:11Z","links":{"resolver":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U","bundle":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/bundle.json","state":"https://pith.science/pith/EC6HX57W7VKZFPSOBB5XW5X32U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EC6HX57W7VKZFPSOBB5XW5X32U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EC6HX57W7VKZFPSOBB5XW5X32U","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":"8045d91c66e2f330c0814ec9e458ff4132dd5859c2b64d5859c42184e004b766","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-06T19:34:26Z","title_canon_sha256":"1280da6cc4222a8338191bd403daa0dc9a1a723700f9e1755fee1884f931d6f5"},"schema_version":"1.0","source":{"id":"1602.02293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02293","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02293v2","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02293","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"EC6HX57W7VKZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EC6HX57W7VKZFPSO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EC6HX57W","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:fb0b4436fa01c5386d9eb5777d762e52352d213f68c884e252a2e4210ab59f2e","target":"graph","created_at":"2026-05-18T00:57:38Z","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":"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","authors_text":"Michael Elkin, Ofer Neiman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-06T19:34:26Z","title":"On Efficient Distributed Construction of Near Optimal Routing Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02293","kind":"arxiv","version":2},"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:bb93504ff6d596650f45ffa7fb42edbb30e57625102aff81a2639bb98676a4b4","target":"record","created_at":"2026-05-18T00:57:38Z","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":"8045d91c66e2f330c0814ec9e458ff4132dd5859c2b64d5859c42184e004b766","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-06T19:34:26Z","title_canon_sha256":"1280da6cc4222a8338191bd403daa0dc9a1a723700f9e1755fee1884f931d6f5"},"schema_version":"1.0","source":{"id":"1602.02293","kind":"arxiv","version":2}},"canonical_sha256":"20bc7bf7f6fd5592be4e087b7b76fbd5165db6be9a4ffb9d335ba9ef3ea15df6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20bc7bf7f6fd5592be4e087b7b76fbd5165db6be9a4ffb9d335ba9ef3ea15df6","first_computed_at":"2026-05-18T00:57:38.030790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:38.030790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xxhqXjPpwn00XO8fcwWefL3o/vgt+3kT6D7g4qZ2klSBGte1AwT0NF63mIcm59j8JDb5rb4IFCOGo9aHicEIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:38.031353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb93504ff6d596650f45ffa7fb42edbb30e57625102aff81a2639bb98676a4b4","sha256:fb0b4436fa01c5386d9eb5777d762e52352d213f68c884e252a2e4210ab59f2e"],"state_sha256":"243a76c941dd6998eace46bd74bab30e2602ac94d10335411f5f8d19df542e1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86P1Z2CmwFHw/nNfI6UpQKAEwulLqT5TegMUs9YWIpZIcZ2lYIeAVBbspXYpEgrkEkXb9JJoZz6iBRMLWwAdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:19:11.181298Z","bundle_sha256":"cd7289c47174e2cd5a2ae2b366f8c6f148b9d75a1aef469b63bb22fef9f32bbe"}}