{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:F6JKR2PIDDRPRWRASPIXQ3AEM2","short_pith_number":"pith:F6JKR2PI","canonical_record":{"source":{"id":"1207.4127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:47:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8129274f6f6cb3757d5c5fde98b0860d4fcf5ee48eeb8a4878935ef249a44510","abstract_canon_sha256":"226b62ede74c53278e49aae9d38d8d523bc10be06017e1652f90177f07ebbe56"},"schema_version":"1.0"},"canonical_sha256":"2f92a8e9e818e2f8da2093d1786c0466ba30945fdd6cee0f465b62a1411960bd","source":{"kind":"arxiv","id":"1207.4127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4127","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4127v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4127","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"F6JKR2PIDDRP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F6JKR2PIDDRPRWRA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F6JKR2PI","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:F6JKR2PIDDRPRWRASPIXQ3AEM2","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:47:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8129274f6f6cb3757d5c5fde98b0860d4fcf5ee48eeb8a4878935ef249a44510","abstract_canon_sha256":"226b62ede74c53278e49aae9d38d8d523bc10be06017e1652f90177f07ebbe56"},"schema_version":"1.0"},"canonical_sha256":"2f92a8e9e818e2f8da2093d1786c0466ba30945fdd6cee0f465b62a1411960bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.851201Z","signature_b64":"ZcPYnl1vn8br947cRBhnYAfuvJIjslyZBIyn8571sbEM2hcOQfPZ3ClRyyXhSVlvZ/FFnsoZWkrSUe/aCRpyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f92a8e9e818e2f8da2093d1786c0466ba30945fdd6cee0f465b62a1411960bd","last_reissued_at":"2026-05-18T03:50:47.850524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.850524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4127","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-18T03:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxCL9eg61T+Weoxv4MCjSfTkVi54SAaYTGVKIiXkR10AG55zfN4tzyJGcRknemC2hYdJDIrXj/RzFuMBJzZnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:10:50.010395Z"},"content_sha256":"dfabdaead8b8d4cbd2363c3c6680cb6ffa01811e6062bd9da8d339bd2937162d","schema_version":"1.0","event_id":"sha256:dfabdaead8b8d4cbd2363c3c6680cb6ffa01811e6062bd9da8d339bd2937162d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:F6JKR2PIDDRPRWRASPIXQ3AEM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On finding minimal w-cutset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Bozhena Bidyuk, Rina Dechter","submitted_at":"2012-07-11T14:47:24Z","abstract_excerpt":"The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated variables are removed. If the assigned variables constitute a cycle-cutset, the rest of the network is singly-connected and therefore can be solved by linear propagation algorithms. A w-cutset is a generalization of a cycle-cutset defined as a subset of nodes such that the subgraph with cutset nodes removed has induced-width of w or less."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4127","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-18T03:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPoy4Y0yOCDS+ZN65vnxevjFC2hKsXgWFtBpWIikzQ6aOtGXbbSgSlWz8RMu1mNhHigAUKPo/3bpnmSl12cuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:10:50.010965Z"},"content_sha256":"ff2c2b8d7be73511ed429939e444622ccc06836bf45594b59b33675cb0dea00c","schema_version":"1.0","event_id":"sha256:ff2c2b8d7be73511ed429939e444622ccc06836bf45594b59b33675cb0dea00c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/bundle.json","state_url":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/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-31T03:10:50Z","links":{"resolver":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2","bundle":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/bundle.json","state":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F6JKR2PIDDRPRWRASPIXQ3AEM2","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":"226b62ede74c53278e49aae9d38d8d523bc10be06017e1652f90177f07ebbe56","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:47:24Z","title_canon_sha256":"8129274f6f6cb3757d5c5fde98b0860d4fcf5ee48eeb8a4878935ef249a44510"},"schema_version":"1.0","source":{"id":"1207.4127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4127","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4127v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4127","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"F6JKR2PIDDRP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F6JKR2PIDDRPRWRA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F6JKR2PI","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:ff2c2b8d7be73511ed429939e444622ccc06836bf45594b59b33675cb0dea00c","target":"graph","created_at":"2026-05-18T03:50:47Z","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":"The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated variables are removed. If the assigned variables constitute a cycle-cutset, the rest of the network is singly-connected and therefore can be solved by linear propagation algorithms. A w-cutset is a generalization of a cycle-cutset defined as a subset of nodes such that the subgraph with cutset nodes removed has induced-width of w or less.","authors_text":"Bozhena Bidyuk, Rina Dechter","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:47:24Z","title":"On finding minimal w-cutset"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4127","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:dfabdaead8b8d4cbd2363c3c6680cb6ffa01811e6062bd9da8d339bd2937162d","target":"record","created_at":"2026-05-18T03:50:47Z","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":"226b62ede74c53278e49aae9d38d8d523bc10be06017e1652f90177f07ebbe56","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:47:24Z","title_canon_sha256":"8129274f6f6cb3757d5c5fde98b0860d4fcf5ee48eeb8a4878935ef249a44510"},"schema_version":"1.0","source":{"id":"1207.4127","kind":"arxiv","version":1}},"canonical_sha256":"2f92a8e9e818e2f8da2093d1786c0466ba30945fdd6cee0f465b62a1411960bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f92a8e9e818e2f8da2093d1786c0466ba30945fdd6cee0f465b62a1411960bd","first_computed_at":"2026-05-18T03:50:47.850524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:47.850524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZcPYnl1vn8br947cRBhnYAfuvJIjslyZBIyn8571sbEM2hcOQfPZ3ClRyyXhSVlvZ/FFnsoZWkrSUe/aCRpyDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:47.851201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfabdaead8b8d4cbd2363c3c6680cb6ffa01811e6062bd9da8d339bd2937162d","sha256:ff2c2b8d7be73511ed429939e444622ccc06836bf45594b59b33675cb0dea00c"],"state_sha256":"5c5ba4f6f0de551c9917e3d4147d61c396eee6aa02c0383b3886e73d4d1016ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8fFTJvwfsutKdq57OFqIUfScqoZsmgCOPsR+5MmoDv0TLaHcnQvvFhqSA9yviHbf4F0vF7bAm/ToXVQyauu+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:10:50.013433Z","bundle_sha256":"eece661784ec7939311e965a01f4591910e589d951071c89243d3cca8dc78d01"}}