{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K42PB6WRN2CIHDZJY6ORQP5BNW","short_pith_number":"pith:K42PB6WR","canonical_record":{"source":{"id":"1306.2465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T09:48:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fde005cf2e072ad4d75df4a0ef346b8416b2ca78097c1055afb6d92cf19e270f","abstract_canon_sha256":"c6c38c2d0943d4ec7bcf37ab945d2b9e540a65bd850fc3ab74a16a3be4f07053"},"schema_version":"1.0"},"canonical_sha256":"5734f0fad16e84838f29c79d183fa16da14ed183ca4292be8770942d69773075","source":{"kind":"arxiv","id":"1306.2465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2465","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2465v2","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2465","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"K42PB6WRN2CI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K42PB6WRN2CIHDZJ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K42PB6WR","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K42PB6WRN2CIHDZJY6ORQP5BNW","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T09:48:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fde005cf2e072ad4d75df4a0ef346b8416b2ca78097c1055afb6d92cf19e270f","abstract_canon_sha256":"c6c38c2d0943d4ec7bcf37ab945d2b9e540a65bd850fc3ab74a16a3be4f07053"},"schema_version":"1.0"},"canonical_sha256":"5734f0fad16e84838f29c79d183fa16da14ed183ca4292be8770942d69773075","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:44.498587Z","signature_b64":"Sez1VHJ2Zj1vuEKFLAMrqhj1PcfkM/J27n8SdjleSokS8/CIkXLsOFO5il+U1+7fo//21roDTNSMx84Oj9pBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5734f0fad16e84838f29c79d183fa16da14ed183ca4292be8770942d69773075","last_reissued_at":"2026-05-18T02:59:44.497544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:44.497544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2465","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-18T02:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l57qYBe/b1bv+VXMlX0/saopjVdH+ShiR/vzmRT7kQjzV7PeKX2ny8pOorI6JdLmZ///JvlnR9mHnvYWhL8qAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:46:53.244282Z"},"content_sha256":"5263abf90a3bd74442fda78b526074c4d2bf58f1b02414eae6be7d2872486846","schema_version":"1.0","event_id":"sha256:5263abf90a3bd74442fda78b526074c4d2bf58f1b02414eae6be7d2872486846"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K42PB6WRN2CIHDZJY6ORQP5BNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contagious Sets in Expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Amin Coja-Oghlan, Daniel Reichman, Michael Krivelevich, Uriel Feige","submitted_at":"2013-06-11T09:48:52Z","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, where $r>1$ is the activation threshold.\n  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. Computing $m(G,r)$ is NP-hard.\n  It is known that for every $d$-regular or nearly $d$-regular graph on $n$ vertices, $m(G,r) \\le O(\\frac{nr}{d})$. We consider such graphs that addition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2465","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-18T02:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLvDKbDJDNqW4nfWHALpQOBrFzAO4ym8Jjv5SAIRWAyuwo0Mt9xg+vcGaDlHTMo6SkCofsm0l+DAw98umXcyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:46:53.244744Z"},"content_sha256":"881f68c6e09db810203d21a0c78fe6f41ee5372259daf989679515f3cd1ab9e4","schema_version":"1.0","event_id":"sha256:881f68c6e09db810203d21a0c78fe6f41ee5372259daf989679515f3cd1ab9e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/bundle.json","state_url":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/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-25T13:46:53Z","links":{"resolver":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW","bundle":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/bundle.json","state":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K42PB6WRN2CIHDZJY6ORQP5BNW","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":"c6c38c2d0943d4ec7bcf37ab945d2b9e540a65bd850fc3ab74a16a3be4f07053","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T09:48:52Z","title_canon_sha256":"fde005cf2e072ad4d75df4a0ef346b8416b2ca78097c1055afb6d92cf19e270f"},"schema_version":"1.0","source":{"id":"1306.2465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2465","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2465v2","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2465","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"K42PB6WRN2CI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K42PB6WRN2CIHDZJ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K42PB6WR","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:881f68c6e09db810203d21a0c78fe6f41ee5372259daf989679515f3cd1ab9e4","target":"graph","created_at":"2026-05-18T02:59:44Z","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, where $r>1$ is the activation threshold.\n  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. Computing $m(G,r)$ is NP-hard.\n  It is known that for every $d$-regular or nearly $d$-regular graph on $n$ vertices, $m(G,r) \\le O(\\frac{nr}{d})$. We consider such graphs that addition","authors_text":"Amin Coja-Oghlan, Daniel Reichman, Michael Krivelevich, Uriel Feige","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T09:48:52Z","title":"Contagious Sets in Expanders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2465","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:5263abf90a3bd74442fda78b526074c4d2bf58f1b02414eae6be7d2872486846","target":"record","created_at":"2026-05-18T02:59:44Z","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":"c6c38c2d0943d4ec7bcf37ab945d2b9e540a65bd850fc3ab74a16a3be4f07053","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T09:48:52Z","title_canon_sha256":"fde005cf2e072ad4d75df4a0ef346b8416b2ca78097c1055afb6d92cf19e270f"},"schema_version":"1.0","source":{"id":"1306.2465","kind":"arxiv","version":2}},"canonical_sha256":"5734f0fad16e84838f29c79d183fa16da14ed183ca4292be8770942d69773075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5734f0fad16e84838f29c79d183fa16da14ed183ca4292be8770942d69773075","first_computed_at":"2026-05-18T02:59:44.497544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:44.497544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sez1VHJ2Zj1vuEKFLAMrqhj1PcfkM/J27n8SdjleSokS8/CIkXLsOFO5il+U1+7fo//21roDTNSMx84Oj9pBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:44.498587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5263abf90a3bd74442fda78b526074c4d2bf58f1b02414eae6be7d2872486846","sha256:881f68c6e09db810203d21a0c78fe6f41ee5372259daf989679515f3cd1ab9e4"],"state_sha256":"352561a60d96844c87b25000d59412ec3b12472042ba950dd95e650048a9f4b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oX9XKHDXVoxTwNd0IY3ud87WUFqFZE7gl4LTm6I9haHmmBGpxwc0vsbltFwXp0qEKk8uKGpxU2zsBsDXqPOMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:46:53.248359Z","bundle_sha256":"40dad49f4b89ba8df89611035c57aa089f89fed5049806034eff1f294bcc859d"}}