{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BANU3TEP75QQYA4BR4DVWF5UBM","short_pith_number":"pith:BANU3TEP","schema_version":"1.0","canonical_sha256":"081b4dcc8fff610c03818f075b17b40b083b050bf4603bd9a67b54a0296852ee","source":{"kind":"arxiv","id":"2212.04326","version":1},"attestation_state":"computed","paper":{"title":"Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CR","authors_text":"Aneta Neumann, Frank Neumann, Hung Nguyen, Max Ward, Mingyu Guo","submitted_at":"2022-12-02T16:10:26Z","abstract_excerpt":"Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/accounts/security groups, and edges represent existing accesses/known exploits that allow the attacker to gain access from one node to another. Motivated by practical AD use cases, we study a Stackelberg game between one attacker and one defender. There are multiple entry nodes for the attacker to choose from and there is a single target (Domain Admin). Every edge has a failure rate. The attacker chooses the attack pa"},"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":"2212.04326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2022-12-02T16:10:26Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"68f9dc2d30b867b8f34c11514758ec51977f9ee1ec0105729a581a0ee2e6a74e","abstract_canon_sha256":"8971210d7ac5baf68f1915801abfa0412dce8e6a764ef91e50cbfc3885dc9f1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:39.578524Z","signature_b64":"jDtFIokK0i6luYSW6yCCAuNbM8VAmdKLtYAh1HPznIB/vhvgq1XfKxnG09aCFV/AyN5a28mu45wOJYm2bxmtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"081b4dcc8fff610c03818f075b17b40b083b050bf4603bd9a67b54a0296852ee","last_reissued_at":"2026-07-05T05:23:39.578092Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:39.578092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CR","authors_text":"Aneta Neumann, Frank Neumann, Hung Nguyen, Max Ward, Mingyu Guo","submitted_at":"2022-12-02T16:10:26Z","abstract_excerpt":"Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/accounts/security groups, and edges represent existing accesses/known exploits that allow the attacker to gain access from one node to another. Motivated by practical AD use cases, we study a Stackelberg game between one attacker and one defender. There are multiple entry nodes for the attacker to choose from and there is a single target (Domain Admin). Every edge has a failure rate. The attacker chooses the attack pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04326","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.04326/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":"2212.04326","created_at":"2026-07-05T05:23:39.578153+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.04326v1","created_at":"2026-07-05T05:23:39.578153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04326","created_at":"2026-07-05T05:23:39.578153+00:00"},{"alias_kind":"pith_short_12","alias_value":"BANU3TEP75QQ","created_at":"2026-07-05T05:23:39.578153+00:00"},{"alias_kind":"pith_short_16","alias_value":"BANU3TEP75QQYA4B","created_at":"2026-07-05T05:23:39.578153+00:00"},{"alias_kind":"pith_short_8","alias_value":"BANU3TEP","created_at":"2026-07-05T05:23:39.578153+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/BANU3TEP75QQYA4BR4DVWF5UBM","json":"https://pith.science/pith/BANU3TEP75QQYA4BR4DVWF5UBM.json","graph_json":"https://pith.science/api/pith-number/BANU3TEP75QQYA4BR4DVWF5UBM/graph.json","events_json":"https://pith.science/api/pith-number/BANU3TEP75QQYA4BR4DVWF5UBM/events.json","paper":"https://pith.science/paper/BANU3TEP"},"agent_actions":{"view_html":"https://pith.science/pith/BANU3TEP75QQYA4BR4DVWF5UBM","download_json":"https://pith.science/pith/BANU3TEP75QQYA4BR4DVWF5UBM.json","view_paper":"https://pith.science/paper/BANU3TEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.04326&json=true","fetch_graph":"https://pith.science/api/pith-number/BANU3TEP75QQYA4BR4DVWF5UBM/graph.json","fetch_events":"https://pith.science/api/pith-number/BANU3TEP75QQYA4BR4DVWF5UBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BANU3TEP75QQYA4BR4DVWF5UBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BANU3TEP75QQYA4BR4DVWF5UBM/action/storage_attestation","attest_author":"https://pith.science/pith/BANU3TEP75QQYA4BR4DVWF5UBM/action/author_attestation","sign_citation":"https://pith.science/pith/BANU3TEP75QQYA4BR4DVWF5UBM/action/citation_signature","submit_replication":"https://pith.science/pith/BANU3TEP75QQYA4BR4DVWF5UBM/action/replication_record"}},"created_at":"2026-07-05T05:23:39.578153+00:00","updated_at":"2026-07-05T05:23:39.578153+00:00"}