{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EBHHQNB5VZP5U4ADJUHRIWPUMX","short_pith_number":"pith:EBHHQNB5","canonical_record":{"source":{"id":"1210.2657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-09T16:26:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4501ea2fa989f39f9f0ab5f6069ae0337c343b03f7497be2da711a7c386916fc","abstract_canon_sha256":"e8308f3820fcb3dfd9a7f5519137f2a52092f91d82a666a50af0ee6bfa9004f3"},"schema_version":"1.0"},"canonical_sha256":"204e78343dae5fda70034d0f1459f465c9f73121c181cbbc0aef719b265e1683","source":{"kind":"arxiv","id":"1210.2657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2657","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2657v1","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2657","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"EBHHQNB5VZP5","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EBHHQNB5VZP5U4AD","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EBHHQNB5","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EBHHQNB5VZP5U4ADJUHRIWPUMX","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-09T16:26:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4501ea2fa989f39f9f0ab5f6069ae0337c343b03f7497be2da711a7c386916fc","abstract_canon_sha256":"e8308f3820fcb3dfd9a7f5519137f2a52092f91d82a666a50af0ee6bfa9004f3"},"schema_version":"1.0"},"canonical_sha256":"204e78343dae5fda70034d0f1459f465c9f73121c181cbbc0aef719b265e1683","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:41.021525Z","signature_b64":"0I7Gy0W77nxbG+wfoqZzLUHIj726beimqOFfXjeLXKNWYKobPnMhhnVUFLpDKSZnlZDZ3cnuiPXWnYW/MpjHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"204e78343dae5fda70034d0f1459f465c9f73121c181cbbc0aef719b265e1683","last_reissued_at":"2026-05-18T03:43:41.021071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:41.021071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2657","source_version":1,"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:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WV1Mf6onFxzIAgmDIq77Xu+y9dJdkOPhL4r9Zs22OdEmHougu5oX8zDQztlXDG2XbE2SYB84Uz1DKERE3671BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:20:25.382948Z"},"content_sha256":"9cca65d6a17a08b0ea1dddbaf293d06636f1f9ca49c3a14792159775b391c42b","schema_version":"1.0","event_id":"sha256:9cca65d6a17a08b0ea1dddbaf293d06636f1f9ca49c3a14792159775b391c42b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EBHHQNB5VZP5U4ADJUHRIWPUMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest-weight paths in random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Hamed Amini, Yuval Peres","submitted_at":"2012-10-09T16:26:25Z","abstract_excerpt":"Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight paths between a fixed vertex and all the other vertices, as well as between any pair of vertices. Namely, for any fixed $d \\geq 3$, we show that the longest of these shortest-weight paths has about $\\hat{\\alpha}\\log n$ edges where $\\hat{\\alpha}$ is the unique solution of the equation $\\alpha \\log(\\frac{d-2}{d-1}\\alpha) - \\alpha = \\frac{d-3}{d-2}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2657","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"},"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:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sx3kGTL5MKGnjh5Z2UKglCinpFk1RsMW9RNGeBa2HDP9PFmKNjpURnDfvhiHy5LLkTosYIXCoHnT6J/rx6wJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:20:25.383338Z"},"content_sha256":"dc5482a6f72174ba830e41564d7625ed14a1cb740aa3f3db93b879e3c40f49a6","schema_version":"1.0","event_id":"sha256:dc5482a6f72174ba830e41564d7625ed14a1cb740aa3f3db93b879e3c40f49a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBHHQNB5VZP5U4ADJUHRIWPUMX/bundle.json","state_url":"https://pith.science/pith/EBHHQNB5VZP5U4ADJUHRIWPUMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBHHQNB5VZP5U4ADJUHRIWPUMX/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-25T09:20:25Z","links":{"resolver":"https://pith.science/pith/EBHHQNB5VZP5U4ADJUHRIWPUMX","bundle":"https://pith.science/pith/EBHHQNB5VZP5U4ADJUHRIWPUMX/bundle.json","state":"https://pith.science/pith/EBHHQNB5VZP5U4ADJUHRIWPUMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBHHQNB5VZP5U4ADJUHRIWPUMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EBHHQNB5VZP5U4ADJUHRIWPUMX","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":"e8308f3820fcb3dfd9a7f5519137f2a52092f91d82a666a50af0ee6bfa9004f3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-09T16:26:25Z","title_canon_sha256":"4501ea2fa989f39f9f0ab5f6069ae0337c343b03f7497be2da711a7c386916fc"},"schema_version":"1.0","source":{"id":"1210.2657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2657","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2657v1","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2657","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"EBHHQNB5VZP5","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EBHHQNB5VZP5U4AD","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EBHHQNB5","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:dc5482a6f72174ba830e41564d7625ed14a1cb740aa3f3db93b879e3c40f49a6","target":"graph","created_at":"2026-05-18T03:43: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":"Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight paths between a fixed vertex and all the other vertices, as well as between any pair of vertices. Namely, for any fixed $d \\geq 3$, we show that the longest of these shortest-weight paths has about $\\hat{\\alpha}\\log n$ edges where $\\hat{\\alpha}$ is the unique solution of the equation $\\alpha \\log(\\frac{d-2}{d-1}\\alpha) - \\alpha = \\frac{d-3}{d-2}$","authors_text":"Hamed Amini, Yuval Peres","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-09T16:26:25Z","title":"Shortest-weight paths in random regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2657","kind":"arxiv","version":1},"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:9cca65d6a17a08b0ea1dddbaf293d06636f1f9ca49c3a14792159775b391c42b","target":"record","created_at":"2026-05-18T03:43: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":"e8308f3820fcb3dfd9a7f5519137f2a52092f91d82a666a50af0ee6bfa9004f3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-09T16:26:25Z","title_canon_sha256":"4501ea2fa989f39f9f0ab5f6069ae0337c343b03f7497be2da711a7c386916fc"},"schema_version":"1.0","source":{"id":"1210.2657","kind":"arxiv","version":1}},"canonical_sha256":"204e78343dae5fda70034d0f1459f465c9f73121c181cbbc0aef719b265e1683","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"204e78343dae5fda70034d0f1459f465c9f73121c181cbbc0aef719b265e1683","first_computed_at":"2026-05-18T03:43:41.021071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:41.021071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0I7Gy0W77nxbG+wfoqZzLUHIj726beimqOFfXjeLXKNWYKobPnMhhnVUFLpDKSZnlZDZ3cnuiPXWnYW/MpjHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:41.021525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cca65d6a17a08b0ea1dddbaf293d06636f1f9ca49c3a14792159775b391c42b","sha256:dc5482a6f72174ba830e41564d7625ed14a1cb740aa3f3db93b879e3c40f49a6"],"state_sha256":"1caf6717d36c9723279c1322d0a61d579e18dea4ba74903e7215922ea83572d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3o+RBdqqYT093AqQbunUx1vwnwr5Yf06AYQQDyixi/VOtZ7ipThymUVlJSbOncCrL3iYZOp2PzzkRNkLeyVyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:20:25.385334Z","bundle_sha256":"2bd6714d71d5b9ace08e68e84fe45985aeed679ef95ce1607fbba103251237a9"}}