{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:REIP5GICMKLKKPWN5R27KWPPF5","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7470d8b417a850cc792f4d7861be8885b82df9b67ea1a2203b5113e273367f59","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-17T18:00:49Z","title_canon_sha256":"464d00c58ffc0ec4fd6c93cd7347118afe371060ab33965d513f5196557559d9"},"schema_version":"1.0","source":{"id":"2605.17572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17572","created_at":"2026-05-20T00:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17572v1","created_at":"2026-05-20T00:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17572","created_at":"2026-05-20T00:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"REIP5GICMKLK","created_at":"2026-05-20T00:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"REIP5GICMKLKKPWN","created_at":"2026-05-20T00:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"REIP5GIC","created_at":"2026-05-20T00:04:46Z"}],"graph_snapshots":[{"event_id":"sha256:17a9873f4a232ab08475414375ef5bac54c4c1a4767b895097c4f05558a33aec","target":"graph","created_at":"2026-05-20T00:04:46Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that these natural problems are NP-complete or ΣP2-complete, depending on the specific variant. These hardness results provide limitations for optimal controller placement algorithms under different notions of quality of a solution."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The game score is defined as the total number of surviving vertices reachable from any remaining controller under standard undirected-graph connectivity; if this reachability model does not capture the intended resilience notion, the hardness claims do not apply to the motivating application."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Proves NP- and ΣP2-completeness for variants of a graph game modeling defender controller placement against vertex attacks, with polynomial algorithms for interval graphs and bounded treewidth."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Deciding optimal controller placement to maximize reachable surviving vertices after deletions is NP-complete or ΣP2-complete."}],"snapshot_sha256":"ae2612d3ca67090fcb5c2727d5da36194a6291771fb92db82dbf9e94aa71dfac"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e4948e43fdac52ecae3b6fb999e0563638f062ae42c52b98357d5da138b9d9fd"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.567267Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T22:31:05.801691Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.594114Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.525390Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.17572/integrity.json","findings":[{"audited_at":"2026-05-19T22:31:05.801691Z","detected_arxiv_id":null,"detected_doi":"10.1016/0020-0190(92","detector":"doi_compliance","finding_type":"unresolvable_identifier","note":"Identifier '10.1016/0020-0190(92' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","ref_index":2,"severity":"critical","verdict_class":"cross_source"}],"snapshot_sha256":"2f8b3ed2e25c694e0c38ab75744d0429de0847f9e980ed12ad0aa689e39402f5","summary":{"advisory":0,"by_detector":{"doi_compliance":{"advisory":0,"critical":1,"informational":0,"total":1}},"critical":1,"informational":0}},"paper":{"abstract_excerpt":"Motivated by the controller placement problems in software-defined networks and the fair division principles of classical \"cake cutting\", we investigate the following two-player zero-sum game. In our model, a defender places a limited number of controllers on graph vertices, while an attacker deletes a limited number of vertices. The defender score is the total number of surviving vertices reachable from any remaining controller. We formalize the computational problems associated with various game dynamics (defender plays first; attacker plays first; players play simultaneously; pure or mixed ","authors_text":"Alexander Wolff, Antonio Lauerbach, Grzegorz Gutowski, Konstanty Junosza-Szaniawski","cross_cats":["cs.GT"],"headline":"Deciding optimal controller placement to maximize reachable surviving vertices after deletions is NP-complete or ΣP2-complete.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-17T18:00:49Z","title":"Modelling Network Resilience: The Complexity of Some Graph Division Games"},"references":{"count":12,"internal_anchors":0,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"10.1017/cbo9780511804090","is_internal_anchor":false,"ref_index":1,"title":"Cambridge University Press, 2009.doi:10.1017/CBO9780511804090","work_id":"79fc0d88-b674-4adf-b1bc-ebc370f38ceb","year":2009},{"cited_arxiv_id":"","doi":"10.1016/0020-0190(92","is_internal_anchor":false,"ref_index":2,"title":"The vertex separation number of a graph equals its path-width","work_id":"3ab21f76-86cc-4ecf-8a7b-8360562806dc","year":1992},{"cited_arxiv_id":"","doi":"10.1007/978-3-319-21275-3","is_internal_anchor":false,"ref_index":3,"title":"Fomin and Lukasz Kowalik and Daniel Lokshtanov and D","work_id":"cc8dcfd4-029e-42d3-9ba1-999221a6d688","year":2020},{"cited_arxiv_id":"","doi":"10.1109/access.2020.3047210","is_internal_anchor":false,"ref_index":4,"title":"31 Ayumi Igarashi and Dominik Peters","work_id":"ef73a8d9-3dba-41c7-9886-fbcb5c7e26fe","year":2020},{"cited_arxiv_id":"","doi":"10.1109/rndm59149.2023.10293051","is_internal_anchor":false,"ref_index":5,"title":"39 Michał Pióro, Mariusz Mycek, Artur Tomaszewski, Konstanty Junosza-Szaniawski, and Dariusz Nogalski","work_id":"72175752-6fba-4479-929f-82906f86914c","year":2003}],"snapshot_sha256":"7c5fb1a587857fa621813ce95d5d9da450bf62ace461f8e5548af12f9a3f5fcd"},"source":{"id":"2605.17572","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:22:01.301852Z","id":"bfd1f374-aca3-4f30-9ee1-cd5f9edee401","model_set":{"reader":"grok-4.3"},"one_line_summary":"Proves NP- and ΣP2-completeness for variants of a graph game modeling defender controller placement against vertex attacks, with polynomial algorithms for interval graphs and bounded treewidth.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Deciding optimal controller placement to maximize reachable surviving vertices after deletions is NP-complete or ΣP2-complete.","strongest_claim":"We show that these natural problems are NP-complete or ΣP2-complete, depending on the specific variant. These hardness results provide limitations for optimal controller placement algorithms under different notions of quality of a solution.","weakest_assumption":"The game score is defined as the total number of surviving vertices reachable from any remaining controller under standard undirected-graph connectivity; if this reachability model does not capture the intended resilience notion, the hardness claims do not apply to the motivating application."}},"verdict_id":"bfd1f374-aca3-4f30-9ee1-cd5f9edee401"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a209be72d4476e00238ea42d4685f9a02949995f8a2eb05c15755f32d214a59","target":"record","created_at":"2026-05-20T00:04:46Z","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":"7470d8b417a850cc792f4d7861be8885b82df9b67ea1a2203b5113e273367f59","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-17T18:00:49Z","title_canon_sha256":"464d00c58ffc0ec4fd6c93cd7347118afe371060ab33965d513f5196557559d9"},"schema_version":"1.0","source":{"id":"2605.17572","kind":"arxiv","version":1}},"canonical_sha256":"8910fe99026296a53ecdec75f559ef2f598285a35cf2520e73c4456c0526ffe9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8910fe99026296a53ecdec75f559ef2f598285a35cf2520e73c4456c0526ffe9","first_computed_at":"2026-05-20T00:04:46.582474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:46.582474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oS8pcEIeqe5N5FiKWFnAKRVPYOsUWdfYy9gIbr3HKXQxGfDEQUIpdvJ0khzLQeJGsgrrwpBpTV0mfKqzaIOzBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:46.583568Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1439ea81cfe29693847ba24704da6399a9eac5a2a9ce52c9e524e08b4d394e6a","sha256:3a209be72d4476e00238ea42d4685f9a02949995f8a2eb05c15755f32d214a59","sha256:17a9873f4a232ab08475414375ef5bac54c4c1a4767b895097c4f05558a33aec"],"state_sha256":"eb73fc4062d6ec6adf6760ebbfb25beb6d21b178e19fd96a6ace0c80d33793f2"}