{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OTF232KKUNTEUJRHPYJ5AMSIQX","short_pith_number":"pith:OTF232KK","schema_version":"1.0","canonical_sha256":"74cbade94aa3664a26277e13d0324885fb277143931856c45e45fcaa46b79609","source":{"kind":"arxiv","id":"1806.00917","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.00917","created_at":"2026-05-17T23:47:12.644556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00917v2","created_at":"2026-05-17T23:47:12.644556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00917","created_at":"2026-05-17T23:47:12.644556+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTF232KKUNTE","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTF232KKUNTEUJRH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTF232KK","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX","json":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX.json","graph_json":"https://pith.science/api/pith-number/OTF232KKUNTEUJRHPYJ5AMSIQX/graph.json","events_json":"https://pith.science/api/pith-number/OTF232KKUNTEUJRHPYJ5AMSIQX/events.json","paper":"https://pith.science/paper/OTF232KK"},"agent_actions":{"view_html":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX","download_json":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX.json","view_paper":"https://pith.science/paper/OTF232KK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00917&json=true","fetch_graph":"https://pith.science/api/pith-number/OTF232KKUNTEUJRHPYJ5AMSIQX/graph.json","fetch_events":"https://pith.science/api/pith-number/OTF232KKUNTEUJRHPYJ5AMSIQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/action/storage_attestation","attest_author":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/action/author_attestation","sign_citation":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/action/citation_signature","submit_replication":"https://pith.science/pith/OTF232KKUNTEUJRHPYJ5AMSIQX/action/replication_record"}},"created_at":"2026-05-17T23:47:12.644556+00:00","updated_at":"2026-05-17T23:47:12.644556+00:00"}