{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AHITUYKFDD3OZ4WIAGCPTXECFM","short_pith_number":"pith:AHITUYKF","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"},"canonical_sha256":"01d13a614518f6ecf2c80184f9dc822b096eced87759e97c03efcb980a620fbe","source":{"kind":"arxiv","id":"1802.03935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03935","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03935v1","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03935","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"AHITUYKFDD3O","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AHITUYKFDD3OZ4WI","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AHITUYKF","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AHITUYKFDD3OZ4WIAGCPTXECFM","target":"record","payload":{"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"},"canonical_sha256":"01d13a614518f6ecf2c80184f9dc822b096eced87759e97c03efcb980a620fbe","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"},"source_kind":"arxiv","source_id":"1802.03935","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-18T00:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOX3JIQGdb4NVIeqZHH8dbcJhp/xksv436NbXZrY05mG9NLt0Y9nDaCPPaTocW5t/94FUuZ7WhtuG1R5ShtXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:33:24.304764Z"},"content_sha256":"45b6c76d154327209cd1c2c9286649783581872296b0ccdd5464763ac8756e1e","schema_version":"1.0","event_id":"sha256:45b6c76d154327209cd1c2c9286649783581872296b0ccdd5464763ac8756e1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AHITUYKFDD3OZ4WIAGCPTXECFM","target":"graph","payload":{"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"},"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-18T00:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7L8PVA7KgOJSyeP7eg+R7zyn0VSxFbUq+hrCKBBMsuSiL0h+kZY5WRP5Ma9gBUM2ugxP9ZSs3yJHNCqYkqDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:33:24.305129Z"},"content_sha256":"7df0aae9939973a7b8e2acd5d82575d76f80aadeaeaf43c3bba04a52a0748e0b","schema_version":"1.0","event_id":"sha256:7df0aae9939973a7b8e2acd5d82575d76f80aadeaeaf43c3bba04a52a0748e0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/bundle.json","state_url":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/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-09T15:33:24Z","links":{"resolver":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM","bundle":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/bundle.json","state":"https://pith.science/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHITUYKFDD3OZ4WIAGCPTXECFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AHITUYKFDD3OZ4WIAGCPTXECFM","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":"4276f126734dd8430ecc6cd285b849ca9b391285e3618f5b1c364ed6360e579e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-12T08:46:45Z","title_canon_sha256":"db93fc6f0f3092fac4e57c3833da43d4b397f12c0e87ec2e39c0316c8de182f6"},"schema_version":"1.0","source":{"id":"1802.03935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03935","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03935v1","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03935","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"AHITUYKFDD3O","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AHITUYKFDD3OZ4WI","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AHITUYKF","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:7df0aae9939973a7b8e2acd5d82575d76f80aadeaeaf43c3bba04a52a0748e0b","target":"graph","created_at":"2026-05-18T00:23:49Z","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":"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.","authors_text":"Dieter Rautenbach, Lucia D. Penso, Stefan Ehard, St\\'ephane Bessy","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-12T08:46:45Z","title":"Dynamic monopolies for interval graphs with bounded thresholds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03935","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:45b6c76d154327209cd1c2c9286649783581872296b0ccdd5464763ac8756e1e","target":"record","created_at":"2026-05-18T00:23:49Z","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":"4276f126734dd8430ecc6cd285b849ca9b391285e3618f5b1c364ed6360e579e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-12T08:46:45Z","title_canon_sha256":"db93fc6f0f3092fac4e57c3833da43d4b397f12c0e87ec2e39c0316c8de182f6"},"schema_version":"1.0","source":{"id":"1802.03935","kind":"arxiv","version":1}},"canonical_sha256":"01d13a614518f6ecf2c80184f9dc822b096eced87759e97c03efcb980a620fbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01d13a614518f6ecf2c80184f9dc822b096eced87759e97c03efcb980a620fbe","first_computed_at":"2026-05-18T00:23:49.963416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:49.963416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EKjrokElsrAF5QmF+VNPizGpFqo45qUA0uWmH1Nu8Hu88591shZn+r4531aEhEc1pnqpj4Evso36LOzlb2ouDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:49.964022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45b6c76d154327209cd1c2c9286649783581872296b0ccdd5464763ac8756e1e","sha256:7df0aae9939973a7b8e2acd5d82575d76f80aadeaeaf43c3bba04a52a0748e0b"],"state_sha256":"ab3cfbfc557688b670b6e4d64fc726d993429481d4e496b55809e2603d2fc4d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0pRxPZWnhXi0/3wQOEtUxIGco6/Tc17seXH+fjb3PUjO0OFjHo7wkxP9jIDVIjG5cpd1bRaf61Je3Dut5GcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:33:24.307114Z","bundle_sha256":"d661ed614ab6a83f48c0df6342b2c34cfe1074bbdccaed537a1616479ce398d5"}}