{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X7ZHVHNAXZAEFQWXVF7AICN4QA","short_pith_number":"pith:X7ZHVHNA","schema_version":"1.0","canonical_sha256":"bff27a9da0be4042c2d7a97e0409bc800c3449bfde2adc58b3549a72cc2e1530","source":{"kind":"arxiv","id":"1408.1483","version":1},"attestation_state":"computed","paper":{"title":"Random Algorithms for the Loop Cutset Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Ann Becker, Dan Geiger, Reuven Bar-Yehuada","submitted_at":"2014-08-07T06:25:05Z","abstract_excerpt":"We show how to find a minimum loop cutset in a Bayesian network with high probability.  Finding such a loop cutset is the first step in Pearl's method of conditioning for inference.  Our random algorithm for finding a loop cutset, called \"Repeated WGuessI\", outputs a minimum loop cutset, after O(c 6^k k n) steps, with probability at least 1-(1 over{6^k})^{c 6^k}), where c>1 is a constant specified by the user, k is the size of a minimum weight loop cutset, and n is the number of vertices.  We also show empirically that a variant of this algorithm, called WRA, often finds a loop cutset that is "},"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":"1408.1483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T06:25:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"678a60adbc995f4efedcef3439180638ee9ce7f2407e4af3f6741df467643e38","abstract_canon_sha256":"eb6e2d58e9181c94a5d6860c9a67d84ea7158a69c57a3ad400f318b30069a140"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:40.382451Z","signature_b64":"8AQMebf3vgq+quWwtMG1LPmKyGfsru/UuA0tcOe0N4Oq//5mIuFyj0v0Qwxbj4guJ7SUOdX1HcVAhhqTAFz2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff27a9da0be4042c2d7a97e0409bc800c3449bfde2adc58b3549a72cc2e1530","last_reissued_at":"2026-05-18T02:45:40.381951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:40.381951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Algorithms for the Loop Cutset Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Ann Becker, Dan Geiger, Reuven Bar-Yehuada","submitted_at":"2014-08-07T06:25:05Z","abstract_excerpt":"We show how to find a minimum loop cutset in a Bayesian network with high probability.  Finding such a loop cutset is the first step in Pearl's method of conditioning for inference.  Our random algorithm for finding a loop cutset, called \"Repeated WGuessI\", outputs a minimum loop cutset, after O(c 6^k k n) steps, with probability at least 1-(1 over{6^k})^{c 6^k}), where c>1 is a constant specified by the user, k is the size of a minimum weight loop cutset, and n is the number of vertices.  We also show empirically that a variant of this algorithm, called WRA, often finds a loop cutset that is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1483","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":"1408.1483","created_at":"2026-05-18T02:45:40.382033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1483v1","created_at":"2026-05-18T02:45:40.382033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1483","created_at":"2026-05-18T02:45:40.382033+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7ZHVHNAXZAE","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7ZHVHNAXZAEFQWX","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7ZHVHNA","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/X7ZHVHNAXZAEFQWXVF7AICN4QA","json":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA.json","graph_json":"https://pith.science/api/pith-number/X7ZHVHNAXZAEFQWXVF7AICN4QA/graph.json","events_json":"https://pith.science/api/pith-number/X7ZHVHNAXZAEFQWXVF7AICN4QA/events.json","paper":"https://pith.science/paper/X7ZHVHNA"},"agent_actions":{"view_html":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA","download_json":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA.json","view_paper":"https://pith.science/paper/X7ZHVHNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1483&json=true","fetch_graph":"https://pith.science/api/pith-number/X7ZHVHNAXZAEFQWXVF7AICN4QA/graph.json","fetch_events":"https://pith.science/api/pith-number/X7ZHVHNAXZAEFQWXVF7AICN4QA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/action/storage_attestation","attest_author":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/action/author_attestation","sign_citation":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/action/citation_signature","submit_replication":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/action/replication_record"}},"created_at":"2026-05-18T02:45:40.382033+00:00","updated_at":"2026-05-18T02:45:40.382033+00:00"}