{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OZVMWPONJ2ZVA7ZPW5H6EHLTJP","short_pith_number":"pith:OZVMWPON","schema_version":"1.0","canonical_sha256":"766acb3dcd4eb3507f2fb74fe21d734bd5599d1e81f493ed745cecdc6c7af1d8","source":{"kind":"arxiv","id":"1811.06162","version":1},"attestation_state":"computed","paper":{"title":"Plan Interdiction Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Michael Pritchard, Yevgeniy Vorobeychik","submitted_at":"2018-11-15T04:15:34Z","abstract_excerpt":"We propose a framework for cyber risk assessment and mitigation which models attackers as formal planners and defenders as interdicting such plans. We illustrate the value of plan interdiction problems by first modeling network cyber risk through the use of formal planning, and subsequently formalizing an important question of prioritizing vulnerabilities for patching in the plan interdiction framework. In particular, we show that selectively patching relatively few vulnerabilities allows a network administrator to significantly reduce exposure to cyber risk. More broadly, we have developed a "},"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":"1811.06162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-15T04:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"a3ecd3e2187c16c646e6d246989bdfb331c7fb40990c64cd6c2f8c2756dfe0f9","abstract_canon_sha256":"a6aaa6b4f7ac04eb3c6cd6a38f7b2fee1c7f48ee608b38de4c7a8f3ff5ddc415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:38.475424Z","signature_b64":"K1SWl5VcDOPaPSp93hNmRMqlCkcip6aOA0f7Z2JY/W9UNt1tiS9EMLMGmsUS2jxCGXHpBGq9hpwWGNS7AuvfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"766acb3dcd4eb3507f2fb74fe21d734bd5599d1e81f493ed745cecdc6c7af1d8","last_reissued_at":"2026-05-18T00:00:38.475021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:38.475021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Plan Interdiction Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Michael Pritchard, Yevgeniy Vorobeychik","submitted_at":"2018-11-15T04:15:34Z","abstract_excerpt":"We propose a framework for cyber risk assessment and mitigation which models attackers as formal planners and defenders as interdicting such plans. We illustrate the value of plan interdiction problems by first modeling network cyber risk through the use of formal planning, and subsequently formalizing an important question of prioritizing vulnerabilities for patching in the plan interdiction framework. In particular, we show that selectively patching relatively few vulnerabilities allows a network administrator to significantly reduce exposure to cyber risk. More broadly, we have developed a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06162","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":"1811.06162","created_at":"2026-05-18T00:00:38.475081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06162v1","created_at":"2026-05-18T00:00:38.475081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06162","created_at":"2026-05-18T00:00:38.475081+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZVMWPONJ2ZV","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZVMWPONJ2ZVA7ZP","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZVMWPON","created_at":"2026-05-18T12:32:43.782077+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/OZVMWPONJ2ZVA7ZPW5H6EHLTJP","json":"https://pith.science/pith/OZVMWPONJ2ZVA7ZPW5H6EHLTJP.json","graph_json":"https://pith.science/api/pith-number/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/graph.json","events_json":"https://pith.science/api/pith-number/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/events.json","paper":"https://pith.science/paper/OZVMWPON"},"agent_actions":{"view_html":"https://pith.science/pith/OZVMWPONJ2ZVA7ZPW5H6EHLTJP","download_json":"https://pith.science/pith/OZVMWPONJ2ZVA7ZPW5H6EHLTJP.json","view_paper":"https://pith.science/paper/OZVMWPON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06162&json=true","fetch_graph":"https://pith.science/api/pith-number/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/graph.json","fetch_events":"https://pith.science/api/pith-number/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/action/storage_attestation","attest_author":"https://pith.science/pith/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/action/author_attestation","sign_citation":"https://pith.science/pith/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/action/citation_signature","submit_replication":"https://pith.science/pith/OZVMWPONJ2ZVA7ZPW5H6EHLTJP/action/replication_record"}},"created_at":"2026-05-18T00:00:38.475081+00:00","updated_at":"2026-05-18T00:00:38.475081+00:00"}