{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QJ2EJ3ECGBPR26BDIQLWMC6KTL","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":"ee153edf24d1ef5af2b9ca88f80246a382e2b401308adb8bf08e6ba66409e4c2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-01T10:45:09Z","title_canon_sha256":"74fb9f0e61cb47266a90745dc442d52a4dd01c28bd499b7c3397692f7412ae16"},"schema_version":"1.0","source":{"id":"1410.0707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0707","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0707v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0707","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"QJ2EJ3ECGBPR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJ2EJ3ECGBPR26BD","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJ2EJ3EC","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:2bdfcb56cd130e419825f4df74cfad76353f3cf505f6eff5391d108761ec575c","target":"graph","created_at":"2026-05-18T02:41:09Z","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":"In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is to find the probability that the resulting random graph is connected, called \\emph{reliability}. Although the exact reliability computation belongs to the class of $\\mathcal{NP}$-Hard problems, the literature offers three exact methods for exact reliability computation, to know, Sum of Disjoint Products (SDPs), Inclusion-Exclusion and Factorization.\n  Inspired in delay-sensitive applications in telecommunications, H","authors_text":"Eduardo Canale, Gerardo Rubino, Pablo Romero","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-01T10:45:09Z","title":"A Full Characterization of Irrelevant Components in Diameter Constrained Reliability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0707","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:f68aa14e84218ca4b357cfa820c7b4fe7fa57a4c0fbc38a365c04893615adae9","target":"record","created_at":"2026-05-18T02:41:09Z","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":"ee153edf24d1ef5af2b9ca88f80246a382e2b401308adb8bf08e6ba66409e4c2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-01T10:45:09Z","title_canon_sha256":"74fb9f0e61cb47266a90745dc442d52a4dd01c28bd499b7c3397692f7412ae16"},"schema_version":"1.0","source":{"id":"1410.0707","kind":"arxiv","version":1}},"canonical_sha256":"827444ec82305f1d78234417660bca9adc31bd4cc5cf285e78b78602d9903d29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"827444ec82305f1d78234417660bca9adc31bd4cc5cf285e78b78602d9903d29","first_computed_at":"2026-05-18T02:41:09.814241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:09.814241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+T92oDiGQlIWcaBAzvIX5zUyHH+Xz6OmzjoNGr/LrrEjjaWSIZV5EwV3+hZ+648/dcI0tdw0OyN/d6UWbzRoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:09.814677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f68aa14e84218ca4b357cfa820c7b4fe7fa57a4c0fbc38a365c04893615adae9","sha256:2bdfcb56cd130e419825f4df74cfad76353f3cf505f6eff5391d108761ec575c"],"state_sha256":"1f4506a096adf8ba498a5e90de77f45ce968f2f3aec4bde777fdf3b5b2eb8faf"}