{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DTYZFNNLMXTN4MR6U3EOHMNGVC","short_pith_number":"pith:DTYZFNNL","schema_version":"1.0","canonical_sha256":"1cf192b5ab65e6de323ea6c8e3b1a6a8b16410ed309ef60723f1ff0a258cbd73","source":{"kind":"arxiv","id":"2510.06420","version":2},"attestation_state":"computed","paper":{"title":"Automated Repeatable Adversary Threat Emulation with Effects Language (EL)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Paul D. Rowe, Suresh K. Damodaran","submitted_at":"2025-10-07T20:00:27Z","abstract_excerpt":"The emulation of multi-step attacks attributed to advanced persistent threats is valuable for training defenders and evaluating defense tools. In this paper, we discuss the numerous challenges and desired attributes associated with such automation. Additionally, we introduce the use of Effects Language (EL), a visual programming language with graph-based operational semantics, as a solution to address many of these challenges and requirements. We formally define the execution semantics of EL, and prove important execution properties. Furthermore, we showcase the application of EL to codify att"},"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":"2510.06420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2025-10-07T20:00:27Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"fa16538d4f8b1de65953a3f7f98ac5e75cbca524e4a2dcbf5f3e089464d3cdd6","abstract_canon_sha256":"7cf23ca4a7abcf39142bb2e0eda7eb299cbdab16123a7ea2be342ceefe1a6ca5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:24.692258Z","signature_b64":"6fRlQ3oHcrS4B44NFu1s7FpaBBkS347UKoz8REFeX7DK2SAd6BPlsh6l8PWkHjk2s5W0wodNjJeqzTTDvLhAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf192b5ab65e6de323ea6c8e3b1a6a8b16410ed309ef60723f1ff0a258cbd73","last_reissued_at":"2026-06-29T01:14:24.691779Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:24.691779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Repeatable Adversary Threat Emulation with Effects Language (EL)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Paul D. Rowe, Suresh K. Damodaran","submitted_at":"2025-10-07T20:00:27Z","abstract_excerpt":"The emulation of multi-step attacks attributed to advanced persistent threats is valuable for training defenders and evaluating defense tools. In this paper, we discuss the numerous challenges and desired attributes associated with such automation. Additionally, we introduce the use of Effects Language (EL), a visual programming language with graph-based operational semantics, as a solution to address many of these challenges and requirements. We formally define the execution semantics of EL, and prove important execution properties. Furthermore, we showcase the application of EL to codify att"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.06420","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/2510.06420/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":"2510.06420","created_at":"2026-06-29T01:14:24.691838+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.06420v2","created_at":"2026-06-29T01:14:24.691838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.06420","created_at":"2026-06-29T01:14:24.691838+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTYZFNNLMXTN","created_at":"2026-06-29T01:14:24.691838+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTYZFNNLMXTN4MR6","created_at":"2026-06-29T01:14:24.691838+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTYZFNNL","created_at":"2026-06-29T01:14:24.691838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.12078","citing_title":"The Procedural Semantics Gap in Structured CTI: A Measurement-Driven STIX Analysis for APT Emulation","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC","json":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC.json","graph_json":"https://pith.science/api/pith-number/DTYZFNNLMXTN4MR6U3EOHMNGVC/graph.json","events_json":"https://pith.science/api/pith-number/DTYZFNNLMXTN4MR6U3EOHMNGVC/events.json","paper":"https://pith.science/paper/DTYZFNNL"},"agent_actions":{"view_html":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC","download_json":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC.json","view_paper":"https://pith.science/paper/DTYZFNNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.06420&json=true","fetch_graph":"https://pith.science/api/pith-number/DTYZFNNLMXTN4MR6U3EOHMNGVC/graph.json","fetch_events":"https://pith.science/api/pith-number/DTYZFNNLMXTN4MR6U3EOHMNGVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC/action/storage_attestation","attest_author":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC/action/author_attestation","sign_citation":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC/action/citation_signature","submit_replication":"https://pith.science/pith/DTYZFNNLMXTN4MR6U3EOHMNGVC/action/replication_record"}},"created_at":"2026-06-29T01:14:24.691838+00:00","updated_at":"2026-06-29T01:14:24.691838+00:00"}