{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2YT3DWEB3PDNZWUXSMSVP3VZAP","short_pith_number":"pith:2YT3DWEB","schema_version":"1.0","canonical_sha256":"d627b1d881dbc6dcda97932557eeb903c3b51f1e602742b328afdcc0ec206494","source":{"kind":"arxiv","id":"1210.6839","version":1},"attestation_state":"computed","paper":{"title":"Universality for first passage percolation on sparse random graphs","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":"2012-10-25T13:46:45Z","abstract_excerpt":"We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a uniform X^2\\log{X}-condition, we analyze the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well the number of edges on this path or hopcount.\n  The hopcount satisfies a central limit theorem where the norming constants are expressible in terms of the parameters of an associated continuous-time branching process. "},"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":"1210.6839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-25T13:46:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8ba9e8f429266a42c18bd6fb837f6d46e3d3b6432d2d5b5ce3b2e649000b7e18","abstract_canon_sha256":"34c99b0b05e7d0b51401ba2278002405a95f2bc30f342a9f4999d27150150cd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:22.989043Z","signature_b64":"7wHop7pF1tdHND+mJjYIuB2KbVFqlw1I7WN6Lof2j5GSMLmmex54rG4+U0WVxi63dRyWdJKk86iomEitr+sfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d627b1d881dbc6dcda97932557eeb903c3b51f1e602742b328afdcc0ec206494","last_reissued_at":"2026-05-18T03:42:22.988504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:22.988504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality for first passage percolation on sparse random graphs","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":"2012-10-25T13:46:45Z","abstract_excerpt":"We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a uniform X^2\\log{X}-condition, we analyze the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well the number of edges on this path or hopcount.\n  The hopcount satisfies a central limit theorem where the norming constants are expressible in terms of the parameters of an associated continuous-time branching process. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6839","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.6839","created_at":"2026-05-18T03:42:22.988571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6839v1","created_at":"2026-05-18T03:42:22.988571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6839","created_at":"2026-05-18T03:42:22.988571+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YT3DWEB3PDN","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YT3DWEB3PDNZWUX","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YT3DWEB","created_at":"2026-05-18T12:26:50.516681+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/2YT3DWEB3PDNZWUXSMSVP3VZAP","json":"https://pith.science/pith/2YT3DWEB3PDNZWUXSMSVP3VZAP.json","graph_json":"https://pith.science/api/pith-number/2YT3DWEB3PDNZWUXSMSVP3VZAP/graph.json","events_json":"https://pith.science/api/pith-number/2YT3DWEB3PDNZWUXSMSVP3VZAP/events.json","paper":"https://pith.science/paper/2YT3DWEB"},"agent_actions":{"view_html":"https://pith.science/pith/2YT3DWEB3PDNZWUXSMSVP3VZAP","download_json":"https://pith.science/pith/2YT3DWEB3PDNZWUXSMSVP3VZAP.json","view_paper":"https://pith.science/paper/2YT3DWEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6839&json=true","fetch_graph":"https://pith.science/api/pith-number/2YT3DWEB3PDNZWUXSMSVP3VZAP/graph.json","fetch_events":"https://pith.science/api/pith-number/2YT3DWEB3PDNZWUXSMSVP3VZAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YT3DWEB3PDNZWUXSMSVP3VZAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YT3DWEB3PDNZWUXSMSVP3VZAP/action/storage_attestation","attest_author":"https://pith.science/pith/2YT3DWEB3PDNZWUXSMSVP3VZAP/action/author_attestation","sign_citation":"https://pith.science/pith/2YT3DWEB3PDNZWUXSMSVP3VZAP/action/citation_signature","submit_replication":"https://pith.science/pith/2YT3DWEB3PDNZWUXSMSVP3VZAP/action/replication_record"}},"created_at":"2026-05-18T03:42:22.988571+00:00","updated_at":"2026-05-18T03:42:22.988571+00:00"}