{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:34X7CGXBRNJ74FCW5JDSXTWAEV","short_pith_number":"pith:34X7CGXB","canonical_record":{"source":{"id":"1210.5774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-21T23:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"c38bc1128cf03f15f3fb408a624474e53281b49e01945a56167557971b8bdd8e","abstract_canon_sha256":"69be990e8dec26cba25fb4ceb04fbedb6804de35f18e7de577ac03fb839f7f16"},"schema_version":"1.0"},"canonical_sha256":"df2ff11ae18b53fe1456ea472bcec025664353a7bb8e3a789ba325f23d3ccf8f","source":{"kind":"arxiv","id":"1210.5774","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5774","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5774v2","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5774","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"34X7CGXBRNJ7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"34X7CGXBRNJ74FCW","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"34X7CGXB","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:34X7CGXBRNJ74FCW5JDSXTWAEV","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-21T23:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"c38bc1128cf03f15f3fb408a624474e53281b49e01945a56167557971b8bdd8e","abstract_canon_sha256":"69be990e8dec26cba25fb4ceb04fbedb6804de35f18e7de577ac03fb839f7f16"},"schema_version":"1.0"},"canonical_sha256":"df2ff11ae18b53fe1456ea472bcec025664353a7bb8e3a789ba325f23d3ccf8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:41.810800Z","signature_b64":"ZWhBOWrb05JsQza3IZe00IhxvjWCwk7PqXaYzxINX0BDdXjcyGJAxG+yG4Sv+pEkQOEagCP2GaEvQKgVPibhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df2ff11ae18b53fe1456ea472bcec025664353a7bb8e3a789ba325f23d3ccf8f","last_reissued_at":"2026-05-18T03:41:41.809690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:41.809690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5774","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-18T03:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JXtSirKxLjaX9XuspVEAwYdXM7HiWFyL+66txP3B6MZo1/EMlhebzWICl27gJc1HIRz43u9ElWVd2XxyxrWCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:57:18.734560Z"},"content_sha256":"64ce0607208a3f6adf623fe191e4a23c618cca97cdac84dc465b5c7ccdba0d46","schema_version":"1.0","event_id":"sha256:64ce0607208a3f6adf623fe191e4a23c618cca97cdac84dc465b5c7ccdba0d46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:34X7CGXBRNJ74FCW5JDSXTWAEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Routing Table Construction Using Small Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Boaz Patt-Shamir, Christoph Lenzen","submitted_at":"2012-10-21T23:01:59Z","abstract_excerpt":"We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD denote the hop diameter of the graph, i.e., the diameter of the graph when all edges are considered to have unit weight. Given 0 < eps <= 1/2, our algorithm runs in weak-O(n^(1/2 + eps) + HD) communication rounds using messages of O(log n) bits and guarantees a stretch of O(eps^(-1) log eps^(-1)) with high probability. This is the first distributed algorithm approximating weighted shortest paths that uses small mess"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5774","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-18T03:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npXrsdur1+bEmmniHqcJZzhKtje2dME7P/Z0BHg+zObsd+EIGkda667YrzH19VNmPamr8B6LsqmOVaWpcfgiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:57:18.735282Z"},"content_sha256":"7959f5d39a57d2db6ff3788d8eb19e20b30542e53c2b8cac340346bb5a719003","schema_version":"1.0","event_id":"sha256:7959f5d39a57d2db6ff3788d8eb19e20b30542e53c2b8cac340346bb5a719003"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34X7CGXBRNJ74FCW5JDSXTWAEV/bundle.json","state_url":"https://pith.science/pith/34X7CGXBRNJ74FCW5JDSXTWAEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34X7CGXBRNJ74FCW5JDSXTWAEV/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-05-29T14:57:18Z","links":{"resolver":"https://pith.science/pith/34X7CGXBRNJ74FCW5JDSXTWAEV","bundle":"https://pith.science/pith/34X7CGXBRNJ74FCW5JDSXTWAEV/bundle.json","state":"https://pith.science/pith/34X7CGXBRNJ74FCW5JDSXTWAEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34X7CGXBRNJ74FCW5JDSXTWAEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:34X7CGXBRNJ74FCW5JDSXTWAEV","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":"69be990e8dec26cba25fb4ceb04fbedb6804de35f18e7de577ac03fb839f7f16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-21T23:01:59Z","title_canon_sha256":"c38bc1128cf03f15f3fb408a624474e53281b49e01945a56167557971b8bdd8e"},"schema_version":"1.0","source":{"id":"1210.5774","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5774","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5774v2","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5774","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"34X7CGXBRNJ7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"34X7CGXBRNJ74FCW","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"34X7CGXB","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:7959f5d39a57d2db6ff3788d8eb19e20b30542e53c2b8cac340346bb5a719003","target":"graph","created_at":"2026-05-18T03:41:41Z","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":"We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD denote the hop diameter of the graph, i.e., the diameter of the graph when all edges are considered to have unit weight. Given 0 < eps <= 1/2, our algorithm runs in weak-O(n^(1/2 + eps) + HD) communication rounds using messages of O(log n) bits and guarantees a stretch of O(eps^(-1) log eps^(-1)) with high probability. This is the first distributed algorithm approximating weighted shortest paths that uses small mess","authors_text":"Boaz Patt-Shamir, Christoph Lenzen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-21T23:01:59Z","title":"Fast Routing Table Construction Using Small Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5774","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:64ce0607208a3f6adf623fe191e4a23c618cca97cdac84dc465b5c7ccdba0d46","target":"record","created_at":"2026-05-18T03:41:41Z","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":"69be990e8dec26cba25fb4ceb04fbedb6804de35f18e7de577ac03fb839f7f16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-21T23:01:59Z","title_canon_sha256":"c38bc1128cf03f15f3fb408a624474e53281b49e01945a56167557971b8bdd8e"},"schema_version":"1.0","source":{"id":"1210.5774","kind":"arxiv","version":2}},"canonical_sha256":"df2ff11ae18b53fe1456ea472bcec025664353a7bb8e3a789ba325f23d3ccf8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df2ff11ae18b53fe1456ea472bcec025664353a7bb8e3a789ba325f23d3ccf8f","first_computed_at":"2026-05-18T03:41:41.809690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:41.809690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZWhBOWrb05JsQza3IZe00IhxvjWCwk7PqXaYzxINX0BDdXjcyGJAxG+yG4Sv+pEkQOEagCP2GaEvQKgVPibhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:41.810800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5774","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64ce0607208a3f6adf623fe191e4a23c618cca97cdac84dc465b5c7ccdba0d46","sha256:7959f5d39a57d2db6ff3788d8eb19e20b30542e53c2b8cac340346bb5a719003"],"state_sha256":"09dbf8cc7ce21c9e406de20645bce2af630260979c7c8f8a41935324de7407ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3j+XkZeibyEnA3yUoS4RN3VY4D99orOz4tXAvRuSOFfT1jKnDA7/xpIXl80mD5h0r7ju+REuOZnKHxbnZrZUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:57:18.739404Z","bundle_sha256":"7e76e6d22a3dd8f3d1d283d9b46b49a79d73374c348fdba2210288957b450834"}}