{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GTH326C4Z6LNI5WPIIMXF5FH4B","short_pith_number":"pith:GTH326C4","schema_version":"1.0","canonical_sha256":"34cfbd785ccf96d476cf421972f4a7e046a167ba94d39ae83a31f6f6a4dec69e","source":{"kind":"arxiv","id":"1405.7475","version":1},"attestation_state":"computed","paper":{"title":"Automatic Generation of Security Argument Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"An Hoa Vu, Binbin Chen, David M. Nicol, Nils Ole Tippenhauer, William G. Temple, William H. Sanders, Zbigniew Kalbarczyk","submitted_at":"2014-05-29T06:42:11Z","abstract_excerpt":"Graph-based assessment formalisms have proven to be useful in the safety, dependability, and security communities to help stakeholders manage risk and maintain appropriate documentation throughout the system lifecycle. In this paper, we propose a set of methods to automatically construct security argument graphs, a graphical formalism that integrates various security-related information to argue about the security level of a system. Our approach is to generate the graph in a progressive manner by exploiting logical relationships among pieces of diverse input information. Using those emergent 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":"1405.7475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-05-29T06:42:11Z","cross_cats_sorted":[],"title_canon_sha256":"a69666468199c7144086755064119269bb90dc6c53169793533e9cc8c4d5f577","abstract_canon_sha256":"c5cb063ef57ed4f56948e4d7115fd39d4365e6d74bec847fc060de3f4a64d006"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:51.179732Z","signature_b64":"w47opKi1azNdPaGHQDxnSriLiYqzKdyH1y09By0bQZZ2h06TZbdq2jS49wRxx+pSWtnSyI80BcIIdmiMwr05Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34cfbd785ccf96d476cf421972f4a7e046a167ba94d39ae83a31f6f6a4dec69e","last_reissued_at":"2026-05-18T02:50:51.179246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:51.179246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Generation of Security Argument Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"An Hoa Vu, Binbin Chen, David M. Nicol, Nils Ole Tippenhauer, William G. Temple, William H. Sanders, Zbigniew Kalbarczyk","submitted_at":"2014-05-29T06:42:11Z","abstract_excerpt":"Graph-based assessment formalisms have proven to be useful in the safety, dependability, and security communities to help stakeholders manage risk and maintain appropriate documentation throughout the system lifecycle. In this paper, we propose a set of methods to automatically construct security argument graphs, a graphical formalism that integrates various security-related information to argue about the security level of a system. Our approach is to generate the graph in a progressive manner by exploiting logical relationships among pieces of diverse input information. Using those emergent a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7475","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":"1405.7475","created_at":"2026-05-18T02:50:51.179324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7475v1","created_at":"2026-05-18T02:50:51.179324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7475","created_at":"2026-05-18T02:50:51.179324+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTH326C4Z6LN","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTH326C4Z6LNI5WP","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTH326C4","created_at":"2026-05-18T12:28:30.664211+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/GTH326C4Z6LNI5WPIIMXF5FH4B","json":"https://pith.science/pith/GTH326C4Z6LNI5WPIIMXF5FH4B.json","graph_json":"https://pith.science/api/pith-number/GTH326C4Z6LNI5WPIIMXF5FH4B/graph.json","events_json":"https://pith.science/api/pith-number/GTH326C4Z6LNI5WPIIMXF5FH4B/events.json","paper":"https://pith.science/paper/GTH326C4"},"agent_actions":{"view_html":"https://pith.science/pith/GTH326C4Z6LNI5WPIIMXF5FH4B","download_json":"https://pith.science/pith/GTH326C4Z6LNI5WPIIMXF5FH4B.json","view_paper":"https://pith.science/paper/GTH326C4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7475&json=true","fetch_graph":"https://pith.science/api/pith-number/GTH326C4Z6LNI5WPIIMXF5FH4B/graph.json","fetch_events":"https://pith.science/api/pith-number/GTH326C4Z6LNI5WPIIMXF5FH4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTH326C4Z6LNI5WPIIMXF5FH4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTH326C4Z6LNI5WPIIMXF5FH4B/action/storage_attestation","attest_author":"https://pith.science/pith/GTH326C4Z6LNI5WPIIMXF5FH4B/action/author_attestation","sign_citation":"https://pith.science/pith/GTH326C4Z6LNI5WPIIMXF5FH4B/action/citation_signature","submit_replication":"https://pith.science/pith/GTH326C4Z6LNI5WPIIMXF5FH4B/action/replication_record"}},"created_at":"2026-05-18T02:50:51.179324+00:00","updated_at":"2026-05-18T02:50:51.179324+00:00"}