{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4HOJ4LIBUGBCG7TNUAEIBQTSSB","short_pith_number":"pith:4HOJ4LIB","schema_version":"1.0","canonical_sha256":"e1dc9e2d01a182237e6da00880c272905e0bd4cb6c3160f6436a1ce4d6806ba4","source":{"kind":"arxiv","id":"1510.02427","version":2},"attestation_state":"computed","paper":{"title":"Exact Inference Techniques for the Analysis of Bayesian Attack Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.ML"],"primary_cat":"cs.CR","authors_text":"Daniele Sgandurra, Emil Lupu, Luis Mu\\~noz-Gonz\\'alez, Mart\\'in Barr\\`ere","submitted_at":"2015-10-08T18:01:54Z","abstract_excerpt":"Attack graphs are a powerful tool for security risk assessment by analysing network vulnerabilities and the paths attackers can use to compromise network resources. The uncertainty about the attacker's behaviour makes Bayesian networks suitable to model attack graphs to perform static and dynamic analysis. Previous approaches have focused on the formalization of attack graphs into a Bayesian model rather than proposing mechanisms for their analysis. In this paper we propose to use efficient algorithms to make exact inference in Bayesian attack graphs, enabling the static and dynamic network ri"},"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":"1510.02427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-10-08T18:01:54Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"d5c67ff131789d6fbfd5441f90a2c5683f90d83a7614a1ec4e1f14f67fac13cb","abstract_canon_sha256":"a92d049ec391c630243d5c1898e041b671daba6a974cd544f25e904921384907"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:12.713884Z","signature_b64":"oEqPAJTiRTMAaLIjs1BFoO8rwCgrEeSiYn4BHpugtWXKBuPLfFwM50RdMgD6oV3pi21kEC1kNchSLfHMglXVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1dc9e2d01a182237e6da00880c272905e0bd4cb6c3160f6436a1ce4d6806ba4","last_reissued_at":"2026-05-18T01:00:12.712869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:12.712869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Inference Techniques for the Analysis of Bayesian Attack Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.ML"],"primary_cat":"cs.CR","authors_text":"Daniele Sgandurra, Emil Lupu, Luis Mu\\~noz-Gonz\\'alez, Mart\\'in Barr\\`ere","submitted_at":"2015-10-08T18:01:54Z","abstract_excerpt":"Attack graphs are a powerful tool for security risk assessment by analysing network vulnerabilities and the paths attackers can use to compromise network resources. The uncertainty about the attacker's behaviour makes Bayesian networks suitable to model attack graphs to perform static and dynamic analysis. Previous approaches have focused on the formalization of attack graphs into a Bayesian model rather than proposing mechanisms for their analysis. In this paper we propose to use efficient algorithms to make exact inference in Bayesian attack graphs, enabling the static and dynamic network ri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02427","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":""},"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":"1510.02427","created_at":"2026-05-18T01:00:12.713150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02427v2","created_at":"2026-05-18T01:00:12.713150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02427","created_at":"2026-05-18T01:00:12.713150+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HOJ4LIBUGBC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HOJ4LIBUGBCG7TN","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HOJ4LIB","created_at":"2026-05-18T12:29:05.191682+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/4HOJ4LIBUGBCG7TNUAEIBQTSSB","json":"https://pith.science/pith/4HOJ4LIBUGBCG7TNUAEIBQTSSB.json","graph_json":"https://pith.science/api/pith-number/4HOJ4LIBUGBCG7TNUAEIBQTSSB/graph.json","events_json":"https://pith.science/api/pith-number/4HOJ4LIBUGBCG7TNUAEIBQTSSB/events.json","paper":"https://pith.science/paper/4HOJ4LIB"},"agent_actions":{"view_html":"https://pith.science/pith/4HOJ4LIBUGBCG7TNUAEIBQTSSB","download_json":"https://pith.science/pith/4HOJ4LIBUGBCG7TNUAEIBQTSSB.json","view_paper":"https://pith.science/paper/4HOJ4LIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02427&json=true","fetch_graph":"https://pith.science/api/pith-number/4HOJ4LIBUGBCG7TNUAEIBQTSSB/graph.json","fetch_events":"https://pith.science/api/pith-number/4HOJ4LIBUGBCG7TNUAEIBQTSSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HOJ4LIBUGBCG7TNUAEIBQTSSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HOJ4LIBUGBCG7TNUAEIBQTSSB/action/storage_attestation","attest_author":"https://pith.science/pith/4HOJ4LIBUGBCG7TNUAEIBQTSSB/action/author_attestation","sign_citation":"https://pith.science/pith/4HOJ4LIBUGBCG7TNUAEIBQTSSB/action/citation_signature","submit_replication":"https://pith.science/pith/4HOJ4LIBUGBCG7TNUAEIBQTSSB/action/replication_record"}},"created_at":"2026-05-18T01:00:12.713150+00:00","updated_at":"2026-05-18T01:00:12.713150+00:00"}