{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GLH4R2LQDMURLQERWRUZD65M27","short_pith_number":"pith:GLH4R2LQ","schema_version":"1.0","canonical_sha256":"32cfc8e9701b2915c091b46991fbacd7e30c4a631c42f84ae4b3dbd1ad4fb3ac","source":{"kind":"arxiv","id":"1306.4418","version":1},"attestation_state":"computed","paper":{"title":"Structure Based Extended Resolution for Constraint Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Geoffrey Chu, Peter J. Stuckey","submitted_at":"2013-06-19T04:18:45Z","abstract_excerpt":"Nogood learning is a powerful approach to reducing search in Constraint Programming (CP) solvers. The current state of the art, called Lazy Clause Generation (LCG), uses resolution to derive nogoods expressing the reasons for each search failure. Such nogoods can prune other parts of the search tree, producing exponential speedups on a wide variety of problems. Nogood learning solvers can be seen as resolution proof systems. The stronger the proof system, the faster it can solve a CP problem. It has recently been shown that the proof system used in LCG is at least as strong as general resoluti"},"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":"1306.4418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-06-19T04:18:45Z","cross_cats_sorted":[],"title_canon_sha256":"250862a8916d959eed321d1956e51befef4357f0a2e96baea5608d914b9c1484","abstract_canon_sha256":"e25b6b1602b7ae667670bc4a67a086d313b82a827437a87a6f0dbc56ee51740f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:34.550733Z","signature_b64":"IuV38bL+BueujAt4QTkHZ+nUFygV2FsyGKce4aR617w4KTJayBfwx0UMj3ngBVopEf4I6+KiCJ138P/gVJlEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32cfc8e9701b2915c091b46991fbacd7e30c4a631c42f84ae4b3dbd1ad4fb3ac","last_reissued_at":"2026-05-18T03:20:34.549739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:34.549739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure Based Extended Resolution for Constraint Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Geoffrey Chu, Peter J. Stuckey","submitted_at":"2013-06-19T04:18:45Z","abstract_excerpt":"Nogood learning is a powerful approach to reducing search in Constraint Programming (CP) solvers. The current state of the art, called Lazy Clause Generation (LCG), uses resolution to derive nogoods expressing the reasons for each search failure. Such nogoods can prune other parts of the search tree, producing exponential speedups on a wide variety of problems. Nogood learning solvers can be seen as resolution proof systems. The stronger the proof system, the faster it can solve a CP problem. It has recently been shown that the proof system used in LCG is at least as strong as general resoluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4418","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":"1306.4418","created_at":"2026-05-18T03:20:34.549885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4418v1","created_at":"2026-05-18T03:20:34.549885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4418","created_at":"2026-05-18T03:20:34.549885+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLH4R2LQDMUR","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLH4R2LQDMURLQER","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLH4R2LQ","created_at":"2026-05-18T12:27:45.050594+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/GLH4R2LQDMURLQERWRUZD65M27","json":"https://pith.science/pith/GLH4R2LQDMURLQERWRUZD65M27.json","graph_json":"https://pith.science/api/pith-number/GLH4R2LQDMURLQERWRUZD65M27/graph.json","events_json":"https://pith.science/api/pith-number/GLH4R2LQDMURLQERWRUZD65M27/events.json","paper":"https://pith.science/paper/GLH4R2LQ"},"agent_actions":{"view_html":"https://pith.science/pith/GLH4R2LQDMURLQERWRUZD65M27","download_json":"https://pith.science/pith/GLH4R2LQDMURLQERWRUZD65M27.json","view_paper":"https://pith.science/paper/GLH4R2LQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4418&json=true","fetch_graph":"https://pith.science/api/pith-number/GLH4R2LQDMURLQERWRUZD65M27/graph.json","fetch_events":"https://pith.science/api/pith-number/GLH4R2LQDMURLQERWRUZD65M27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLH4R2LQDMURLQERWRUZD65M27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLH4R2LQDMURLQERWRUZD65M27/action/storage_attestation","attest_author":"https://pith.science/pith/GLH4R2LQDMURLQERWRUZD65M27/action/author_attestation","sign_citation":"https://pith.science/pith/GLH4R2LQDMURLQERWRUZD65M27/action/citation_signature","submit_replication":"https://pith.science/pith/GLH4R2LQDMURLQERWRUZD65M27/action/replication_record"}},"created_at":"2026-05-18T03:20:34.549885+00:00","updated_at":"2026-05-18T03:20:34.549885+00:00"}