{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:57TDOR6P7RIGOJZUCG5A4G4A6S","short_pith_number":"pith:57TDOR6P","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"},"canonical_sha256":"efe63747cffc5067273411ba0e1b80f4a771b6ecdee73f1ce2e4c68a23be433e","source":{"kind":"arxiv","id":"1711.02902","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02902","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02902v1","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02902","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"57TDOR6P7RIG","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"57TDOR6P7RIGOJZU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"57TDOR6P","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:57TDOR6P7RIGOJZUCG5A4G4A6S","target":"record","payload":{"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"},"canonical_sha256":"efe63747cffc5067273411ba0e1b80f4a771b6ecdee73f1ce2e4c68a23be433e","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"},"source_kind":"arxiv","source_id":"1711.02902","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-18T00:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNrKi0UePcsP+WHxGKHREKSrkQP1ghKMhxdJ/6y9tGoC+rCWwBvqWyzomtgu2D1Tb45c2jQSZ4kjIY2H0U5tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:48:24.329835Z"},"content_sha256":"ee901c907dcc41dc5ee8d58e692f00485216a8117404463538aef375aac2e8fe","schema_version":"1.0","event_id":"sha256:ee901c907dcc41dc5ee8d58e692f00485216a8117404463538aef375aac2e8fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:57TDOR6P7RIGOJZUCG5A4G4A6S","target":"graph","payload":{"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"},"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-18T00:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcmlIqJxIGDz3pZl+HQZ32LRihIUFsOPLt7HmKS/aV0b8nN/gbREQd2EkoE1U/BaCZSZw46A6CedVj3sF023Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:48:24.330628Z"},"content_sha256":"f92a3e167d06d09abfaca70d4025bc099589b92b521e2102040464512e6e1019","schema_version":"1.0","event_id":"sha256:f92a3e167d06d09abfaca70d4025bc099589b92b521e2102040464512e6e1019"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/bundle.json","state_url":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/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-12T00:48:24Z","links":{"resolver":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S","bundle":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/bundle.json","state":"https://pith.science/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57TDOR6P7RIGOJZUCG5A4G4A6S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:57TDOR6P7RIGOJZUCG5A4G4A6S","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":"34f71fd1e1b50b07b95467b4c2a4218b7ff951b85f5917bed0dd81cde9347c99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-08T10:56:05Z","title_canon_sha256":"f76a5c4ab214e516c0054b0b6e408fcc52f0fefd0cf9f8b9e68a28ea3671bce1"},"schema_version":"1.0","source":{"id":"1711.02902","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02902","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02902v1","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02902","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"57TDOR6P7RIG","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"57TDOR6P7RIGOJZU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"57TDOR6P","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:f92a3e167d06d09abfaca70d4025bc099589b92b521e2102040464512e6e1019","target":"graph","created_at":"2026-05-18T00:31:01Z","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 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","authors_text":"Daniel Ahlberg, Maria Deijfen, Svante Janson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-08T10:56:05Z","title":"Competing first passage percolation on random graphs with finite variance degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02902","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:ee901c907dcc41dc5ee8d58e692f00485216a8117404463538aef375aac2e8fe","target":"record","created_at":"2026-05-18T00:31:01Z","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":"34f71fd1e1b50b07b95467b4c2a4218b7ff951b85f5917bed0dd81cde9347c99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-08T10:56:05Z","title_canon_sha256":"f76a5c4ab214e516c0054b0b6e408fcc52f0fefd0cf9f8b9e68a28ea3671bce1"},"schema_version":"1.0","source":{"id":"1711.02902","kind":"arxiv","version":1}},"canonical_sha256":"efe63747cffc5067273411ba0e1b80f4a771b6ecdee73f1ce2e4c68a23be433e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efe63747cffc5067273411ba0e1b80f4a771b6ecdee73f1ce2e4c68a23be433e","first_computed_at":"2026-05-18T00:31:01.402040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:01.402040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G7QL7tf+n+vZmikMEVASrtDeYFJukSUNEk3lTSSvkBqiA7dv3ld6LhFa34LbrYF27zChBcSu6Z9YEOzR2ab+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:01.402611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02902","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee901c907dcc41dc5ee8d58e692f00485216a8117404463538aef375aac2e8fe","sha256:f92a3e167d06d09abfaca70d4025bc099589b92b521e2102040464512e6e1019"],"state_sha256":"d5edeb7a225ef9bfb42922be6aa00d577a13264d915c5743f69097cd53233172"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MspK3H/A8wtJkLe2XE77gOdyINFSM6OZvkLpFbjQqeGev64yLZmEl0fN+f+B+IbOFFx47hwZChbWGFS/twj6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:48:24.334601Z","bundle_sha256":"c189c229addea028dc5fb6cc994d01129471f7b925f7c51a16bea937bd1e0593"}}