{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XZ2XVUISBCCOCOPZW5BFZNPINZ","short_pith_number":"pith:XZ2XVUIS","canonical_record":{"source":{"id":"1608.06392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-23T06:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"6ab38f47d9bcd9f04cc610b2da1e803ff71902e1d1bce1d5105ba3c645ec372c","abstract_canon_sha256":"688ba10089839fd1157019e9ed0afae30eb114100ce4f3d951a407a2a5e48c6a"},"schema_version":"1.0"},"canonical_sha256":"be757ad1120884e139f9b7425cb5e86e767f1088e45392d44f859962af2fa2c3","source":{"kind":"arxiv","id":"1608.06392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06392","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06392v1","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06392","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"XZ2XVUISBCCO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XZ2XVUISBCCOCOPZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XZ2XVUIS","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XZ2XVUISBCCOCOPZW5BFZNPINZ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-23T06:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"6ab38f47d9bcd9f04cc610b2da1e803ff71902e1d1bce1d5105ba3c645ec372c","abstract_canon_sha256":"688ba10089839fd1157019e9ed0afae30eb114100ce4f3d951a407a2a5e48c6a"},"schema_version":"1.0"},"canonical_sha256":"be757ad1120884e139f9b7425cb5e86e767f1088e45392d44f859962af2fa2c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:14.150124Z","signature_b64":"TgVOVGtkjg65t+lMOsJ8iS0IWWOaUe03QbG1eWWp1kd5q3Xs6a3Un0eNpgHU7vc9jlx58hQF1tCfYUuMQzPqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be757ad1120884e139f9b7425cb5e86e767f1088e45392d44f859962af2fa2c3","last_reissued_at":"2026-05-18T01:08:14.149606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:14.149606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06392","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/sA9qB6I3Kj8/KCasinLwNcdxagFXDmxx9+elmGpo6KWc0aZQx1lPd5d17y5+x5+3Ssxy5dmdkL1fO0raQ8SAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:26:54.097929Z"},"content_sha256":"8cc61d5633ed155305acd36f9bb2b240b97170eff6dffd332f7a6a6b0463410a","schema_version":"1.0","event_id":"sha256:8cc61d5633ed155305acd36f9bb2b240b97170eff6dffd332f7a6a6b0463410a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XZ2XVUISBCCOCOPZW5BFZNPINZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formalization of Fault Trees in Higher-order Logic: A Deep Embedding Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Osman Hasan, Waqar Ahmed","submitted_at":"2016-08-23T06:11:10Z","abstract_excerpt":"Fault Tree (FT) is a standard failure modeling technique that has been extensively used to predict reliability, availability and safety of many complex engineering systems. In order to facilitate the formal analysis of FT based analyses, a higher-order-logic formalization of FTs has been recently proposed. However, this formalization is quite limited in terms of handling large systems and transformation of FT models into their corresponding Reliability Block Diagram (RBD) structures, i.e., a frequently used transformation in reliability and availability analyses. In order to overcome these lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06392","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tB8HEXHnilf2jLXEmP7T8x9WTKCIOfQ0/SQaArTPVeZl8CYXjbmwGlD86f6dtSC3LFhcDa74gzpANfEvoxTFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:26:54.098572Z"},"content_sha256":"77e1d4c4a93b85ea17a299b44bca0e8b726e6990f747f323dddba3f397e61031","schema_version":"1.0","event_id":"sha256:77e1d4c4a93b85ea17a299b44bca0e8b726e6990f747f323dddba3f397e61031"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZ2XVUISBCCOCOPZW5BFZNPINZ/bundle.json","state_url":"https://pith.science/pith/XZ2XVUISBCCOCOPZW5BFZNPINZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZ2XVUISBCCOCOPZW5BFZNPINZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T14:26:54Z","links":{"resolver":"https://pith.science/pith/XZ2XVUISBCCOCOPZW5BFZNPINZ","bundle":"https://pith.science/pith/XZ2XVUISBCCOCOPZW5BFZNPINZ/bundle.json","state":"https://pith.science/pith/XZ2XVUISBCCOCOPZW5BFZNPINZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZ2XVUISBCCOCOPZW5BFZNPINZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XZ2XVUISBCCOCOPZW5BFZNPINZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"688ba10089839fd1157019e9ed0afae30eb114100ce4f3d951a407a2a5e48c6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-23T06:11:10Z","title_canon_sha256":"6ab38f47d9bcd9f04cc610b2da1e803ff71902e1d1bce1d5105ba3c645ec372c"},"schema_version":"1.0","source":{"id":"1608.06392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06392","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06392v1","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06392","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"XZ2XVUISBCCO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XZ2XVUISBCCOCOPZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XZ2XVUIS","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:77e1d4c4a93b85ea17a299b44bca0e8b726e6990f747f323dddba3f397e61031","target":"graph","created_at":"2026-05-18T01:08:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Fault Tree (FT) is a standard failure modeling technique that has been extensively used to predict reliability, availability and safety of many complex engineering systems. In order to facilitate the formal analysis of FT based analyses, a higher-order-logic formalization of FTs has been recently proposed. However, this formalization is quite limited in terms of handling large systems and transformation of FT models into their corresponding Reliability Block Diagram (RBD) structures, i.e., a frequently used transformation in reliability and availability analyses. In order to overcome these lim","authors_text":"Osman Hasan, Waqar Ahmed","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-23T06:11:10Z","title":"Formalization of Fault Trees in Higher-order Logic: A Deep Embedding Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06392","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8cc61d5633ed155305acd36f9bb2b240b97170eff6dffd332f7a6a6b0463410a","target":"record","created_at":"2026-05-18T01:08:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"688ba10089839fd1157019e9ed0afae30eb114100ce4f3d951a407a2a5e48c6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-23T06:11:10Z","title_canon_sha256":"6ab38f47d9bcd9f04cc610b2da1e803ff71902e1d1bce1d5105ba3c645ec372c"},"schema_version":"1.0","source":{"id":"1608.06392","kind":"arxiv","version":1}},"canonical_sha256":"be757ad1120884e139f9b7425cb5e86e767f1088e45392d44f859962af2fa2c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be757ad1120884e139f9b7425cb5e86e767f1088e45392d44f859962af2fa2c3","first_computed_at":"2026-05-18T01:08:14.149606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:14.149606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TgVOVGtkjg65t+lMOsJ8iS0IWWOaUe03QbG1eWWp1kd5q3Xs6a3Un0eNpgHU7vc9jlx58hQF1tCfYUuMQzPqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:14.150124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cc61d5633ed155305acd36f9bb2b240b97170eff6dffd332f7a6a6b0463410a","sha256:77e1d4c4a93b85ea17a299b44bca0e8b726e6990f747f323dddba3f397e61031"],"state_sha256":"6c73e297e2f69a52e1682bc375c88d6ffce43ac0a8b4eb7a660427ad9846e514"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yybVgLgX+tJtWI0cED3PkB7TqJ8feCkqHvXGJ4SHq6D8mHZW2/6kKOZbDRjxsM3pssT0Vme1LlJBXvjZqQgXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:26:54.101899Z","bundle_sha256":"d279ba35b018b7bb55eec50a61effa0dd80db8099125ebc3e2920a2bdab846e2"}}