{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZIV57AGBD7FBEQNE44HZ2E5KBN","short_pith_number":"pith:ZIV57AGB","canonical_record":{"source":{"id":"1602.01751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-04T17:10:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5ea0e0b3dd2261886c7276599205324f12ca5b4ad24c40bc646df6124910c524","abstract_canon_sha256":"86ec8edf9d0e81bfd467f58492b5dd3b213e097306a51b6eb680a94dd74aa180"},"schema_version":"1.0"},"canonical_sha256":"ca2bdf80c11fca1241a4e70f9d13aa0b5d63e53dae40cc2406b4f147c8467dec","source":{"kind":"arxiv","id":"1602.01751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01751","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01751v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01751","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZIV57AGBD7FB","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZIV57AGBD7FBEQNE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZIV57AGB","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZIV57AGBD7FBEQNE44HZ2E5KBN","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-04T17:10:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5ea0e0b3dd2261886c7276599205324f12ca5b4ad24c40bc646df6124910c524","abstract_canon_sha256":"86ec8edf9d0e81bfd467f58492b5dd3b213e097306a51b6eb680a94dd74aa180"},"schema_version":"1.0"},"canonical_sha256":"ca2bdf80c11fca1241a4e70f9d13aa0b5d63e53dae40cc2406b4f147c8467dec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.196420Z","signature_b64":"MbTrDgNf1rs5CmEDhaOaWBJONLsdgchFgRe9Gy9oMS1MiE8w10LjuRNlQh2zn++QgqRJtMB7r82d5Fzp617eBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca2bdf80c11fca1241a4e70f9d13aa0b5d63e53dae40cc2406b4f147c8467dec","last_reissued_at":"2026-05-18T01:21:18.195934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.195934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01751","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upar0Xhjbru7vbASli5fVqUyb3RL9Qgw+5ur4B62Pcl4Vydy9b93Vjjy/eQ024ADoJEfDW6vhZIU/SIKVXhDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:49:05.035037Z"},"content_sha256":"e4fa5cb0e80061cbee62c0627d3ed82084bb142670d56020d6b2a625332f22e0","schema_version":"1.0","event_id":"sha256:e4fa5cb0e80061cbee62c0627d3ed82084bb142670d56020d6b2a625332f22e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZIV57AGBD7FBEQNE44HZ2E5KBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contagious Sets in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Daniel Reichman, Michael Krivelevich, Uriel Feige","submitted_at":"2016-02-04T17:10:06Z","abstract_excerpt":"We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors. A \\emph{contagious set} is a set whose activation results with the entire graph being active. Given a graph $G$, let $m(G,r)$ be the minimal size of a contagious set.\n  We study this process on the binomial random graph $G:=G(n,p)$ with $p: = \\frac{d}{n}$ and $1 \\ll d \\ll \\left(\\frac{n \\log \\log n}{\\log^2 n}\\right)^{\\frac{r-1}{r}}$. Assuming $r > 1$ to be a constant that does not depend on $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01751","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WmSmopKK2ZKII6XkSZDvF3H1Gt7LfWLsCgDeFj9yeNgroCWbQIh1YE4Wp0lzMH3WMOoJZ41iM/Cinrb9FA8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:49:05.035562Z"},"content_sha256":"9ba441fda3bbde406bf89de2ea2634b272682297f13026ce3e7ab4e17398d625","schema_version":"1.0","event_id":"sha256:9ba441fda3bbde406bf89de2ea2634b272682297f13026ce3e7ab4e17398d625"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIV57AGBD7FBEQNE44HZ2E5KBN/bundle.json","state_url":"https://pith.science/pith/ZIV57AGBD7FBEQNE44HZ2E5KBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIV57AGBD7FBEQNE44HZ2E5KBN/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-05-26T01:49:05Z","links":{"resolver":"https://pith.science/pith/ZIV57AGBD7FBEQNE44HZ2E5KBN","bundle":"https://pith.science/pith/ZIV57AGBD7FBEQNE44HZ2E5KBN/bundle.json","state":"https://pith.science/pith/ZIV57AGBD7FBEQNE44HZ2E5KBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIV57AGBD7FBEQNE44HZ2E5KBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZIV57AGBD7FBEQNE44HZ2E5KBN","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":"86ec8edf9d0e81bfd467f58492b5dd3b213e097306a51b6eb680a94dd74aa180","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-04T17:10:06Z","title_canon_sha256":"5ea0e0b3dd2261886c7276599205324f12ca5b4ad24c40bc646df6124910c524"},"schema_version":"1.0","source":{"id":"1602.01751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01751","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01751v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01751","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZIV57AGBD7FB","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZIV57AGBD7FBEQNE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZIV57AGB","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:9ba441fda3bbde406bf89de2ea2634b272682297f13026ce3e7ab4e17398d625","target":"graph","created_at":"2026-05-18T01:21:18Z","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 consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors. A \\emph{contagious set} is a set whose activation results with the entire graph being active. Given a graph $G$, let $m(G,r)$ be the minimal size of a contagious set.\n  We study this process on the binomial random graph $G:=G(n,p)$ with $p: = \\frac{d}{n}$ and $1 \\ll d \\ll \\left(\\frac{n \\log \\log n}{\\log^2 n}\\right)^{\\frac{r-1}{r}}$. Assuming $r > 1$ to be a constant that does not depend on $","authors_text":"Daniel Reichman, Michael Krivelevich, Uriel Feige","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-04T17:10:06Z","title":"Contagious Sets in Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01751","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:e4fa5cb0e80061cbee62c0627d3ed82084bb142670d56020d6b2a625332f22e0","target":"record","created_at":"2026-05-18T01:21:18Z","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":"86ec8edf9d0e81bfd467f58492b5dd3b213e097306a51b6eb680a94dd74aa180","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-04T17:10:06Z","title_canon_sha256":"5ea0e0b3dd2261886c7276599205324f12ca5b4ad24c40bc646df6124910c524"},"schema_version":"1.0","source":{"id":"1602.01751","kind":"arxiv","version":1}},"canonical_sha256":"ca2bdf80c11fca1241a4e70f9d13aa0b5d63e53dae40cc2406b4f147c8467dec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca2bdf80c11fca1241a4e70f9d13aa0b5d63e53dae40cc2406b4f147c8467dec","first_computed_at":"2026-05-18T01:21:18.195934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.195934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MbTrDgNf1rs5CmEDhaOaWBJONLsdgchFgRe9Gy9oMS1MiE8w10LjuRNlQh2zn++QgqRJtMB7r82d5Fzp617eBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.196420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4fa5cb0e80061cbee62c0627d3ed82084bb142670d56020d6b2a625332f22e0","sha256:9ba441fda3bbde406bf89de2ea2634b272682297f13026ce3e7ab4e17398d625"],"state_sha256":"991791131c9bad5dcc760b4a9ca32d13d61c84aed3f13fe1fbb9285d9df543c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GJN/2pQAqurJNyEgwfUVYpHwBfVXo8yQGiZ9yGJw8TguUpO34TS5vg0dFxbGpYqQ9Vdyyg9NPtsd6oLmcRZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:49:05.038901Z","bundle_sha256":"6f1f7d3ea0969dc812c3beeb23600ac63608213b4d6b9de9752ee6128a91fcf1"}}