{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:MCLVFCLZXQKJRYZDQEV2SALU4C","short_pith_number":"pith:MCLVFCLZ","schema_version":"1.0","canonical_sha256":"6097528979bc1498e323812ba90174e093188319f55d8862173522ab7c35fadb","source":{"kind":"arxiv","id":"0903.5136","version":3},"attestation_state":"computed","paper":{"title":"First passage percolation on random graphs with finite mean degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Gerard Hooghiemstra, Remco van der Hofstad, Shankar Bhamidi","submitted_at":"2009-03-30T07:06:50Z","abstract_excerpt":"We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly chosen connected vertices in the network, as well as for the number of edges on the least weight path, the so-called hopcount. We analyze the configuration model with degree power-law exponent $\\tau>2$, in which the degrees are assumed to be i.i.d. with a tail distribution which is either of power-law form with exponent $\\tau-1>1$, or has even thinner tails ($\\ta"},"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":"0903.5136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-03-30T07:06:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a7036829e9d5891d78f3eeca639f768cab88d6abd34cceac16fe073d17a9b797","abstract_canon_sha256":"e32a1e4fd863e9a97fc742f203298bdfa44fd4104261460257a55c59a8e014d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:49.390222Z","signature_b64":"WQEAqFzhALEqilyWpmsu6QY1fj8W+Uz5uWxRLu3Jf+l+6xHV8Ka+0Kk3CrCk47CqhgEbd0TtL2AYMR3+gBwvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6097528979bc1498e323812ba90174e093188319f55d8862173522ab7c35fadb","last_reissued_at":"2026-05-18T04:36:49.389780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:49.389780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First passage percolation on random graphs with finite mean degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Gerard Hooghiemstra, Remco van der Hofstad, Shankar Bhamidi","submitted_at":"2009-03-30T07:06:50Z","abstract_excerpt":"We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly chosen connected vertices in the network, as well as for the number of edges on the least weight path, the so-called hopcount. We analyze the configuration model with degree power-law exponent $\\tau>2$, in which the degrees are assumed to be i.i.d. with a tail distribution which is either of power-law form with exponent $\\tau-1>1$, or has even thinner tails ($\\ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.5136","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":"0903.5136","created_at":"2026-05-18T04:36:49.389846+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.5136v3","created_at":"2026-05-18T04:36:49.389846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.5136","created_at":"2026-05-18T04:36:49.389846+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCLVFCLZXQKJ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCLVFCLZXQKJRYZD","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCLVFCLZ","created_at":"2026-05-18T12:26:00.592388+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/MCLVFCLZXQKJRYZDQEV2SALU4C","json":"https://pith.science/pith/MCLVFCLZXQKJRYZDQEV2SALU4C.json","graph_json":"https://pith.science/api/pith-number/MCLVFCLZXQKJRYZDQEV2SALU4C/graph.json","events_json":"https://pith.science/api/pith-number/MCLVFCLZXQKJRYZDQEV2SALU4C/events.json","paper":"https://pith.science/paper/MCLVFCLZ"},"agent_actions":{"view_html":"https://pith.science/pith/MCLVFCLZXQKJRYZDQEV2SALU4C","download_json":"https://pith.science/pith/MCLVFCLZXQKJRYZDQEV2SALU4C.json","view_paper":"https://pith.science/paper/MCLVFCLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.5136&json=true","fetch_graph":"https://pith.science/api/pith-number/MCLVFCLZXQKJRYZDQEV2SALU4C/graph.json","fetch_events":"https://pith.science/api/pith-number/MCLVFCLZXQKJRYZDQEV2SALU4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCLVFCLZXQKJRYZDQEV2SALU4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCLVFCLZXQKJRYZDQEV2SALU4C/action/storage_attestation","attest_author":"https://pith.science/pith/MCLVFCLZXQKJRYZDQEV2SALU4C/action/author_attestation","sign_citation":"https://pith.science/pith/MCLVFCLZXQKJRYZDQEV2SALU4C/action/citation_signature","submit_replication":"https://pith.science/pith/MCLVFCLZXQKJRYZDQEV2SALU4C/action/replication_record"}},"created_at":"2026-05-18T04:36:49.389846+00:00","updated_at":"2026-05-18T04:36:49.389846+00:00"}