{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DOGLXZOBW2ZWP4FCVDEE5CAX43","short_pith_number":"pith:DOGLXZOB","schema_version":"1.0","canonical_sha256":"1b8cbbe5c1b6b367f0a2a8c84e8817e6ff4e7463be2c1b67712313a9cec2e76a","source":{"kind":"arxiv","id":"1305.1690","version":1},"attestation_state":"computed","paper":{"title":"Unsatisfiable Cores for Constraint Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Nicholas Downing, Peter J. Stuckey, Thibaut Feydy","submitted_at":"2013-05-08T01:50:05Z","abstract_excerpt":"Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cost. This approach is somewhat naive, especially for soft-constraint optimization problems in which the soft constraints are mostly satisfied. Unsatisfiable-core approaches to solving soft constraint problems in Boolean Satisfiability (e.g. MAXSAT) force all soft constraints to hold initially. When solving fails they return an unsatisfiable core, as a set of soft constraints that cannot hold simultaneously. Using this "},"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":"1305.1690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-05-08T01:50:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b215eb6f9b2be627f6a6b75eb0fb71c0593e1d225b3e59c44da1240736cc91ab","abstract_canon_sha256":"beb71d3cd597e84ee9ad1a48059f728284f41a1601f61a14221a9269e3eaede1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:11.537043Z","signature_b64":"RquISwlfztfAYL2t5HU7plRHc9kvHO6rBl3BDhnDZ8+bwp3TAJWdA+g5nQY8sC2KSICOeg4HdMLiEsEl/006Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b8cbbe5c1b6b367f0a2a8c84e8817e6ff4e7463be2c1b67712313a9cec2e76a","last_reissued_at":"2026-05-18T03:26:11.536414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:11.536414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsatisfiable Cores for Constraint Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Nicholas Downing, Peter J. Stuckey, Thibaut Feydy","submitted_at":"2013-05-08T01:50:05Z","abstract_excerpt":"Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cost. This approach is somewhat naive, especially for soft-constraint optimization problems in which the soft constraints are mostly satisfied. Unsatisfiable-core approaches to solving soft constraint problems in Boolean Satisfiability (e.g. MAXSAT) force all soft constraints to hold initially. When solving fails they return an unsatisfiable core, as a set of soft constraints that cannot hold simultaneously. Using this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1690","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":"1305.1690","created_at":"2026-05-18T03:26:11.536537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1690v1","created_at":"2026-05-18T03:26:11.536537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1690","created_at":"2026-05-18T03:26:11.536537+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOGLXZOBW2ZW","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOGLXZOBW2ZWP4FC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOGLXZOB","created_at":"2026-05-18T12:27:43.054852+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/DOGLXZOBW2ZWP4FCVDEE5CAX43","json":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43.json","graph_json":"https://pith.science/api/pith-number/DOGLXZOBW2ZWP4FCVDEE5CAX43/graph.json","events_json":"https://pith.science/api/pith-number/DOGLXZOBW2ZWP4FCVDEE5CAX43/events.json","paper":"https://pith.science/paper/DOGLXZOB"},"agent_actions":{"view_html":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43","download_json":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43.json","view_paper":"https://pith.science/paper/DOGLXZOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1690&json=true","fetch_graph":"https://pith.science/api/pith-number/DOGLXZOBW2ZWP4FCVDEE5CAX43/graph.json","fetch_events":"https://pith.science/api/pith-number/DOGLXZOBW2ZWP4FCVDEE5CAX43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/action/storage_attestation","attest_author":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/action/author_attestation","sign_citation":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/action/citation_signature","submit_replication":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/action/replication_record"}},"created_at":"2026-05-18T03:26:11.536537+00:00","updated_at":"2026-05-18T03:26:11.536537+00:00"}