{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:57TDOR6P7RIGOJZUCG5A4G4A6S","short_pith_number":"pith:57TDOR6P","schema_version":"1.0","canonical_sha256":"efe63747cffc5067273411ba0e1b80f4a771b6ecdee73f1ce2e4c68a23be433e","source":{"kind":"arxiv","id":"1711.02902","version":1},"attestation_state":"computed","paper":{"title":"Competing first passage percolation on random graphs with finite variance degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniel Ahlberg, Maria Deijfen, Svante Janson","submitted_at":"2017-11-08T10:56:05Z","abstract_excerpt":"We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph in that an uninfected vertex becomes type 1 (2) infected at rate $\\lambda_1$ ($\\lambda_2$) times the number of nearest neighbors of type 1 (2). Assuming (essentially) that the degree of a randomly chosen vertex has finite second moment, we show that if $\\lambda_1=\\lambda_2$, then the fraction of vertices that are ultimately infected by type 1 converges to a c"},"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":"1711.02902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-08T10:56:05Z","cross_cats_sorted":[],"title_canon_sha256":"f76a5c4ab214e516c0054b0b6e408fcc52f0fefd0cf9f8b9e68a28ea3671bce1","abstract_canon_sha256":"34f71fd1e1b50b07b95467b4c2a4218b7ff951b85f5917bed0dd81cde9347c99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:01.402611Z","signature_b64":"G7QL7tf+n+vZmikMEVASrtDeYFJukSUNEk3lTSSvkBqiA7dv3ld6LhFa34LbrYF27zChBcSu6Z9YEOzR2ab+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efe63747cffc5067273411ba0e1b80f4a771b6ecdee73f1ce2e4c68a23be433e","last_reissued_at":"2026-05-18T00:31:01.402040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:01.402040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competing first passage percolation on random graphs with finite variance degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniel Ahlberg, Maria Deijfen, Svante Janson","submitted_at":"2017-11-08T10:56:05Z","abstract_excerpt":"We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph in that an uninfected vertex becomes type 1 (2) infected at rate $\\lambda_1$ ($\\lambda_2$) times the number of nearest neighbors of type 1 (2). Assuming (essentially) that the degree of a randomly chosen vertex has finite second moment, we show that if $\\lambda_1=\\lambda_2$, then the fraction of vertices that are ultimately infected by type 1 converges to a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02902","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":"1711.02902","created_at":"2026-05-18T00:31:01.402144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02902v1","created_at":"2026-05-18T00:31:01.402144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02902","created_at":"2026-05-18T00:31:01.402144+00:00"},{"alias_kind":"pith_short_12","alias_value":"57TDOR6P7RIG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"57TDOR6P7RIGOJZU","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"57TDOR6P","created_at":"2026-05-18T12:31:00.734936+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/57TDOR6P7RIGOJZUCG5A4G4A6S","json":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S.json","graph_json":"https://pith.science/api/pith-number/57TDOR6P7RIGOJZUCG5A4G4A6S/graph.json","events_json":"https://pith.science/api/pith-number/57TDOR6P7RIGOJZUCG5A4G4A6S/events.json","paper":"https://pith.science/paper/57TDOR6P"},"agent_actions":{"view_html":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S","download_json":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S.json","view_paper":"https://pith.science/paper/57TDOR6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02902&json=true","fetch_graph":"https://pith.science/api/pith-number/57TDOR6P7RIGOJZUCG5A4G4A6S/graph.json","fetch_events":"https://pith.science/api/pith-number/57TDOR6P7RIGOJZUCG5A4G4A6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/action/storage_attestation","attest_author":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/action/author_attestation","sign_citation":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/action/citation_signature","submit_replication":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/action/replication_record"}},"created_at":"2026-05-18T00:31:01.402144+00:00","updated_at":"2026-05-18T00:31:01.402144+00:00"}