{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:H5ASHID7EHNFVAIK2A45537CEF","short_pith_number":"pith:H5ASHID7","schema_version":"1.0","canonical_sha256":"3f4123a07f21da5a810ad039deefe2215f78300055b8ee0cc7c4ab0167a42c1f","source":{"kind":"arxiv","id":"2007.02370","version":2},"attestation_state":"computed","paper":{"title":"Complexity of the Multilevel Critical Node Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.GT"],"primary_cat":"cs.CC","authors_text":"Adel Nabli, Margarida Carvalho, Pierre Hosteins","submitted_at":"2020-07-05T15:54:53Z","abstract_excerpt":"In this work, we analyze a sequential game played in a graph called the Multilevel Critical Node problem (MCN). A defender and an attacker are the players of this game. The defender starts by preventively interdicting vertices (vaccination) from being attacked. Then, the attacker infects a subset of non-vaccinated vertices and, finally, the defender reacts with a protection strategy. We provide the first computational complexity results associated with MCN and its subgames. Moreover, by considering unitary, weighted, undirected, and directed graphs, we clarify how the theoretical tractability "},"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":"2007.02370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-07-05T15:54:53Z","cross_cats_sorted":["cs.DM","cs.GT"],"title_canon_sha256":"836cb7b3902b7a56bad3f625d0289e473fd61fd4a47a0c0f36cefe4a642f4053","abstract_canon_sha256":"2f87bf1fa837bf8bd18da2df91bbfd6b7af1aab6dba9e5aeeaa627f6f2313aa9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:44.311287Z","signature_b64":"ijygobfWZCIfaqKyoyRYGD/UauVhjysTg4vBrguX2GflbttwgNpA68gDCTbvN4V+rEpqwgXM+6lImCVe1t6wDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f4123a07f21da5a810ad039deefe2215f78300055b8ee0cc7c4ab0167a42c1f","last_reissued_at":"2026-07-05T01:39:44.310912Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:44.310912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of the Multilevel Critical Node Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.GT"],"primary_cat":"cs.CC","authors_text":"Adel Nabli, Margarida Carvalho, Pierre Hosteins","submitted_at":"2020-07-05T15:54:53Z","abstract_excerpt":"In this work, we analyze a sequential game played in a graph called the Multilevel Critical Node problem (MCN). A defender and an attacker are the players of this game. The defender starts by preventively interdicting vertices (vaccination) from being attacked. Then, the attacker infects a subset of non-vaccinated vertices and, finally, the defender reacts with a protection strategy. We provide the first computational complexity results associated with MCN and its subgames. Moreover, by considering unitary, weighted, undirected, and directed graphs, we clarify how the theoretical tractability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02370","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.02370/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.02370","created_at":"2026-07-05T01:39:44.310969+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.02370v2","created_at":"2026-07-05T01:39:44.310969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02370","created_at":"2026-07-05T01:39:44.310969+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5ASHID7EHNF","created_at":"2026-07-05T01:39:44.310969+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5ASHID7EHNFVAIK","created_at":"2026-07-05T01:39:44.310969+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5ASHID7","created_at":"2026-07-05T01:39:44.310969+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/H5ASHID7EHNFVAIK2A45537CEF","json":"https://pith.science/pith/H5ASHID7EHNFVAIK2A45537CEF.json","graph_json":"https://pith.science/api/pith-number/H5ASHID7EHNFVAIK2A45537CEF/graph.json","events_json":"https://pith.science/api/pith-number/H5ASHID7EHNFVAIK2A45537CEF/events.json","paper":"https://pith.science/paper/H5ASHID7"},"agent_actions":{"view_html":"https://pith.science/pith/H5ASHID7EHNFVAIK2A45537CEF","download_json":"https://pith.science/pith/H5ASHID7EHNFVAIK2A45537CEF.json","view_paper":"https://pith.science/paper/H5ASHID7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.02370&json=true","fetch_graph":"https://pith.science/api/pith-number/H5ASHID7EHNFVAIK2A45537CEF/graph.json","fetch_events":"https://pith.science/api/pith-number/H5ASHID7EHNFVAIK2A45537CEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5ASHID7EHNFVAIK2A45537CEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5ASHID7EHNFVAIK2A45537CEF/action/storage_attestation","attest_author":"https://pith.science/pith/H5ASHID7EHNFVAIK2A45537CEF/action/author_attestation","sign_citation":"https://pith.science/pith/H5ASHID7EHNFVAIK2A45537CEF/action/citation_signature","submit_replication":"https://pith.science/pith/H5ASHID7EHNFVAIK2A45537CEF/action/replication_record"}},"created_at":"2026-07-05T01:39:44.310969+00:00","updated_at":"2026-07-05T01:39:44.310969+00:00"}