{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XAC4YKUKBTLAB6RCUIQB5AJMHT","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":"3aac924b9d54c7f28aea92d76455c37c113d47148d97123e33ef38f7fef59769","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-14T18:29:48Z","title_canon_sha256":"dd87b670c77cdc4dd7dd5967fc34e9044c8420e9370af71985f1f7aa20af92cf"},"schema_version":"1.0","source":{"id":"1404.3684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3684","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3684v1","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3684","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"pith_short_12","alias_value":"XAC4YKUKBTLA","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XAC4YKUKBTLAB6RC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XAC4YKUK","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:4522dfb99fc0ff2abbdedaf28350bd25c7962bbfa0e5e1fe6f4b654d7a766a7e","target":"graph","created_at":"2026-05-18T02:54:14Z","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":"Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \\subseteq V$ of \\emph{terminals}, a vector $p=(p_1,\\ldots,p_m) \\in [0,1]^m$ and a positive integer $d$, called \\emph{diameter}. We assume nodes are perfect but links fail stochastically and independently, with probabilities $q_i=1-p_i$. The \\emph{diameter-constrained reliability} (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by $d$ links, or less. This number is denoted by $R_{K,G}^{d}(p)$.\n  The general DCR computation is inside the class of $","authors_text":"Eduardo Canale, Pablo Romero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-14T18:29:48Z","title":"Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3684","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:fd143785b1395213b93b8c10af1535d9a35a9c0c9a6a12de80ae54b4fec1bd07","target":"record","created_at":"2026-05-18T02:54:14Z","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":"3aac924b9d54c7f28aea92d76455c37c113d47148d97123e33ef38f7fef59769","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-14T18:29:48Z","title_canon_sha256":"dd87b670c77cdc4dd7dd5967fc34e9044c8420e9370af71985f1f7aa20af92cf"},"schema_version":"1.0","source":{"id":"1404.3684","kind":"arxiv","version":1}},"canonical_sha256":"b805cc2a8a0cd600fa22a2201e812c3cfd2dbee4c643c3eb60c8ee0d475314ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b805cc2a8a0cd600fa22a2201e812c3cfd2dbee4c643c3eb60c8ee0d475314ce","first_computed_at":"2026-05-18T02:54:14.737170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:14.737170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yVm/edfF9vXLE5idMGOXOAPH7qtGK0SiAluLtLZlwypr6+0K21Q87MlQK1xbcbQcxsmef7BeK2xI+67JkLYjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:14.737618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd143785b1395213b93b8c10af1535d9a35a9c0c9a6a12de80ae54b4fec1bd07","sha256:4522dfb99fc0ff2abbdedaf28350bd25c7962bbfa0e5e1fe6f4b654d7a766a7e"],"state_sha256":"f4138e9b9eac4954ef94455add3bcb3238e8fec78b9694da6c0b0643ada72694"}