{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:X7ZHVHNAXZAEFQWXVF7AICN4QA","short_pith_number":"pith:X7ZHVHNA","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"},"canonical_sha256":"bff27a9da0be4042c2d7a97e0409bc800c3449bfde2adc58b3549a72cc2e1530","source":{"kind":"arxiv","id":"1408.1483","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1483","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1483v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1483","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"X7ZHVHNAXZAE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X7ZHVHNAXZAEFQWX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X7ZHVHNA","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:X7ZHVHNAXZAEFQWXVF7AICN4QA","target":"record","payload":{"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"},"canonical_sha256":"bff27a9da0be4042c2d7a97e0409bc800c3449bfde2adc58b3549a72cc2e1530","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"},"source_kind":"arxiv","source_id":"1408.1483","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-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQHhuABCrr0dD2ogYNWOpq1hM0ALPPIm5vchEGVK/ePH6YUu++SD+Us0tJ8VUgXdpwe/XulLrRZ0YmMnVLLrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:11:30.335387Z"},"content_sha256":"4fa4f2a8d8c2140f610cddf420e7f2862f958579650c5b861708b96a5ff4e7dd","schema_version":"1.0","event_id":"sha256:4fa4f2a8d8c2140f610cddf420e7f2862f958579650c5b861708b96a5ff4e7dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:X7ZHVHNAXZAEFQWXVF7AICN4QA","target":"graph","payload":{"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"},"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-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RI1B0sZp3rJURSdYypywfoCVIj8govOlSzAWivBc9iuCw5e42XCwmZRDa/GRfFGAR8JDMVdCGrXg8/4ARRfSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:11:30.335740Z"},"content_sha256":"f3058435abdfc276b8709213072ba81ff59a6ecfcdba98b8e9f01903938dd3c3","schema_version":"1.0","event_id":"sha256:f3058435abdfc276b8709213072ba81ff59a6ecfcdba98b8e9f01903938dd3c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/bundle.json","state_url":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/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-06-01T07:11:30Z","links":{"resolver":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA","bundle":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/bundle.json","state":"https://pith.science/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7ZHVHNAXZAEFQWXVF7AICN4QA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:X7ZHVHNAXZAEFQWXVF7AICN4QA","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":"eb6e2d58e9181c94a5d6860c9a67d84ea7158a69c57a3ad400f318b30069a140","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T06:25:05Z","title_canon_sha256":"678a60adbc995f4efedcef3439180638ee9ce7f2407e4af3f6741df467643e38"},"schema_version":"1.0","source":{"id":"1408.1483","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1483","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1483v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1483","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"X7ZHVHNAXZAE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X7ZHVHNAXZAEFQWX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X7ZHVHNA","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:f3058435abdfc276b8709213072ba81ff59a6ecfcdba98b8e9f01903938dd3c3","target":"graph","created_at":"2026-05-18T02:45:40Z","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 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 ","authors_text":"Ann Becker, Dan Geiger, Reuven Bar-Yehuada","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T06:25:05Z","title":"Random Algorithms for the Loop Cutset Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1483","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:4fa4f2a8d8c2140f610cddf420e7f2862f958579650c5b861708b96a5ff4e7dd","target":"record","created_at":"2026-05-18T02:45:40Z","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":"eb6e2d58e9181c94a5d6860c9a67d84ea7158a69c57a3ad400f318b30069a140","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T06:25:05Z","title_canon_sha256":"678a60adbc995f4efedcef3439180638ee9ce7f2407e4af3f6741df467643e38"},"schema_version":"1.0","source":{"id":"1408.1483","kind":"arxiv","version":1}},"canonical_sha256":"bff27a9da0be4042c2d7a97e0409bc800c3449bfde2adc58b3549a72cc2e1530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bff27a9da0be4042c2d7a97e0409bc800c3449bfde2adc58b3549a72cc2e1530","first_computed_at":"2026-05-18T02:45:40.381951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:40.381951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8AQMebf3vgq+quWwtMG1LPmKyGfsru/UuA0tcOe0N4Oq//5mIuFyj0v0Qwxbj4guJ7SUOdX1HcVAhhqTAFz2CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:40.382451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1483","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fa4f2a8d8c2140f610cddf420e7f2862f958579650c5b861708b96a5ff4e7dd","sha256:f3058435abdfc276b8709213072ba81ff59a6ecfcdba98b8e9f01903938dd3c3"],"state_sha256":"5ab4fac0d37aaf0f57b3540fd985f11f91d58364a10d2cbc4002c4dc2ff9983c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5J52HbrPwXyhZt6MbizLwEL4sgYZPjai9yBq2z2POLzHCu+LC7CeHZGpZA9OR/EHDFOBAKF0tK98cdtOiNl6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:11:30.337640Z","bundle_sha256":"245535a53deedbe940bee74b36fd0c3f785e8b576c6fd7d42776e627e8c42974"}}