{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ULPXDETH5FK63GZJN7DA3NMUAC","short_pith_number":"pith:ULPXDETH","schema_version":"1.0","canonical_sha256":"a2df719267e955ed9b296fc60db59400b7591fce4fb245a7a47942bc8eac8f2b","source":{"kind":"arxiv","id":"1712.09666","version":1},"attestation_state":"computed","paper":{"title":"A Fast and Accurate Failure Frequency Approximation for $k$-Terminal Reliability Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Chanan Singh","submitted_at":"2017-12-27T20:05:35Z","abstract_excerpt":"This paper considers the problem of approximating the failure frequency of large-scale composite $k$-terminal reliability systems. In such systems, the nodes ($k$ of which are terminals) are connected through components which are subject to random failure and repair processes. At any time, a system failure occurs if the surviving system fails to connect all the k terminals together. We assume that each component's up-times and down-times follow statistically independent stationary random processes, and these processes are statistically independent across the components. In this setting, the ex"},"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":"1712.09666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-27T20:05:35Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8cb5b0ed9a8663bff8229feda825dbdac563fea1f4ecfdd96e72734c349e0592","abstract_canon_sha256":"0e6213ed4266a755e65763b56b7f29abb290be2eb6a9f3a6e07849a6941e8e7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:07.678024Z","signature_b64":"eBFEK2whHNbDz1WvB1sbFzug20pO6GQCX6BrMFNtvNG9vuxnmm0Kqn0OT6GrFTH/WzpbviDfUIJGCOsWp5rLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2df719267e955ed9b296fc60db59400b7591fce4fb245a7a47942bc8eac8f2b","last_reissued_at":"2026-05-18T00:27:07.677488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:07.677488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast and Accurate Failure Frequency Approximation for $k$-Terminal Reliability Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Chanan Singh","submitted_at":"2017-12-27T20:05:35Z","abstract_excerpt":"This paper considers the problem of approximating the failure frequency of large-scale composite $k$-terminal reliability systems. In such systems, the nodes ($k$ of which are terminals) are connected through components which are subject to random failure and repair processes. At any time, a system failure occurs if the surviving system fails to connect all the k terminals together. We assume that each component's up-times and down-times follow statistically independent stationary random processes, and these processes are statistically independent across the components. In this setting, the ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09666","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":"1712.09666","created_at":"2026-05-18T00:27:07.677595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09666v1","created_at":"2026-05-18T00:27:07.677595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09666","created_at":"2026-05-18T00:27:07.677595+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULPXDETH5FK6","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULPXDETH5FK63GZJ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULPXDETH","created_at":"2026-05-18T12:31:46.661854+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/ULPXDETH5FK63GZJN7DA3NMUAC","json":"https://pith.science/pith/ULPXDETH5FK63GZJN7DA3NMUAC.json","graph_json":"https://pith.science/api/pith-number/ULPXDETH5FK63GZJN7DA3NMUAC/graph.json","events_json":"https://pith.science/api/pith-number/ULPXDETH5FK63GZJN7DA3NMUAC/events.json","paper":"https://pith.science/paper/ULPXDETH"},"agent_actions":{"view_html":"https://pith.science/pith/ULPXDETH5FK63GZJN7DA3NMUAC","download_json":"https://pith.science/pith/ULPXDETH5FK63GZJN7DA3NMUAC.json","view_paper":"https://pith.science/paper/ULPXDETH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09666&json=true","fetch_graph":"https://pith.science/api/pith-number/ULPXDETH5FK63GZJN7DA3NMUAC/graph.json","fetch_events":"https://pith.science/api/pith-number/ULPXDETH5FK63GZJN7DA3NMUAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULPXDETH5FK63GZJN7DA3NMUAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULPXDETH5FK63GZJN7DA3NMUAC/action/storage_attestation","attest_author":"https://pith.science/pith/ULPXDETH5FK63GZJN7DA3NMUAC/action/author_attestation","sign_citation":"https://pith.science/pith/ULPXDETH5FK63GZJN7DA3NMUAC/action/citation_signature","submit_replication":"https://pith.science/pith/ULPXDETH5FK63GZJN7DA3NMUAC/action/replication_record"}},"created_at":"2026-05-18T00:27:07.677595+00:00","updated_at":"2026-05-18T00:27:07.677595+00:00"}