{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TM25MQAPL5L6AUTKRDM52WPRMJ","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":"4e0b4a6bc0878320e12748b82e5cc88b8c8afa1990ea3732946c6fa1b020a171","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-27T21:39:47Z","title_canon_sha256":"87751fdb09e59107919f5ace58d07567314c8783ac81cfd744e85621bb69f371"},"schema_version":"1.0","source":{"id":"1712.09692","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09692","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09692v3","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09692","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"TM25MQAPL5L6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TM25MQAPL5L6AUTK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TM25MQAP","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:f8af231b665b6d6a34275b8f36707e6c0bff1e352f00537f55016a2f4b928270","target":"graph","created_at":"2026-05-17T23:51:00Z","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":"We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge appears in the network with its associated probability and the problem is to determine the probability of having at least one source-to-target path. This problem is known to be NP-hard.\n  We present a linear-time fixed-parameter algorithm based on a parameter called treewidth, which is a measure of tree-likeness of graphs. Network Reliability was already known to be solvable in polynomial time for bound","authors_text":"Amir Kafshdar Goharshady, Fatemeh Mohammadi","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-27T21:39:47Z","title":"An Efficient Algorithm for Computing Network Reliability in Small Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09692","kind":"arxiv","version":3},"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:086eef7a5a2f756e88ffe4a07bb7b355e66e1c7defb29dbc41d082067505e831","target":"record","created_at":"2026-05-17T23:51:00Z","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":"4e0b4a6bc0878320e12748b82e5cc88b8c8afa1990ea3732946c6fa1b020a171","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-27T21:39:47Z","title_canon_sha256":"87751fdb09e59107919f5ace58d07567314c8783ac81cfd744e85621bb69f371"},"schema_version":"1.0","source":{"id":"1712.09692","kind":"arxiv","version":3}},"canonical_sha256":"9b35d6400f5f57e0526a88d9dd59f16247d71183e756050d49ff85ebcfeb224d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b35d6400f5f57e0526a88d9dd59f16247d71183e756050d49ff85ebcfeb224d","first_computed_at":"2026-05-17T23:51:00.002787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:00.002787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"phPEyBc0FMITtlXSyRDLU7qsatQ7yplfXrRldmYfLBc8XCELPrghbBIZ6hi3PCfYKfWaoSNG4AodZC/arGs1DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:00.003543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09692","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:086eef7a5a2f756e88ffe4a07bb7b355e66e1c7defb29dbc41d082067505e831","sha256:f8af231b665b6d6a34275b8f36707e6c0bff1e352f00537f55016a2f4b928270"],"state_sha256":"e75be8534d1489361553cdfb0456399d9a5b77ea024e92d21a8740d8583ef755"}