{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DYV7EEUFIPYOGJPZ767NGGTNZG","short_pith_number":"pith:DYV7EEUF","schema_version":"1.0","canonical_sha256":"1e2bf2128543f0e325f9ffbed31a6dc9931cc9daf9e04682131a03bd0c8a40da","source":{"kind":"arxiv","id":"1401.4613","version":1},"attestation_state":"computed","paper":{"title":"Local Consistency and SAT-Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Justyna Petke, Peter Jeavons","submitted_at":"2014-01-18T21:39:00Z","abstract_excerpt":"Local consistency techniques such as k-consistency are a key  component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which we call negative-hyper-resolution, on the standard direct encoding of the problem into Boolean clauses. We also show that current clause-learning SAT-solvers will discover in expected polynomial time any inconsistency that can be deduced from a given set of clauses using negative-hyper-resolv"},"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":"1401.4613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:39:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a3eb833248a8e968282fb84baebd8924e84d0b2b0f393b10df219ac7664a364b","abstract_canon_sha256":"a968acbe50e05e7932f772a269e9f06fc3d83fe0f34d49575815c7743f6f2072"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:45.182908Z","signature_b64":"SPuMjF9xdx4nFQrMZZ0bm8V+txgNtIAs/KLVXfZqw7UXbw9+CNR8Ll3+SG18LoUYrKWMijx4+/tUdcv6N9rlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e2bf2128543f0e325f9ffbed31a6dc9931cc9daf9e04682131a03bd0c8a40da","last_reissued_at":"2026-05-18T03:01:45.182342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:45.182342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Consistency and SAT-Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Justyna Petke, Peter Jeavons","submitted_at":"2014-01-18T21:39:00Z","abstract_excerpt":"Local consistency techniques such as k-consistency are a key  component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which we call negative-hyper-resolution, on the standard direct encoding of the problem into Boolean clauses. We also show that current clause-learning SAT-solvers will discover in expected polynomial time any inconsistency that can be deduced from a given set of clauses using negative-hyper-resolv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4613","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":"1401.4613","created_at":"2026-05-18T03:01:45.182428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4613v1","created_at":"2026-05-18T03:01:45.182428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4613","created_at":"2026-05-18T03:01:45.182428+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYV7EEUFIPYO","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYV7EEUFIPYOGJPZ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYV7EEUF","created_at":"2026-05-18T12:28:25.294606+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/DYV7EEUFIPYOGJPZ767NGGTNZG","json":"https://pith.science/pith/DYV7EEUFIPYOGJPZ767NGGTNZG.json","graph_json":"https://pith.science/api/pith-number/DYV7EEUFIPYOGJPZ767NGGTNZG/graph.json","events_json":"https://pith.science/api/pith-number/DYV7EEUFIPYOGJPZ767NGGTNZG/events.json","paper":"https://pith.science/paper/DYV7EEUF"},"agent_actions":{"view_html":"https://pith.science/pith/DYV7EEUFIPYOGJPZ767NGGTNZG","download_json":"https://pith.science/pith/DYV7EEUFIPYOGJPZ767NGGTNZG.json","view_paper":"https://pith.science/paper/DYV7EEUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4613&json=true","fetch_graph":"https://pith.science/api/pith-number/DYV7EEUFIPYOGJPZ767NGGTNZG/graph.json","fetch_events":"https://pith.science/api/pith-number/DYV7EEUFIPYOGJPZ767NGGTNZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYV7EEUFIPYOGJPZ767NGGTNZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYV7EEUFIPYOGJPZ767NGGTNZG/action/storage_attestation","attest_author":"https://pith.science/pith/DYV7EEUFIPYOGJPZ767NGGTNZG/action/author_attestation","sign_citation":"https://pith.science/pith/DYV7EEUFIPYOGJPZ767NGGTNZG/action/citation_signature","submit_replication":"https://pith.science/pith/DYV7EEUFIPYOGJPZ767NGGTNZG/action/replication_record"}},"created_at":"2026-05-18T03:01:45.182428+00:00","updated_at":"2026-05-18T03:01:45.182428+00:00"}