{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OTF232KKUNTEUJRHPYJ5AMSIQX","short_pith_number":"pith:OTF232KK","canonical_record":{"source":{"id":"1806.00917","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-04T01:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"ee32a0a4b7796fcb079fd7e718756906cfc53d3013c4f9682daaa9e6b6163e5c","abstract_canon_sha256":"7c5d0a0d4d0b8be205def94f92c09625fd92b6bce49e437a09db2de69a8491d6"},"schema_version":"1.0"},"canonical_sha256":"74cbade94aa3664a26277e13d0324885fb277143931856c45e45fcaa46b79609","source":{"kind":"arxiv","id":"1806.00917","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00917","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00917v2","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00917","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"OTF232KKUNTE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTF232KKUNTEUJRH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTF232KK","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OTF232KKUNTEUJRHPYJ5AMSIQX","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00917","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-04T01:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"ee32a0a4b7796fcb079fd7e718756906cfc53d3013c4f9682daaa9e6b6163e5c","abstract_canon_sha256":"7c5d0a0d4d0b8be205def94f92c09625fd92b6bce49e437a09db2de69a8491d6"},"schema_version":"1.0"},"canonical_sha256":"74cbade94aa3664a26277e13d0324885fb277143931856c45e45fcaa46b79609","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.644873Z","signature_b64":"mKVfbq+ne+iqOVJdzeTZYOD7R8alSoNXtU595xrx/BTK2GYK9E35IHqXLblq/IhPWCsLvMEb4WexhpaXTO09Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74cbade94aa3664a26277e13d0324885fb277143931856c45e45fcaa46b79609","last_reissued_at":"2026-05-17T23:47:12.644493Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.644493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00917","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-05-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGTu5QX0fK435qKidmegHmqibCuG81J5e4TX5nq5oMwyWgsRnLtEKZjjZyzqOoQVKPESbl0Um4aqs6AOrN8sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:42:17.281811Z"},"content_sha256":"1e53d6415c213e98ba424890d3bc291a4d7e594335ab68b1ddee1dcc584a732d","schema_version":"1.0","event_id":"sha256:1e53d6415c213e98ba424890d3bc291a4d7e594335ab68b1ddee1dcc584a732d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OTF232KKUNTEUJRHPYJ5AMSIQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Principled Network Reliability Approximation: A Counting-Based Approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"K.S. Meel, L. Duenas-Osorio, M.Y. Vardi, R. Paredes","submitted_at":"2018-06-04T01:43:31Z","abstract_excerpt":"As engineered systems expand, become more interdependent, and operate in real-time, reliability assessment is indispensable to support investment and decision making. However, network reliability problems are known to be #P-complete, a computational complexity class largely believed to be intractable. The computational intractability of network reliability motivates our quest for reliable approximations. Based on their theoretical foundations, available methods can be grouped as follows: (i) exact or bounds, (ii) guarantee-less sampling, and (iii) probably approximately correct (PAC). Group (i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00917","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":""},"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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTyhWybobjJ0fYpuVS3FgS7EBQvlIkEml8Jy+E1esjvgHsnULw/3qpy+E+kCQV4lesRnv5ZM24EPE9KTW31nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:42:17.282161Z"},"content_sha256":"7b669b07ab7d90243e854c3247f43b49b09155dce8beaf649e3e10c30384cb64","schema_version":"1.0","event_id":"sha256:7b669b07ab7d90243e854c3247f43b49b09155dce8beaf649e3e10c30384cb64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/bundle.json","state_url":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/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-22T10:42:17Z","links":{"resolver":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX","bundle":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/bundle.json","state":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OTF232KKUNTEUJRHPYJ5AMSIQX","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":"7c5d0a0d4d0b8be205def94f92c09625fd92b6bce49e437a09db2de69a8491d6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-04T01:43:31Z","title_canon_sha256":"ee32a0a4b7796fcb079fd7e718756906cfc53d3013c4f9682daaa9e6b6163e5c"},"schema_version":"1.0","source":{"id":"1806.00917","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00917","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00917v2","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00917","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"OTF232KKUNTE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTF232KKUNTEUJRH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTF232KK","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:7b669b07ab7d90243e854c3247f43b49b09155dce8beaf649e3e10c30384cb64","target":"graph","created_at":"2026-05-17T23:47:12Z","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":"As engineered systems expand, become more interdependent, and operate in real-time, reliability assessment is indispensable to support investment and decision making. However, network reliability problems are known to be #P-complete, a computational complexity class largely believed to be intractable. The computational intractability of network reliability motivates our quest for reliable approximations. Based on their theoretical foundations, available methods can be grouped as follows: (i) exact or bounds, (ii) guarantee-less sampling, and (iii) probably approximately correct (PAC). Group (i","authors_text":"K.S. Meel, L. Duenas-Osorio, M.Y. Vardi, R. Paredes","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-04T01:43:31Z","title":"Principled Network Reliability Approximation: A Counting-Based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00917","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:1e53d6415c213e98ba424890d3bc291a4d7e594335ab68b1ddee1dcc584a732d","target":"record","created_at":"2026-05-17T23:47:12Z","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":"7c5d0a0d4d0b8be205def94f92c09625fd92b6bce49e437a09db2de69a8491d6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-04T01:43:31Z","title_canon_sha256":"ee32a0a4b7796fcb079fd7e718756906cfc53d3013c4f9682daaa9e6b6163e5c"},"schema_version":"1.0","source":{"id":"1806.00917","kind":"arxiv","version":2}},"canonical_sha256":"74cbade94aa3664a26277e13d0324885fb277143931856c45e45fcaa46b79609","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74cbade94aa3664a26277e13d0324885fb277143931856c45e45fcaa46b79609","first_computed_at":"2026-05-17T23:47:12.644493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:12.644493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mKVfbq+ne+iqOVJdzeTZYOD7R8alSoNXtU595xrx/BTK2GYK9E35IHqXLblq/IhPWCsLvMEb4WexhpaXTO09Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:12.644873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00917","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e53d6415c213e98ba424890d3bc291a4d7e594335ab68b1ddee1dcc584a732d","sha256:7b669b07ab7d90243e854c3247f43b49b09155dce8beaf649e3e10c30384cb64"],"state_sha256":"8f2b7149be20747ed1e1d4a6078b8a9398e2f549c55bdd12157dd29f5ead3d22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+YP6YAvSVsXBoxtx9ldwU+wPntUzKtmeubwmh6AYqKboUv2DYLVt2efywF0ppCaj1UPgZyOP5b6uSPm7pH9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:42:17.284403Z","bundle_sha256":"f274bc41a847ae9bb1ea4459d439248cb9499e5b08bb6c60cb3befba4da40157"}}