{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:F6JKR2PIDDRPRWRASPIXQ3AEM2","short_pith_number":"pith:F6JKR2PI","schema_version":"1.0","canonical_sha256":"2f92a8e9e818e2f8da2093d1786c0466ba30945fdd6cee0f465b62a1411960bd","source":{"kind":"arxiv","id":"1207.4127","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.4127","created_at":"2026-05-18T03:50:47.850620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4127v1","created_at":"2026-05-18T03:50:47.850620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4127","created_at":"2026-05-18T03:50:47.850620+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6JKR2PIDDRP","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6JKR2PIDDRPRWRA","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6JKR2PI","created_at":"2026-05-18T12:27:04.183437+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/F6JKR2PIDDRPRWRASPIXQ3AEM2","json":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2.json","graph_json":"https://pith.science/api/pith-number/F6JKR2PIDDRPRWRASPIXQ3AEM2/graph.json","events_json":"https://pith.science/api/pith-number/F6JKR2PIDDRPRWRASPIXQ3AEM2/events.json","paper":"https://pith.science/paper/F6JKR2PI"},"agent_actions":{"view_html":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2","download_json":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2.json","view_paper":"https://pith.science/paper/F6JKR2PI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4127&json=true","fetch_graph":"https://pith.science/api/pith-number/F6JKR2PIDDRPRWRASPIXQ3AEM2/graph.json","fetch_events":"https://pith.science/api/pith-number/F6JKR2PIDDRPRWRASPIXQ3AEM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/action/storage_attestation","attest_author":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/action/author_attestation","sign_citation":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/action/citation_signature","submit_replication":"https://pith.science/pith/F6JKR2PIDDRPRWRASPIXQ3AEM2/action/replication_record"}},"created_at":"2026-05-18T03:50:47.850620+00:00","updated_at":"2026-05-18T03:50:47.850620+00:00"}