{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IHCKI74FD7MXUUBLVQEJB2SACK","short_pith_number":"pith:IHCKI74F","schema_version":"1.0","canonical_sha256":"41c4a47f851fd97a502bac0890ea40128ef18a5eca3e5fd6f6ef77551cfc2bed","source":{"kind":"arxiv","id":"1508.06096","version":1},"attestation_state":"computed","paper":{"title":"Unsatisfiable Cores and Lower Bounding 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":"2015-08-25T10:11:42Z","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 SAT (e.g. MAXSAT) force all soft constraints to be hard initially. When solving fails they return an unsatisfiable core, as a set of soft constraints that cannot hold simultaneously. These are reverted to soft "},"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":"1508.06096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-08-25T10:11:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b201bade97e25b1dd0d4f16a620390afc9b507adeeb0b7413fe5b3c34246a4fc","abstract_canon_sha256":"91c34abc96692bfdc2d9f6e6f909aa025fbc119ac14b32f1640d54ef69aa993a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:46.866194Z","signature_b64":"+4aUG5aHdakqtMzIvl0JrP65Vw3ZkS1bCZjRgTxAltB9aVqfcMjtoMnBUnmcbiLyWfaUqkChqyEvOURHKIY9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41c4a47f851fd97a502bac0890ea40128ef18a5eca3e5fd6f6ef77551cfc2bed","last_reissued_at":"2026-05-18T01:34:46.865469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:46.865469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsatisfiable Cores and Lower Bounding 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":"2015-08-25T10:11:42Z","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 SAT (e.g. MAXSAT) force all soft constraints to be hard initially. When solving fails they return an unsatisfiable core, as a set of soft constraints that cannot hold simultaneously. These are reverted to soft "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06096","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":"1508.06096","created_at":"2026-05-18T01:34:46.865590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06096v1","created_at":"2026-05-18T01:34:46.865590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06096","created_at":"2026-05-18T01:34:46.865590+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHCKI74FD7MX","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHCKI74FD7MXUUBL","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHCKI74F","created_at":"2026-05-18T12:29:25.134429+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/IHCKI74FD7MXUUBLVQEJB2SACK","json":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK.json","graph_json":"https://pith.science/api/pith-number/IHCKI74FD7MXUUBLVQEJB2SACK/graph.json","events_json":"https://pith.science/api/pith-number/IHCKI74FD7MXUUBLVQEJB2SACK/events.json","paper":"https://pith.science/paper/IHCKI74F"},"agent_actions":{"view_html":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK","download_json":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK.json","view_paper":"https://pith.science/paper/IHCKI74F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06096&json=true","fetch_graph":"https://pith.science/api/pith-number/IHCKI74FD7MXUUBLVQEJB2SACK/graph.json","fetch_events":"https://pith.science/api/pith-number/IHCKI74FD7MXUUBLVQEJB2SACK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/action/storage_attestation","attest_author":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/action/author_attestation","sign_citation":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/action/citation_signature","submit_replication":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/action/replication_record"}},"created_at":"2026-05-18T01:34:46.865590+00:00","updated_at":"2026-05-18T01:34:46.865590+00:00"}