{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5ON4TGGU5J5PA23OOC3UJ45S55","short_pith_number":"pith:5ON4TGGU","canonical_record":{"source":{"id":"1710.00635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-02T13:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"4a09ceff4e568405c0c95db5f6d5cd56bf93710a8e0b481e951930c3b34bd29d","abstract_canon_sha256":"8c9d90c4d958fae0c135602c0bd5b49fbae565bb057efee53db8fd686bfbb1f1"},"schema_version":"1.0"},"canonical_sha256":"eb9bc998d4ea7af06b6e70b744f3b2ef6b93e2b64941bd742e04a5412a779d76","source":{"kind":"arxiv","id":"1710.00635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00635","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00635v1","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00635","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"5ON4TGGU5J5P","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5ON4TGGU5J5PA23O","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5ON4TGGU","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5ON4TGGU5J5PA23OOC3UJ45S55","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-02T13:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"4a09ceff4e568405c0c95db5f6d5cd56bf93710a8e0b481e951930c3b34bd29d","abstract_canon_sha256":"8c9d90c4d958fae0c135602c0bd5b49fbae565bb057efee53db8fd686bfbb1f1"},"schema_version":"1.0"},"canonical_sha256":"eb9bc998d4ea7af06b6e70b744f3b2ef6b93e2b64941bd742e04a5412a779d76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:54.186568Z","signature_b64":"TwvxHlVWSY3qHbgpalqupRfYNWflq6f/Nc7/WM9xuME/qW9SPblzC/GPO+Ufqlfh3ur/boWQ0ZIiuOMF7IFmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb9bc998d4ea7af06b6e70b744f3b2ef6b93e2b64941bd742e04a5412a779d76","last_reissued_at":"2026-05-18T00:33:54.185906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:54.185906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00635","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:33:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9ETRw1JFlfPxvSinqm0g78fOZqxnQ3RtL7CAhew8uNEq/RX3NHx4alWhFslMYwFvTDTafOJffLKsf2M0Y0oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:24:08.531694Z"},"content_sha256":"f4cb09a2c0c313074b093e40ff6fd1c0485fe1c9c8877fb2831452e82428b34b","schema_version":"1.0","event_id":"sha256:f4cb09a2c0c313074b093e40ff6fd1c0485fe1c9c8877fb2831452e82428b34b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5ON4TGGU5J5PA23OOC3UJ45S55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Target Set Selection Parameterized by Clique-Width and Maximum Threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Tim A. Hartmann","submitted_at":"2017-10-02T13:45:04Z","abstract_excerpt":"The Target Set Selection problem takes as an input a graph $G$ and a non-negative integer threshold $ \\mbox{thr}(v) $ for every vertex $v$. A vertex $v$ can get active as soon as at least $ \\mbox{thr}(v) $ of its neighbors have been activated. The objective is to select a smallest possible initial set of vertices, the target set, whose activation eventually leads to the activation of all vertices in the graph.\n  We show that Target Set Selection is in FPT when parameterized with the combined parameters clique-width of the graph and the maximum threshold value. This generalizes all previous FPT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00635","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:33:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WRHM7SDJVhUvZ1JD+58yriYQd6HxdkQLrMena80e2mJhjvViceKH0h1PlgTWXDleXWppWyhfE9uSaOE2zJEbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:24:08.532051Z"},"content_sha256":"650f26255d1c4ce12d07737b151bd9ca5c3d71735e1d61d3ae7577055c41b4ba","schema_version":"1.0","event_id":"sha256:650f26255d1c4ce12d07737b151bd9ca5c3d71735e1d61d3ae7577055c41b4ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ON4TGGU5J5PA23OOC3UJ45S55/bundle.json","state_url":"https://pith.science/pith/5ON4TGGU5J5PA23OOC3UJ45S55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ON4TGGU5J5PA23OOC3UJ45S55/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-02T12:24:08Z","links":{"resolver":"https://pith.science/pith/5ON4TGGU5J5PA23OOC3UJ45S55","bundle":"https://pith.science/pith/5ON4TGGU5J5PA23OOC3UJ45S55/bundle.json","state":"https://pith.science/pith/5ON4TGGU5J5PA23OOC3UJ45S55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ON4TGGU5J5PA23OOC3UJ45S55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5ON4TGGU5J5PA23OOC3UJ45S55","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":"8c9d90c4d958fae0c135602c0bd5b49fbae565bb057efee53db8fd686bfbb1f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-02T13:45:04Z","title_canon_sha256":"4a09ceff4e568405c0c95db5f6d5cd56bf93710a8e0b481e951930c3b34bd29d"},"schema_version":"1.0","source":{"id":"1710.00635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00635","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00635v1","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00635","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"5ON4TGGU5J5P","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5ON4TGGU5J5PA23O","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5ON4TGGU","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:650f26255d1c4ce12d07737b151bd9ca5c3d71735e1d61d3ae7577055c41b4ba","target":"graph","created_at":"2026-05-18T00:33:54Z","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":"The Target Set Selection problem takes as an input a graph $G$ and a non-negative integer threshold $ \\mbox{thr}(v) $ for every vertex $v$. A vertex $v$ can get active as soon as at least $ \\mbox{thr}(v) $ of its neighbors have been activated. The objective is to select a smallest possible initial set of vertices, the target set, whose activation eventually leads to the activation of all vertices in the graph.\n  We show that Target Set Selection is in FPT when parameterized with the combined parameters clique-width of the graph and the maximum threshold value. This generalizes all previous FPT","authors_text":"Tim A. Hartmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-02T13:45:04Z","title":"Target Set Selection Parameterized by Clique-Width and Maximum Threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00635","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:f4cb09a2c0c313074b093e40ff6fd1c0485fe1c9c8877fb2831452e82428b34b","target":"record","created_at":"2026-05-18T00:33:54Z","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":"8c9d90c4d958fae0c135602c0bd5b49fbae565bb057efee53db8fd686bfbb1f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-02T13:45:04Z","title_canon_sha256":"4a09ceff4e568405c0c95db5f6d5cd56bf93710a8e0b481e951930c3b34bd29d"},"schema_version":"1.0","source":{"id":"1710.00635","kind":"arxiv","version":1}},"canonical_sha256":"eb9bc998d4ea7af06b6e70b744f3b2ef6b93e2b64941bd742e04a5412a779d76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb9bc998d4ea7af06b6e70b744f3b2ef6b93e2b64941bd742e04a5412a779d76","first_computed_at":"2026-05-18T00:33:54.185906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:54.185906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TwvxHlVWSY3qHbgpalqupRfYNWflq6f/Nc7/WM9xuME/qW9SPblzC/GPO+Ufqlfh3ur/boWQ0ZIiuOMF7IFmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:54.186568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4cb09a2c0c313074b093e40ff6fd1c0485fe1c9c8877fb2831452e82428b34b","sha256:650f26255d1c4ce12d07737b151bd9ca5c3d71735e1d61d3ae7577055c41b4ba"],"state_sha256":"1cfb58379726ae080b2c80938442dbafb6be582a09aa440900ffe066ad110ba3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PWWI3HD0NpH2HHcK82alH7cNCdhnHf9grdaMMLoVIVJbRMWUxJPxonDC8qAOqhprcDXoEPtxRUFmRvA7YhQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:24:08.534046Z","bundle_sha256":"f26ed8e56f126ee7e03ac9f8ef3b844199b45a2d36997f817200221343b12a45"}}