{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I35NDHJPU3SMTMNH5AAZWVIJ6Q","short_pith_number":"pith:I35NDHJP","schema_version":"1.0","canonical_sha256":"46fad19d2fa6e4c9b1a7e8019b5509f414487e9f20b2de529ab0473b11251f3c","source":{"kind":"arxiv","id":"1302.4421","version":4},"attestation_state":"computed","paper":{"title":"Towards a theory of good SAT representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Matthew Gwynne, Oliver Kullmann","submitted_at":"2013-02-18T20:40:06Z","abstract_excerpt":"We aim at providing a foundation of a theory of \"good\" SAT representations F of boolean functions f. We argue that the hierarchy UC_k of unit-refutation complete clause-sets of level k, introduced by the authors, provides the most basic target classes, that is, F in UC_k is to be achieved for k as small as feasible. If F does not contain new variables, i.e., F is equivalent (as a CNF) to f, then F in UC_1 is similar to \"achieving (generalised) arc consistency\" known from the literature (it is somewhat weaker, but theoretically much nicer to handle). We show that for polysize representations of"},"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":"1302.4421","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-18T20:40:06Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"715785c5f377a035a2c82681226a0d6ffdf7bcea3844f64e98bdac9bfa537428","abstract_canon_sha256":"f0f3f6cf3adec9254fdaaf036336a6db382260c4f6ce7b52af2ca4777d3e6a6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:00.271282Z","signature_b64":"Qi750IdHK1suCXMJrBjI+n774nD9loH/3vuUrGSDJnuA1yWEXwk/wKtmJl70RbmhbYbG/6PFjRrnhuc5n3ePCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46fad19d2fa6e4c9b1a7e8019b5509f414487e9f20b2de529ab0473b11251f3c","last_reissued_at":"2026-05-18T03:26:00.270717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:00.270717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a theory of good SAT representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Matthew Gwynne, Oliver Kullmann","submitted_at":"2013-02-18T20:40:06Z","abstract_excerpt":"We aim at providing a foundation of a theory of \"good\" SAT representations F of boolean functions f. We argue that the hierarchy UC_k of unit-refutation complete clause-sets of level k, introduced by the authors, provides the most basic target classes, that is, F in UC_k is to be achieved for k as small as feasible. If F does not contain new variables, i.e., F is equivalent (as a CNF) to f, then F in UC_1 is similar to \"achieving (generalised) arc consistency\" known from the literature (it is somewhat weaker, but theoretically much nicer to handle). We show that for polysize representations of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4421","kind":"arxiv","version":4},"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":"1302.4421","created_at":"2026-05-18T03:26:00.270810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4421v4","created_at":"2026-05-18T03:26:00.270810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4421","created_at":"2026-05-18T03:26:00.270810+00:00"},{"alias_kind":"pith_short_12","alias_value":"I35NDHJPU3SM","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I35NDHJPU3SMTMNH","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I35NDHJP","created_at":"2026-05-18T12:27:46.883200+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/I35NDHJPU3SMTMNH5AAZWVIJ6Q","json":"https://pith.science/pith/I35NDHJPU3SMTMNH5AAZWVIJ6Q.json","graph_json":"https://pith.science/api/pith-number/I35NDHJPU3SMTMNH5AAZWVIJ6Q/graph.json","events_json":"https://pith.science/api/pith-number/I35NDHJPU3SMTMNH5AAZWVIJ6Q/events.json","paper":"https://pith.science/paper/I35NDHJP"},"agent_actions":{"view_html":"https://pith.science/pith/I35NDHJPU3SMTMNH5AAZWVIJ6Q","download_json":"https://pith.science/pith/I35NDHJPU3SMTMNH5AAZWVIJ6Q.json","view_paper":"https://pith.science/paper/I35NDHJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4421&json=true","fetch_graph":"https://pith.science/api/pith-number/I35NDHJPU3SMTMNH5AAZWVIJ6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/I35NDHJPU3SMTMNH5AAZWVIJ6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I35NDHJPU3SMTMNH5AAZWVIJ6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I35NDHJPU3SMTMNH5AAZWVIJ6Q/action/storage_attestation","attest_author":"https://pith.science/pith/I35NDHJPU3SMTMNH5AAZWVIJ6Q/action/author_attestation","sign_citation":"https://pith.science/pith/I35NDHJPU3SMTMNH5AAZWVIJ6Q/action/citation_signature","submit_replication":"https://pith.science/pith/I35NDHJPU3SMTMNH5AAZWVIJ6Q/action/replication_record"}},"created_at":"2026-05-18T03:26:00.270810+00:00","updated_at":"2026-05-18T03:26:00.270810+00:00"}