{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4CGQSFPLDK7PPV2P5G52BFKFOX","short_pith_number":"pith:4CGQSFPL","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"},"canonical_sha256":"e08d0915eb1abef7d74fe9bba0954575c3ab28bcb877bf0c1b91a2553538e4aa","source":{"kind":"arxiv","id":"1106.0225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0225","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0225v1","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0225","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"4CGQSFPLDK7P","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4CGQSFPLDK7PPV2P","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4CGQSFPL","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4CGQSFPLDK7PPV2P5G52BFKFOX","target":"record","payload":{"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"},"canonical_sha256":"e08d0915eb1abef7d74fe9bba0954575c3ab28bcb877bf0c1b91a2553538e4aa","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"},"source_kind":"arxiv","source_id":"1106.0225","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxSjLgba07k5OUREjlIeubZxEYzsNHaapUo3TRYgK/a79xCSSie0Fw2HA40qhiDTqSrnb5au6RZcmX8BQyIQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:30:32.558286Z"},"content_sha256":"9ea1b0dbbb45559d70da7b0a5884517a56c43071e5eff0ccb21d77263fe3e97f","schema_version":"1.0","event_id":"sha256:9ea1b0dbbb45559d70da7b0a5884517a56c43071e5eff0ccb21d77263fe3e97f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4CGQSFPLDK7PPV2P5G52BFKFOX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZQ8BY4hoOPRsSVMqdwioHAB+TZZuopdKW8N58biUH8Fr7NEowqc+1gjXYEYLT5X+JCBi6RmXE06WY72Ai9QBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:30:32.558803Z"},"content_sha256":"2d5cb03968e12545acf5222078acecbb6dcda19ec5ec871cd64fb09c40d72d4f","schema_version":"1.0","event_id":"sha256:2d5cb03968e12545acf5222078acecbb6dcda19ec5ec871cd64fb09c40d72d4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/bundle.json","state_url":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T14:30:32Z","links":{"resolver":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX","bundle":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/bundle.json","state":"https://pith.science/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CGQSFPLDK7PPV2P5G52BFKFOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4CGQSFPLDK7PPV2P5G52BFKFOX","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":"ff714db2414ca62b5a75d7a956abfe913115c6e44fdb8d767cd929e2fd4a6541","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:17:38Z","title_canon_sha256":"4459c9cf5bbef66c0b49376a4c2eae1990e73cc83164a468dad9cd6294cf6263"},"schema_version":"1.0","source":{"id":"1106.0225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0225","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0225v1","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0225","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"4CGQSFPLDK7P","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4CGQSFPLDK7PPV2P","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4CGQSFPL","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:2d5cb03968e12545acf5222078acecbb6dcda19ec5ec871cd64fb09c40d72d4f","target":"graph","created_at":"2026-05-18T04:20:51Z","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 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","authors_text":"A. Becker, D. Geiger, R. Bar-Yehuda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:17:38Z","title":"Randomized Algorithms for the Loop Cutset Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0225","kind":"arxiv","version":1},"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:9ea1b0dbbb45559d70da7b0a5884517a56c43071e5eff0ccb21d77263fe3e97f","target":"record","created_at":"2026-05-18T04:20:51Z","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":"ff714db2414ca62b5a75d7a956abfe913115c6e44fdb8d767cd929e2fd4a6541","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:17:38Z","title_canon_sha256":"4459c9cf5bbef66c0b49376a4c2eae1990e73cc83164a468dad9cd6294cf6263"},"schema_version":"1.0","source":{"id":"1106.0225","kind":"arxiv","version":1}},"canonical_sha256":"e08d0915eb1abef7d74fe9bba0954575c3ab28bcb877bf0c1b91a2553538e4aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e08d0915eb1abef7d74fe9bba0954575c3ab28bcb877bf0c1b91a2553538e4aa","first_computed_at":"2026-05-18T04:20:51.880785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:51.880785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Ehpbxrb0r9LwttWicXmC9/c7ZmWegLDsPTVOt+6CCleiS5mZUQVMqZ9Me7T6pqhQxJA8OUdXXZuB/54YVCqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:51.881428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ea1b0dbbb45559d70da7b0a5884517a56c43071e5eff0ccb21d77263fe3e97f","sha256:2d5cb03968e12545acf5222078acecbb6dcda19ec5ec871cd64fb09c40d72d4f"],"state_sha256":"15747bd5148f24f6d110ee525bddc6c4534f867a746d036aa66d99ad2dcc2c3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJOBjQy2m7zn0wlHLq5VN9tHhgZhK4E9wmzsBYF5ygG8T2RNdWwTox/3fjmdsmkcYaS6hXGIvoDeV1UVuVeWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:30:32.563557Z","bundle_sha256":"f5e84aaa97b00737012f3bbd6ace5344ba3ce23b744e73705b6b5eaaaab0cd37"}}