{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AHITUYKFDD3OZ4WIAGCPTXECFM","short_pith_number":"pith:AHITUYKF","schema_version":"1.0","canonical_sha256":"01d13a614518f6ecf2c80184f9dc822b096eced87759e97c03efcb980a620fbe","source":{"kind":"arxiv","id":"1802.03935","version":1},"attestation_state":"computed","paper":{"title":"Dynamic monopolies for interval graphs with bounded thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dieter Rautenbach, Lucia D. Penso, Stefan Ehard, St\\'ephane Bessy","submitted_at":"2018-02-12T08:46:45Z","abstract_excerpt":"For a graph $G$ and an integer-valued threshold function $\\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\\tau(u)$ neighbors in it eventually yields the vertex set of $G$. We show that the problem of finding a dynamic monopoly of minimum order can be solved in polynomial time for interval graphs with bounded threshold functions, but is NP-hard for chordal graphs allowing unbounded threshold functions."},"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":"1802.03935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-12T08:46:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"db93fc6f0f3092fac4e57c3833da43d4b397f12c0e87ec2e39c0316c8de182f6","abstract_canon_sha256":"4276f126734dd8430ecc6cd285b849ca9b391285e3618f5b1c364ed6360e579e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:49.964022Z","signature_b64":"EKjrokElsrAF5QmF+VNPizGpFqo45qUA0uWmH1Nu8Hu88591shZn+r4531aEhEc1pnqpj4Evso36LOzlb2ouDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d13a614518f6ecf2c80184f9dc822b096eced87759e97c03efcb980a620fbe","last_reissued_at":"2026-05-18T00:23:49.963416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:49.963416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic monopolies for interval graphs with bounded thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dieter Rautenbach, Lucia D. Penso, Stefan Ehard, St\\'ephane Bessy","submitted_at":"2018-02-12T08:46:45Z","abstract_excerpt":"For a graph $G$ and an integer-valued threshold function $\\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\\tau(u)$ neighbors in it eventually yields the vertex set of $G$. We show that the problem of finding a dynamic monopoly of minimum order can be solved in polynomial time for interval graphs with bounded threshold functions, but is NP-hard for chordal graphs allowing unbounded threshold functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03935","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.03935","created_at":"2026-05-18T00:23:49.963510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03935v1","created_at":"2026-05-18T00:23:49.963510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03935","created_at":"2026-05-18T00:23:49.963510+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHITUYKFDD3O","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHITUYKFDD3OZ4WI","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHITUYKF","created_at":"2026-05-18T12:32:13.499390+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/AHITUYKFDD3OZ4WIAGCPTXECFM","json":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM.json","graph_json":"https://pith.science/api/pith-number/AHITUYKFDD3OZ4WIAGCPTXECFM/graph.json","events_json":"https://pith.science/api/pith-number/AHITUYKFDD3OZ4WIAGCPTXECFM/events.json","paper":"https://pith.science/paper/AHITUYKF"},"agent_actions":{"view_html":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM","download_json":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM.json","view_paper":"https://pith.science/paper/AHITUYKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03935&json=true","fetch_graph":"https://pith.science/api/pith-number/AHITUYKFDD3OZ4WIAGCPTXECFM/graph.json","fetch_events":"https://pith.science/api/pith-number/AHITUYKFDD3OZ4WIAGCPTXECFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/action/storage_attestation","attest_author":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/action/author_attestation","sign_citation":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/action/citation_signature","submit_replication":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/action/replication_record"}},"created_at":"2026-05-18T00:23:49.963510+00:00","updated_at":"2026-05-18T00:23:49.963510+00:00"}