{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4CGQSFPLDK7PPV2P5G52BFKFOX","short_pith_number":"pith:4CGQSFPL","schema_version":"1.0","canonical_sha256":"e08d0915eb1abef7d74fe9bba0954575c3ab28bcb877bf0c1b91a2553538e4aa","source":{"kind":"arxiv","id":"1106.0225","version":1},"attestation_state":"computed","paper":{"title":"Randomized Algorithms for the Loop Cutset Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"A. Becker, D. Geiger, R. Bar-Yehuda","submitted_at":"2011-06-01T16:17:38Z","abstract_excerpt":"We show how to find a minimum weight loop cutset in a    Bayesian network with high probability. Finding such a loop cutset is    the first step in the method of conditioning for inference.  Our    randomized algorithm for finding a loop cutset outputs a minimum loop    cutset after O(c 6^k kn) steps with probability at least     1 - (1 - 1/(6^k))^c6^k, where c > 1 is a constant specified by the    user, k is the minimal size of a minimum weight loop cutset, and n is    the number of vertices.  We also show empirically that a variant of    this algorithm often finds a loop cutset that is close"},"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":"1106.0225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"4459c9cf5bbef66c0b49376a4c2eae1990e73cc83164a468dad9cd6294cf6263","abstract_canon_sha256":"ff714db2414ca62b5a75d7a956abfe913115c6e44fdb8d767cd929e2fd4a6541"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:51.881428Z","signature_b64":"1Ehpbxrb0r9LwttWicXmC9/c7ZmWegLDsPTVOt+6CCleiS5mZUQVMqZ9Me7T6pqhQxJA8OUdXXZuB/54YVCqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e08d0915eb1abef7d74fe9bba0954575c3ab28bcb877bf0c1b91a2553538e4aa","last_reissued_at":"2026-05-18T04:20:51.880785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:51.880785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Algorithms for the Loop Cutset Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"A. Becker, D. Geiger, R. Bar-Yehuda","submitted_at":"2011-06-01T16:17:38Z","abstract_excerpt":"We show how to find a minimum weight loop cutset in a    Bayesian network with high probability. Finding such a loop cutset is    the first step in the method of conditioning for inference.  Our    randomized algorithm for finding a loop cutset outputs a minimum loop    cutset after O(c 6^k kn) steps with probability at least     1 - (1 - 1/(6^k))^c6^k, where c > 1 is a constant specified by the    user, k is the minimal size of a minimum weight loop cutset, and n is    the number of vertices.  We also show empirically that a variant of    this algorithm often finds a loop cutset that is close"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0225","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":"1106.0225","created_at":"2026-05-18T04:20:51.880871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.0225v1","created_at":"2026-05-18T04:20:51.880871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0225","created_at":"2026-05-18T04:20:51.880871+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CGQSFPLDK7P","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CGQSFPLDK7PPV2P","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CGQSFPL","created_at":"2026-05-18T12:26:20.644004+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/4CGQSFPLDK7PPV2P5G52BFKFOX","json":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX.json","graph_json":"https://pith.science/api/pith-number/4CGQSFPLDK7PPV2P5G52BFKFOX/graph.json","events_json":"https://pith.science/api/pith-number/4CGQSFPLDK7PPV2P5G52BFKFOX/events.json","paper":"https://pith.science/paper/4CGQSFPL"},"agent_actions":{"view_html":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX","download_json":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX.json","view_paper":"https://pith.science/paper/4CGQSFPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.0225&json=true","fetch_graph":"https://pith.science/api/pith-number/4CGQSFPLDK7PPV2P5G52BFKFOX/graph.json","fetch_events":"https://pith.science/api/pith-number/4CGQSFPLDK7PPV2P5G52BFKFOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/action/storage_attestation","attest_author":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/action/author_attestation","sign_citation":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/action/citation_signature","submit_replication":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/action/replication_record"}},"created_at":"2026-05-18T04:20:51.880871+00:00","updated_at":"2026-05-18T04:20:51.880871+00:00"}