{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DOGLXZOBW2ZWP4FCVDEE5CAX43","short_pith_number":"pith:DOGLXZOB","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"},"canonical_sha256":"1b8cbbe5c1b6b367f0a2a8c84e8817e6ff4e7463be2c1b67712313a9cec2e76a","source":{"kind":"arxiv","id":"1305.1690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1690","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1690v1","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1690","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"DOGLXZOBW2ZW","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DOGLXZOBW2ZWP4FC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DOGLXZOB","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DOGLXZOBW2ZWP4FCVDEE5CAX43","target":"record","payload":{"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"},"canonical_sha256":"1b8cbbe5c1b6b367f0a2a8c84e8817e6ff4e7463be2c1b67712313a9cec2e76a","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"},"source_kind":"arxiv","source_id":"1305.1690","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YT1v4x51HhIv204dYhVD+X6ZNCJNMrlEgwzDytlHg1m/acmoaZ5AtpX1hHN9rwQoNn1GPZqmlQdgifBvoakQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:00:49.814066Z"},"content_sha256":"a9dbf12505ca3f11b12dd41e0cca1cb618b496af3f18ce06294dc9dd95f23192","schema_version":"1.0","event_id":"sha256:a9dbf12505ca3f11b12dd41e0cca1cb618b496af3f18ce06294dc9dd95f23192"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DOGLXZOBW2ZWP4FCVDEE5CAX43","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5BM861DvuGlW6stfxTvxknNweTVV6tHPsS5xmoNZOYxtk/CgyCq2Cr3kZ6Ohf9llRicli4ytmdYq/n5+6S3WAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:00:49.814473Z"},"content_sha256":"66629d3148a13bc1e845cffee3f8233f05b6409f1af64771224dac3699b7bcee","schema_version":"1.0","event_id":"sha256:66629d3148a13bc1e845cffee3f8233f05b6409f1af64771224dac3699b7bcee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/bundle.json","state_url":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T11:00:49Z","links":{"resolver":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43","bundle":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/bundle.json","state":"https://pith.science/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOGLXZOBW2ZWP4FCVDEE5CAX43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DOGLXZOBW2ZWP4FCVDEE5CAX43","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"beb71d3cd597e84ee9ad1a48059f728284f41a1601f61a14221a9269e3eaede1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-05-08T01:50:05Z","title_canon_sha256":"b215eb6f9b2be627f6a6b75eb0fb71c0593e1d225b3e59c44da1240736cc91ab"},"schema_version":"1.0","source":{"id":"1305.1690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1690","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1690v1","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1690","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"DOGLXZOBW2ZW","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DOGLXZOBW2ZWP4FC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DOGLXZOB","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:66629d3148a13bc1e845cffee3f8233f05b6409f1af64771224dac3699b7bcee","target":"graph","created_at":"2026-05-18T03:26:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Nicholas Downing, Peter J. Stuckey, Thibaut Feydy","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-05-08T01:50:05Z","title":"Unsatisfiable Cores for Constraint Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1690","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a9dbf12505ca3f11b12dd41e0cca1cb618b496af3f18ce06294dc9dd95f23192","target":"record","created_at":"2026-05-18T03:26:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"beb71d3cd597e84ee9ad1a48059f728284f41a1601f61a14221a9269e3eaede1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-05-08T01:50:05Z","title_canon_sha256":"b215eb6f9b2be627f6a6b75eb0fb71c0593e1d225b3e59c44da1240736cc91ab"},"schema_version":"1.0","source":{"id":"1305.1690","kind":"arxiv","version":1}},"canonical_sha256":"1b8cbbe5c1b6b367f0a2a8c84e8817e6ff4e7463be2c1b67712313a9cec2e76a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b8cbbe5c1b6b367f0a2a8c84e8817e6ff4e7463be2c1b67712313a9cec2e76a","first_computed_at":"2026-05-18T03:26:11.536414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:11.536414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RquISwlfztfAYL2t5HU7plRHc9kvHO6rBl3BDhnDZ8+bwp3TAJWdA+g5nQY8sC2KSICOeg4HdMLiEsEl/006Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:11.537043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9dbf12505ca3f11b12dd41e0cca1cb618b496af3f18ce06294dc9dd95f23192","sha256:66629d3148a13bc1e845cffee3f8233f05b6409f1af64771224dac3699b7bcee"],"state_sha256":"4e22201aa81996666cd27187edebe3ab9a2e9bf557ec4252c89e6f321ebe297c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LfLp1c0ir4QREnM/wJx2wKz9KyWllsQ9Ijz/vLY2pVDUQdR53IFy/8E4DBIZfTrUxCDzn42H4PIPQ79lEmpzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:00:49.817160Z","bundle_sha256":"836f67fea65f3d6995735f9a8052cfe29e0c0e4aa17343305a8b45e75bf2eece"}}