{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5KAEXUZIGC6S7VZFU7DO3IU4JK","short_pith_number":"pith:5KAEXUZI","schema_version":"1.0","canonical_sha256":"ea804bd32830bd2fd725a7c6eda29c4aa7d610e805ddf033f5a687971edf6476","source":{"kind":"arxiv","id":"1505.02648","version":1},"attestation_state":"computed","paper":{"title":"Towards Formal Fault Tree Analysis using Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SE"],"primary_cat":"cs.LO","authors_text":"Osman Hasan, Waqar Ahmed","submitted_at":"2015-05-08T05:14:08Z","abstract_excerpt":"Fault Tree Analysis (FTA) is a dependability analysis technique that has been widely used to predict reliability, availability and safety of many complex engineering systems. Traditionally, these FTA-based analyses are done using paper-and-pencil proof methods or computer simulations, which cannot ascertain absolute correctness due to their inherent limitations. As a complementary approach, we propose to use the higher-order-logic theorem prover HOL4 to conduct the FTA-based analysis of safety-critical systems where accuracy of failure analysis is a dire need. In particular, the paper presents"},"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":"1505.02648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-08T05:14:08Z","cross_cats_sorted":["cs.AI","cs.SE"],"title_canon_sha256":"101bfd26e6ff61b68181fef210ffb812a6f4ac3d2397ab7f31ef1d6ca8c6a03e","abstract_canon_sha256":"d7231d389b370290c7ac5aca43ebb497e87e3efb2007e2cde5effc34cf28cd8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:11.948626Z","signature_b64":"zkc04orccTB3xltrsh/RaQ1P8LbfONeqZq2qQ9Z8IWCf4uvuk8WD92f3Rva9cmBKFr3BwLZJ+lNyVHu2u3XICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea804bd32830bd2fd725a7c6eda29c4aa7d610e805ddf033f5a687971edf6476","last_reissued_at":"2026-05-18T02:16:11.947943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:11.947943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Formal Fault Tree Analysis using Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SE"],"primary_cat":"cs.LO","authors_text":"Osman Hasan, Waqar Ahmed","submitted_at":"2015-05-08T05:14:08Z","abstract_excerpt":"Fault Tree Analysis (FTA) is a dependability analysis technique that has been widely used to predict reliability, availability and safety of many complex engineering systems. Traditionally, these FTA-based analyses are done using paper-and-pencil proof methods or computer simulations, which cannot ascertain absolute correctness due to their inherent limitations. As a complementary approach, we propose to use the higher-order-logic theorem prover HOL4 to conduct the FTA-based analysis of safety-critical systems where accuracy of failure analysis is a dire need. In particular, the paper presents"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02648","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":"1505.02648","created_at":"2026-05-18T02:16:11.948039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02648v1","created_at":"2026-05-18T02:16:11.948039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02648","created_at":"2026-05-18T02:16:11.948039+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KAEXUZIGC6S","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KAEXUZIGC6S7VZF","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KAEXUZI","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/5KAEXUZIGC6S7VZFU7DO3IU4JK","json":"https://pith.science/pith/5KAEXUZIGC6S7VZFU7DO3IU4JK.json","graph_json":"https://pith.science/api/pith-number/5KAEXUZIGC6S7VZFU7DO3IU4JK/graph.json","events_json":"https://pith.science/api/pith-number/5KAEXUZIGC6S7VZFU7DO3IU4JK/events.json","paper":"https://pith.science/paper/5KAEXUZI"},"agent_actions":{"view_html":"https://pith.science/pith/5KAEXUZIGC6S7VZFU7DO3IU4JK","download_json":"https://pith.science/pith/5KAEXUZIGC6S7VZFU7DO3IU4JK.json","view_paper":"https://pith.science/paper/5KAEXUZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02648&json=true","fetch_graph":"https://pith.science/api/pith-number/5KAEXUZIGC6S7VZFU7DO3IU4JK/graph.json","fetch_events":"https://pith.science/api/pith-number/5KAEXUZIGC6S7VZFU7DO3IU4JK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KAEXUZIGC6S7VZFU7DO3IU4JK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KAEXUZIGC6S7VZFU7DO3IU4JK/action/storage_attestation","attest_author":"https://pith.science/pith/5KAEXUZIGC6S7VZFU7DO3IU4JK/action/author_attestation","sign_citation":"https://pith.science/pith/5KAEXUZIGC6S7VZFU7DO3IU4JK/action/citation_signature","submit_replication":"https://pith.science/pith/5KAEXUZIGC6S7VZFU7DO3IU4JK/action/replication_record"}},"created_at":"2026-05-18T02:16:11.948039+00:00","updated_at":"2026-05-18T02:16:11.948039+00:00"}