{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5KZGQMLV7G2SMYFM2HBUO3VOWF","short_pith_number":"pith:5KZGQMLV","canonical_record":{"source":{"id":"2202.02829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-02-06T18:37:25Z","cross_cats_sorted":[],"title_canon_sha256":"535cd3cbf508da731c0a2661d9ae1faddb8bc83ef8232ee1d9451f6225331746","abstract_canon_sha256":"d91134555bff81e32041ec7304ec763edc4e7a4cd1b02d988518d742f53dee6b"},"schema_version":"1.0"},"canonical_sha256":"eab2683175f9b52660acd1c3476eaeb1494e6308beee2e9d3a2faeee8b46c0af","source":{"kind":"arxiv","id":"2202.02829","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.02829","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"arxiv_version","alias_value":"2202.02829v2","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02829","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"pith_short_12","alias_value":"5KZGQMLV7G2S","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"pith_short_16","alias_value":"5KZGQMLV7G2SMYFM","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"pith_short_8","alias_value":"5KZGQMLV","created_at":"2026-07-05T04:09:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5KZGQMLV7G2SMYFM2HBUO3VOWF","target":"record","payload":{"canonical_record":{"source":{"id":"2202.02829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-02-06T18:37:25Z","cross_cats_sorted":[],"title_canon_sha256":"535cd3cbf508da731c0a2661d9ae1faddb8bc83ef8232ee1d9451f6225331746","abstract_canon_sha256":"d91134555bff81e32041ec7304ec763edc4e7a4cd1b02d988518d742f53dee6b"},"schema_version":"1.0"},"canonical_sha256":"eab2683175f9b52660acd1c3476eaeb1494e6308beee2e9d3a2faeee8b46c0af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:09:01.609546Z","signature_b64":"jJxUHPLdsbdzX/ol4Kvprrtt/13JZBIph47qmvWQMfa5rguHMH/yMyfcM/nfcCXgwdTtNzsT4F3Gl3OHTYNuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab2683175f9b52660acd1c3476eaeb1494e6308beee2e9d3a2faeee8b46c0af","last_reissued_at":"2026-07-05T04:09:01.609182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:09:01.609182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.02829","source_version":2,"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-07-05T04:09:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PygVdrjj1fMakhQJGTSbUMdNL1u3qh8djX4a7N0ljXsjXaJgX4RdjcrIBJN5gcdRRATduvs+XpK1euMDRHu0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:54:47.410079Z"},"content_sha256":"2070e70308d2d4962bc4193397b86d258a766f872fa846b621557a6514058b0e","schema_version":"1.0","event_id":"sha256:2070e70308d2d4962bc4193397b86d258a766f872fa846b621557a6514058b0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5KZGQMLV7G2SMYFM2HBUO3VOWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Daniel Basg\\\"oze, Joost-Pieter Katoen, Marielle Stoelinga, Matthias Volk, Shahid Khan","submitted_at":"2022-02-06T18:37:25Z","abstract_excerpt":"Fault trees are a key model in reliability analysis. Classical static fault trees (SFT) can best be analysed using binary decision diagrams (BDD). State-based techniques are favorable for the more expressive dynamic fault trees (DFT). This paper combines the best of both worlds by following Dugan's approach: dynamic sub-trees are analysed via model checking Markov models and replaced by basic events capturing the obtained failure probabilities. The resulting SFT is then analysed via BDDs. We implemented this approach in the Storm model checker. Extensive experiments (a) compare our pure BDD-ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02829","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/2202.02829/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"},"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-07-05T04:09:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xcccU5z3Jmfzwtg+aA9tJ7IP69MS+RWZVvOkoLHk3dZj/mBnp77lzFKIpZlL6FsttVROEUz+9+ibOL/EwD/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:54:47.411014Z"},"content_sha256":"49c29e675ed30943d94c4d06a7d1e57218a1cb32e65b227396276a7651a2f69b","schema_version":"1.0","event_id":"sha256:49c29e675ed30943d94c4d06a7d1e57218a1cb32e65b227396276a7651a2f69b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KZGQMLV7G2SMYFM2HBUO3VOWF/bundle.json","state_url":"https://pith.science/pith/5KZGQMLV7G2SMYFM2HBUO3VOWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KZGQMLV7G2SMYFM2HBUO3VOWF/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-08-04T14:54:47Z","links":{"resolver":"https://pith.science/pith/5KZGQMLV7G2SMYFM2HBUO3VOWF","bundle":"https://pith.science/pith/5KZGQMLV7G2SMYFM2HBUO3VOWF/bundle.json","state":"https://pith.science/pith/5KZGQMLV7G2SMYFM2HBUO3VOWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KZGQMLV7G2SMYFM2HBUO3VOWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5KZGQMLV7G2SMYFM2HBUO3VOWF","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":"d91134555bff81e32041ec7304ec763edc4e7a4cd1b02d988518d742f53dee6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-02-06T18:37:25Z","title_canon_sha256":"535cd3cbf508da731c0a2661d9ae1faddb8bc83ef8232ee1d9451f6225331746"},"schema_version":"1.0","source":{"id":"2202.02829","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.02829","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"arxiv_version","alias_value":"2202.02829v2","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02829","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"pith_short_12","alias_value":"5KZGQMLV7G2S","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"pith_short_16","alias_value":"5KZGQMLV7G2SMYFM","created_at":"2026-07-05T04:09:01Z"},{"alias_kind":"pith_short_8","alias_value":"5KZGQMLV","created_at":"2026-07-05T04:09:01Z"}],"graph_snapshots":[{"event_id":"sha256:49c29e675ed30943d94c4d06a7d1e57218a1cb32e65b227396276a7651a2f69b","target":"graph","created_at":"2026-07-05T04:09:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.02829/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fault trees are a key model in reliability analysis. Classical static fault trees (SFT) can best be analysed using binary decision diagrams (BDD). State-based techniques are favorable for the more expressive dynamic fault trees (DFT). This paper combines the best of both worlds by following Dugan's approach: dynamic sub-trees are analysed via model checking Markov models and replaced by basic events capturing the obtained failure probabilities. The resulting SFT is then analysed via BDDs. We implemented this approach in the Storm model checker. Extensive experiments (a) compare our pure BDD-ba","authors_text":"Daniel Basg\\\"oze, Joost-Pieter Katoen, Marielle Stoelinga, Matthias Volk, Shahid Khan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-02-06T18:37:25Z","title":"BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02829","kind":"arxiv","version":2},"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:2070e70308d2d4962bc4193397b86d258a766f872fa846b621557a6514058b0e","target":"record","created_at":"2026-07-05T04:09:01Z","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":"d91134555bff81e32041ec7304ec763edc4e7a4cd1b02d988518d742f53dee6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-02-06T18:37:25Z","title_canon_sha256":"535cd3cbf508da731c0a2661d9ae1faddb8bc83ef8232ee1d9451f6225331746"},"schema_version":"1.0","source":{"id":"2202.02829","kind":"arxiv","version":2}},"canonical_sha256":"eab2683175f9b52660acd1c3476eaeb1494e6308beee2e9d3a2faeee8b46c0af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eab2683175f9b52660acd1c3476eaeb1494e6308beee2e9d3a2faeee8b46c0af","first_computed_at":"2026-07-05T04:09:01.609182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:09:01.609182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jJxUHPLdsbdzX/ol4Kvprrtt/13JZBIph47qmvWQMfa5rguHMH/yMyfcM/nfcCXgwdTtNzsT4F3Gl3OHTYNuAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:09:01.609546Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.02829","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2070e70308d2d4962bc4193397b86d258a766f872fa846b621557a6514058b0e","sha256:49c29e675ed30943d94c4d06a7d1e57218a1cb32e65b227396276a7651a2f69b"],"state_sha256":"6a46cd1f5ecbd9a12f6710a84672ca92a8109b343e4a4295b0cbfc9281e6effa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVPVJi/c3odcfXjRTGzu4SktsRyC2HVlDILlGUQLbf9NeJbyaoovrnChQAb2FMAjOodSzLE3UHxneBf5oQ81Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:54:47.416731Z","bundle_sha256":"ba24ee0ecb1a2a9abc016e25517187899070d4cc461da75a26ed9fe424971f40"}}