{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XAC4YKUKBTLAB6RCUIQB5AJMHT","short_pith_number":"pith:XAC4YKUK","schema_version":"1.0","canonical_sha256":"b805cc2a8a0cd600fa22a2201e812c3cfd2dbee4c643c3eb60c8ee0d475314ce","source":{"kind":"arxiv","id":"1404.3684","version":1},"attestation_state":"computed","paper":{"title":"Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eduardo Canale, Pablo Romero","submitted_at":"2014-04-14T18:29:48Z","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 $"},"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":"1404.3684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-14T18:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"dd87b670c77cdc4dd7dd5967fc34e9044c8420e9370af71985f1f7aa20af92cf","abstract_canon_sha256":"3aac924b9d54c7f28aea92d76455c37c113d47148d97123e33ef38f7fef59769"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:14.737618Z","signature_b64":"yVm/edfF9vXLE5idMGOXOAPH7qtGK0SiAluLtLZlwypr6+0K21Q87MlQK1xbcbQcxsmef7BeK2xI+67JkLYjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b805cc2a8a0cd600fa22a2201e812c3cfd2dbee4c643c3eb60c8ee0d475314ce","last_reissued_at":"2026-05-18T02:54:14.737170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:14.737170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eduardo Canale, Pablo Romero","submitted_at":"2014-04-14T18:29:48Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3684","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":""},"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":"1404.3684","created_at":"2026-05-18T02:54:14.737239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3684v1","created_at":"2026-05-18T02:54:14.737239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3684","created_at":"2026-05-18T02:54:14.737239+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAC4YKUKBTLA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAC4YKUKBTLAB6RC","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAC4YKUK","created_at":"2026-05-18T12:28:57.508820+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/XAC4YKUKBTLAB6RCUIQB5AJMHT","json":"https://pith.science/pith/XAC4YKUKBTLAB6RCUIQB5AJMHT.json","graph_json":"https://pith.science/api/pith-number/XAC4YKUKBTLAB6RCUIQB5AJMHT/graph.json","events_json":"https://pith.science/api/pith-number/XAC4YKUKBTLAB6RCUIQB5AJMHT/events.json","paper":"https://pith.science/paper/XAC4YKUK"},"agent_actions":{"view_html":"https://pith.science/pith/XAC4YKUKBTLAB6RCUIQB5AJMHT","download_json":"https://pith.science/pith/XAC4YKUKBTLAB6RCUIQB5AJMHT.json","view_paper":"https://pith.science/paper/XAC4YKUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3684&json=true","fetch_graph":"https://pith.science/api/pith-number/XAC4YKUKBTLAB6RCUIQB5AJMHT/graph.json","fetch_events":"https://pith.science/api/pith-number/XAC4YKUKBTLAB6RCUIQB5AJMHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAC4YKUKBTLAB6RCUIQB5AJMHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAC4YKUKBTLAB6RCUIQB5AJMHT/action/storage_attestation","attest_author":"https://pith.science/pith/XAC4YKUKBTLAB6RCUIQB5AJMHT/action/author_attestation","sign_citation":"https://pith.science/pith/XAC4YKUKBTLAB6RCUIQB5AJMHT/action/citation_signature","submit_replication":"https://pith.science/pith/XAC4YKUKBTLAB6RCUIQB5AJMHT/action/replication_record"}},"created_at":"2026-05-18T02:54:14.737239+00:00","updated_at":"2026-05-18T02:54:14.737239+00:00"}