{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RLDJIHXOVNV54Z4CALSLSW4223","short_pith_number":"pith:RLDJIHXO","canonical_record":{"source":{"id":"2201.12829","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-01-30T14:26:42Z","cross_cats_sorted":[],"title_canon_sha256":"a743ac40eeeb46623a3400060685ffa1ad00543867ee2cec9051acd81728a63d","abstract_canon_sha256":"07105250678ba66a0b3bbf410aaacb13d23bb2d3c8e9a31ff4b836a63d7c8f6c"},"schema_version":"1.0"},"canonical_sha256":"8ac6941eeeab6bde678202e4b95b9ad6cf5b84017f940c0a19f4c1148d60853e","source":{"kind":"arxiv","id":"2201.12829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12829","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12829v1","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12829","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"RLDJIHXOVNV5","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"RLDJIHXOVNV54Z4C","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"RLDJIHXO","created_at":"2026-07-05T03:52:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RLDJIHXOVNV54Z4CALSLSW4223","target":"record","payload":{"canonical_record":{"source":{"id":"2201.12829","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-01-30T14:26:42Z","cross_cats_sorted":[],"title_canon_sha256":"a743ac40eeeb46623a3400060685ffa1ad00543867ee2cec9051acd81728a63d","abstract_canon_sha256":"07105250678ba66a0b3bbf410aaacb13d23bb2d3c8e9a31ff4b836a63d7c8f6c"},"schema_version":"1.0"},"canonical_sha256":"8ac6941eeeab6bde678202e4b95b9ad6cf5b84017f940c0a19f4c1148d60853e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:40.248510Z","signature_b64":"yUNGIxLqtjS8cERUzzmiOY2hRjmYvmn5JffXbtq1qc3czpousVC0zX0X0Gj06a8+2lU0xev/nHson7c6t5OzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac6941eeeab6bde678202e4b95b9ad6cf5b84017f940c0a19f4c1148d60853e","last_reissued_at":"2026-07-05T03:52:40.248085Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:40.248085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.12829","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-07-05T03:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wd4KWwVXyBt10KmY1SVGqctlOp32ame7nqnh48z3EfZFTD/YXZvuwKW9Q9WmUm1ICn9qws0sRXpdlIfATgsBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:23:34.153879Z"},"content_sha256":"42923c98589cfd00899f0056bc4c9d4d38413ce179c7277795e9f0f85bbd850c","schema_version":"1.0","event_id":"sha256:42923c98589cfd00899f0056bc4c9d4d38413ce179c7277795e9f0f85bbd850c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RLDJIHXOVNV54Z4CALSLSW4223","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimising the reliability that can be claimed for a software-based system based on failure-free tests of its components","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Andrey Povyakalo, Peter Bishop","submitted_at":"2022-01-30T14:26:42Z","abstract_excerpt":"This short paper describes a numerical method for optimising the conservative confidence bound on the reliability of a system based on tests of its individual components. This is an alternative to the algorithmic approaches identified in Bishop and Povyakalo (RESS 2020). For a given maximum number of component tests, the numerical method can derive an optimal test plan for any arbitrary system structure.\n  The optimisation method is based on linear programming which is more efficient that the alternative integer programming. In addition, the optimisation process need only be performed once for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12829","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.12829/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-05T03:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3c3iy286M7C+LCa3iwacu4+9MaaDs+FSC8NDob1zqBV0PjiVJames8lbMTVL1a64BrPZXMGlbk6hLP2f92NCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:23:34.154751Z"},"content_sha256":"0121b7d892eef231cd162f745c418775fdf32c9d12569e2db3d5d8306fa58d70","schema_version":"1.0","event_id":"sha256:0121b7d892eef231cd162f745c418775fdf32c9d12569e2db3d5d8306fa58d70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLDJIHXOVNV54Z4CALSLSW4223/bundle.json","state_url":"https://pith.science/pith/RLDJIHXOVNV54Z4CALSLSW4223/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLDJIHXOVNV54Z4CALSLSW4223/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-01T07:23:34Z","links":{"resolver":"https://pith.science/pith/RLDJIHXOVNV54Z4CALSLSW4223","bundle":"https://pith.science/pith/RLDJIHXOVNV54Z4CALSLSW4223/bundle.json","state":"https://pith.science/pith/RLDJIHXOVNV54Z4CALSLSW4223/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLDJIHXOVNV54Z4CALSLSW4223/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RLDJIHXOVNV54Z4CALSLSW4223","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":"07105250678ba66a0b3bbf410aaacb13d23bb2d3c8e9a31ff4b836a63d7c8f6c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-01-30T14:26:42Z","title_canon_sha256":"a743ac40eeeb46623a3400060685ffa1ad00543867ee2cec9051acd81728a63d"},"schema_version":"1.0","source":{"id":"2201.12829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12829","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12829v1","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12829","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"RLDJIHXOVNV5","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"RLDJIHXOVNV54Z4C","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"RLDJIHXO","created_at":"2026-07-05T03:52:40Z"}],"graph_snapshots":[{"event_id":"sha256:0121b7d892eef231cd162f745c418775fdf32c9d12569e2db3d5d8306fa58d70","target":"graph","created_at":"2026-07-05T03:52:40Z","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/2201.12829/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This short paper describes a numerical method for optimising the conservative confidence bound on the reliability of a system based on tests of its individual components. This is an alternative to the algorithmic approaches identified in Bishop and Povyakalo (RESS 2020). For a given maximum number of component tests, the numerical method can derive an optimal test plan for any arbitrary system structure.\n  The optimisation method is based on linear programming which is more efficient that the alternative integer programming. In addition, the optimisation process need only be performed once for","authors_text":"Andrey Povyakalo, Peter Bishop","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-01-30T14:26:42Z","title":"Optimising the reliability that can be claimed for a software-based system based on failure-free tests of its components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12829","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:42923c98589cfd00899f0056bc4c9d4d38413ce179c7277795e9f0f85bbd850c","target":"record","created_at":"2026-07-05T03:52:40Z","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":"07105250678ba66a0b3bbf410aaacb13d23bb2d3c8e9a31ff4b836a63d7c8f6c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-01-30T14:26:42Z","title_canon_sha256":"a743ac40eeeb46623a3400060685ffa1ad00543867ee2cec9051acd81728a63d"},"schema_version":"1.0","source":{"id":"2201.12829","kind":"arxiv","version":1}},"canonical_sha256":"8ac6941eeeab6bde678202e4b95b9ad6cf5b84017f940c0a19f4c1148d60853e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ac6941eeeab6bde678202e4b95b9ad6cf5b84017f940c0a19f4c1148d60853e","first_computed_at":"2026-07-05T03:52:40.248085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:40.248085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yUNGIxLqtjS8cERUzzmiOY2hRjmYvmn5JffXbtq1qc3czpousVC0zX0X0Gj06a8+2lU0xev/nHson7c6t5OzCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:40.248510Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.12829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42923c98589cfd00899f0056bc4c9d4d38413ce179c7277795e9f0f85bbd850c","sha256:0121b7d892eef231cd162f745c418775fdf32c9d12569e2db3d5d8306fa58d70"],"state_sha256":"ab91d342009b350908a05623ebb6d0979d711ea4374ea78b6f78bbfc212bd21b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gith4cbWw2Fw8D1JsWRHr2x+32cI8cc26r9+VTspx8gVE7hQqy9cnYUh0kuvjMR0glRuqMafzB1gGjCjVLbsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T07:23:34.158883Z","bundle_sha256":"5a8c772adf8956f6d22293c77ee0f97b95914c4911be0c79722a7ddbb2ce585a"}}