{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WPD2IORFJPRJ7LYUQCWJJKW2PO","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":"716ba6091e2ad24d9ad95fd821af7cde0337584710fec3e9b9c597e8a4c66947","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-27T17:06:06Z","title_canon_sha256":"9890a13be718e2300c6d60a40f899f3f55be01ce1fdd490b01a66d995bd60522"},"schema_version":"1.0","source":{"id":"2410.22363","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22363","created_at":"2026-07-05T09:28:15Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22363v1","created_at":"2026-07-05T09:28:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22363","created_at":"2026-07-05T09:28:15Z"},{"alias_kind":"pith_short_12","alias_value":"WPD2IORFJPRJ","created_at":"2026-07-05T09:28:15Z"},{"alias_kind":"pith_short_16","alias_value":"WPD2IORFJPRJ7LYU","created_at":"2026-07-05T09:28:15Z"},{"alias_kind":"pith_short_8","alias_value":"WPD2IORF","created_at":"2026-07-05T09:28:15Z"}],"graph_snapshots":[{"event_id":"sha256:280140d9bc89044944cba848b2d017287d469af8f400fc1d281cb073837e16f5","target":"graph","created_at":"2026-07-05T09:28:15Z","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/2410.22363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Branch and bound algorithms have been developed for reliability analysis of coherent systems. They exhibit a set of advantages; in particular, they can find a computationally efficient representation of a system failure or survival event, which can be re-used when the input probability distributions change over time or when new data is available. However, existing branch-and-bound algorithms can handle only a limited set of system performance functions, mostly network connectivity and maximum flow. Furthermore, they run redundant analyses on component vector states whose system state can be in","authors_text":"Daniel Straub, Hyeuk Ryu, Ji-Eun Byun","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-27T17:06:06Z","title":"Branch-and-bound algorithm for efficient reliability analysis of general coherent systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22363","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:36391666a5afca221a1f008581a6043b628c28b19aac3fa15e05ac24b2129766","target":"record","created_at":"2026-07-05T09:28:15Z","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":"716ba6091e2ad24d9ad95fd821af7cde0337584710fec3e9b9c597e8a4c66947","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-27T17:06:06Z","title_canon_sha256":"9890a13be718e2300c6d60a40f899f3f55be01ce1fdd490b01a66d995bd60522"},"schema_version":"1.0","source":{"id":"2410.22363","kind":"arxiv","version":1}},"canonical_sha256":"b3c7a43a254be29faf1480ac94aada7b90d7ea03f04b0ea01cc7bf30f48afa5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3c7a43a254be29faf1480ac94aada7b90d7ea03f04b0ea01cc7bf30f48afa5c","first_computed_at":"2026-07-05T09:28:15.451592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:28:15.451592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swYHdbETLQt0IGUFW2QBxnABzjWauK4oCmqdNgsqbS0fbfI78LpnTkVy+cp+vn5W2QxeOKDVcerJg6qQD7DMDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:28:15.452153Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.22363","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36391666a5afca221a1f008581a6043b628c28b19aac3fa15e05ac24b2129766","sha256:280140d9bc89044944cba848b2d017287d469af8f400fc1d281cb073837e16f5"],"state_sha256":"67cd2e9f3e460ef04b5d819168f2ce26140f37cb6c96855567fdff2876883d23"}