{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NODZPSWMVACAKGLMKHO5RKUFOV","short_pith_number":"pith:NODZPSWM","canonical_record":{"source":{"id":"1202.5429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-24T12:12:34Z","cross_cats_sorted":[],"title_canon_sha256":"d0539547e0ebc4df82a74cce06a615568c0b483bb24a0931e74f46d0b3c6fb3a","abstract_canon_sha256":"d272cd047ba103683315de4d69666f3fce804f05333906bbfc2277358320e55b"},"schema_version":"1.0"},"canonical_sha256":"6b8797cacca80405196c51ddd8aa85754ac8430108fb60842e6363521cf57b72","source":{"kind":"arxiv","id":"1202.5429","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5429","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5429v2","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5429","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"NODZPSWMVACA","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NODZPSWMVACAKGLM","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NODZPSWM","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NODZPSWMVACAKGLMKHO5RKUFOV","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-24T12:12:34Z","cross_cats_sorted":[],"title_canon_sha256":"d0539547e0ebc4df82a74cce06a615568c0b483bb24a0931e74f46d0b3c6fb3a","abstract_canon_sha256":"d272cd047ba103683315de4d69666f3fce804f05333906bbfc2277358320e55b"},"schema_version":"1.0"},"canonical_sha256":"6b8797cacca80405196c51ddd8aa85754ac8430108fb60842e6363521cf57b72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:25.973233Z","signature_b64":"sFcNNRtLyQOMSs4xh+lHwXw6DTLH2UvdHLt7BmDM3H272rtKWadZBLn49MjsYJau1UvC/vwDKpZQclLD/HErBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b8797cacca80405196c51ddd8aa85754ac8430108fb60842e6363521cf57b72","last_reissued_at":"2026-05-18T03:30:25.972410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:25.972410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5429","source_version":2,"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:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ei4cHuA7VTEFPiqSkop6TvYLaXY1m7T97g4msEUV0WoACcrX9RwMBJNIWlIxtOT9bFPj/btPtx/XsGvVeU61Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:28:52.852573Z"},"content_sha256":"71a79e6204eef8da72967e4eee5f6bde12d1a6a23d75c95c71bdbcaeb4f63fc9","schema_version":"1.0","event_id":"sha256:71a79e6204eef8da72967e4eee5f6bde12d1a6a23d75c95c71bdbcaeb4f63fc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NODZPSWMVACAKGLMKHO5RKUFOV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Expected Total Number of Infections for Virus Spread on a Finite Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antar Bandyopadhyay, Farkhondeh Sajadi","submitted_at":"2012-02-24T12:12:34Z","abstract_excerpt":"In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices. At each discrete time step, an infected vertex tries to infect its neighbors with probability $\\beta \\in (0,1)$ independently of others and then it dies out. The process continues till all infected vertices die out. We focus on obtaining proper lower bounds on the expected number of ever infected vertices. We obtain a simple lower bound, using \\textit{breadt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5429","kind":"arxiv","version":2},"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:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJJHur89UE+QwlXCYfiMUE3X1x7vKvf5LmOJMY8n+A3wfyvZVY9JaHgclbt8xIU3vImXxUtuN2yyAvc7Va+BDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:28:52.853259Z"},"content_sha256":"93d582264ef1eb1f5b353cf47db5645ad1548f215c606f7793606603c0526767","schema_version":"1.0","event_id":"sha256:93d582264ef1eb1f5b353cf47db5645ad1548f215c606f7793606603c0526767"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NODZPSWMVACAKGLMKHO5RKUFOV/bundle.json","state_url":"https://pith.science/pith/NODZPSWMVACAKGLMKHO5RKUFOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NODZPSWMVACAKGLMKHO5RKUFOV/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-08T20:28:52Z","links":{"resolver":"https://pith.science/pith/NODZPSWMVACAKGLMKHO5RKUFOV","bundle":"https://pith.science/pith/NODZPSWMVACAKGLMKHO5RKUFOV/bundle.json","state":"https://pith.science/pith/NODZPSWMVACAKGLMKHO5RKUFOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NODZPSWMVACAKGLMKHO5RKUFOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NODZPSWMVACAKGLMKHO5RKUFOV","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":"d272cd047ba103683315de4d69666f3fce804f05333906bbfc2277358320e55b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-24T12:12:34Z","title_canon_sha256":"d0539547e0ebc4df82a74cce06a615568c0b483bb24a0931e74f46d0b3c6fb3a"},"schema_version":"1.0","source":{"id":"1202.5429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5429","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5429v2","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5429","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"NODZPSWMVACA","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NODZPSWMVACAKGLM","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NODZPSWM","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:93d582264ef1eb1f5b353cf47db5645ad1548f215c606f7793606603c0526767","target":"graph","created_at":"2026-05-18T03:30:25Z","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":"In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices. At each discrete time step, an infected vertex tries to infect its neighbors with probability $\\beta \\in (0,1)$ independently of others and then it dies out. The process continues till all infected vertices die out. We focus on obtaining proper lower bounds on the expected number of ever infected vertices. We obtain a simple lower bound, using \\textit{breadt","authors_text":"Antar Bandyopadhyay, Farkhondeh Sajadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-24T12:12:34Z","title":"On the Expected Total Number of Infections for Virus Spread on a Finite Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5429","kind":"arxiv","version":2},"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:71a79e6204eef8da72967e4eee5f6bde12d1a6a23d75c95c71bdbcaeb4f63fc9","target":"record","created_at":"2026-05-18T03:30:25Z","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":"d272cd047ba103683315de4d69666f3fce804f05333906bbfc2277358320e55b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-24T12:12:34Z","title_canon_sha256":"d0539547e0ebc4df82a74cce06a615568c0b483bb24a0931e74f46d0b3c6fb3a"},"schema_version":"1.0","source":{"id":"1202.5429","kind":"arxiv","version":2}},"canonical_sha256":"6b8797cacca80405196c51ddd8aa85754ac8430108fb60842e6363521cf57b72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b8797cacca80405196c51ddd8aa85754ac8430108fb60842e6363521cf57b72","first_computed_at":"2026-05-18T03:30:25.972410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:25.972410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sFcNNRtLyQOMSs4xh+lHwXw6DTLH2UvdHLt7BmDM3H272rtKWadZBLn49MjsYJau1UvC/vwDKpZQclLD/HErBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:25.973233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71a79e6204eef8da72967e4eee5f6bde12d1a6a23d75c95c71bdbcaeb4f63fc9","sha256:93d582264ef1eb1f5b353cf47db5645ad1548f215c606f7793606603c0526767"],"state_sha256":"b31f0f13463ac364c4170c4544573aad9a283dc9d693d3244e94aa01b3fadbac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqxvFcUDuvvKVXoqQOf25GftqsZBHuENlgI+K9Gwd1NPCxGvmh/IjsFSLxy8oRejeJsZMUK2kSHl+mHkAU2TCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:28:52.856930Z","bundle_sha256":"1abb12e202c9d8de561e942b4f9e82420210163c5cfb3d5cf3a70a3b08e32ab9"}}