{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:K42PB6WRN2CIHDZJY6ORQP5BNW","short_pith_number":"pith:K42PB6WR","schema_version":"1.0","canonical_sha256":"5734f0fad16e84838f29c79d183fa16da14ed183ca4292be8770942d69773075","source":{"kind":"arxiv","id":"1306.2465","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.2465","created_at":"2026-05-18T02:59:44.497702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2465v2","created_at":"2026-05-18T02:59:44.497702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2465","created_at":"2026-05-18T02:59:44.497702+00:00"},{"alias_kind":"pith_short_12","alias_value":"K42PB6WRN2CI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"K42PB6WRN2CIHDZJ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"K42PB6WR","created_at":"2026-05-18T12:27:49.015174+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/K42PB6WRN2CIHDZJY6ORQP5BNW","json":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW.json","graph_json":"https://pith.science/api/pith-number/K42PB6WRN2CIHDZJY6ORQP5BNW/graph.json","events_json":"https://pith.science/api/pith-number/K42PB6WRN2CIHDZJY6ORQP5BNW/events.json","paper":"https://pith.science/paper/K42PB6WR"},"agent_actions":{"view_html":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW","download_json":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW.json","view_paper":"https://pith.science/paper/K42PB6WR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2465&json=true","fetch_graph":"https://pith.science/api/pith-number/K42PB6WRN2CIHDZJY6ORQP5BNW/graph.json","fetch_events":"https://pith.science/api/pith-number/K42PB6WRN2CIHDZJY6ORQP5BNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/action/storage_attestation","attest_author":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/action/author_attestation","sign_citation":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/action/citation_signature","submit_replication":"https://pith.science/pith/K42PB6WRN2CIHDZJY6ORQP5BNW/action/replication_record"}},"created_at":"2026-05-18T02:59:44.497702+00:00","updated_at":"2026-05-18T02:59:44.497702+00:00"}