{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IHCKI74FD7MXUUBLVQEJB2SACK","short_pith_number":"pith:IHCKI74F","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"},"canonical_sha256":"41c4a47f851fd97a502bac0890ea40128ef18a5eca3e5fd6f6ef77551cfc2bed","source":{"kind":"arxiv","id":"1508.06096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06096","created_at":"2026-05-18T01:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06096v1","created_at":"2026-05-18T01:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06096","created_at":"2026-05-18T01:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"IHCKI74FD7MX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IHCKI74FD7MXUUBL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IHCKI74F","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IHCKI74FD7MXUUBLVQEJB2SACK","target":"record","payload":{"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"},"canonical_sha256":"41c4a47f851fd97a502bac0890ea40128ef18a5eca3e5fd6f6ef77551cfc2bed","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"},"source_kind":"arxiv","source_id":"1508.06096","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-18T01:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwFyd8anyxGYIIWlJv4Sj9y7B7X4Rp90Smh/PS7/StwmC+4oLEgcOFmO7pKwVDEcm6GScxqEwOaZl+ONrnSjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:21:14.477335Z"},"content_sha256":"44ed4129efb934af521fbaa4dd0f09f3300800b01bcb390855db0888653bb4be","schema_version":"1.0","event_id":"sha256:44ed4129efb934af521fbaa4dd0f09f3300800b01bcb390855db0888653bb4be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IHCKI74FD7MXUUBLVQEJB2SACK","target":"graph","payload":{"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"},"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-18T01:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9nlVo2UoIiEIcAd2bYqHmewT/Nb67ObppsLPhmM+Mz+NlMobeTyVkcf/13qMQ8GIISKK8LbukL3vUOEeqsSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:21:14.477741Z"},"content_sha256":"38a4d347b7ef082d436d18fd4ce5a96bb799862f9fad81db3acccf3856005aab","schema_version":"1.0","event_id":"sha256:38a4d347b7ef082d436d18fd4ce5a96bb799862f9fad81db3acccf3856005aab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/bundle.json","state_url":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHCKI74FD7MXUUBLVQEJB2SACK/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-26T15:21:14Z","links":{"resolver":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK","bundle":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/bundle.json","state":"https://pith.science/pith/IHCKI74FD7MXUUBLVQEJB2SACK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHCKI74FD7MXUUBLVQEJB2SACK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IHCKI74FD7MXUUBLVQEJB2SACK","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":"91c34abc96692bfdc2d9f6e6f909aa025fbc119ac14b32f1640d54ef69aa993a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-08-25T10:11:42Z","title_canon_sha256":"b201bade97e25b1dd0d4f16a620390afc9b507adeeb0b7413fe5b3c34246a4fc"},"schema_version":"1.0","source":{"id":"1508.06096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06096","created_at":"2026-05-18T01:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06096v1","created_at":"2026-05-18T01:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06096","created_at":"2026-05-18T01:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"IHCKI74FD7MX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IHCKI74FD7MXUUBL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IHCKI74F","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:38a4d347b7ef082d436d18fd4ce5a96bb799862f9fad81db3acccf3856005aab","target":"graph","created_at":"2026-05-18T01:34:46Z","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 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 ","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":"2015-08-25T10:11:42Z","title":"Unsatisfiable Cores and Lower Bounding for Constraint Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06096","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:44ed4129efb934af521fbaa4dd0f09f3300800b01bcb390855db0888653bb4be","target":"record","created_at":"2026-05-18T01:34:46Z","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":"91c34abc96692bfdc2d9f6e6f909aa025fbc119ac14b32f1640d54ef69aa993a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-08-25T10:11:42Z","title_canon_sha256":"b201bade97e25b1dd0d4f16a620390afc9b507adeeb0b7413fe5b3c34246a4fc"},"schema_version":"1.0","source":{"id":"1508.06096","kind":"arxiv","version":1}},"canonical_sha256":"41c4a47f851fd97a502bac0890ea40128ef18a5eca3e5fd6f6ef77551cfc2bed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41c4a47f851fd97a502bac0890ea40128ef18a5eca3e5fd6f6ef77551cfc2bed","first_computed_at":"2026-05-18T01:34:46.865469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:46.865469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+4aUG5aHdakqtMzIvl0JrP65Vw3ZkS1bCZjRgTxAltB9aVqfcMjtoMnBUnmcbiLyWfaUqkChqyEvOURHKIY9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:46.866194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44ed4129efb934af521fbaa4dd0f09f3300800b01bcb390855db0888653bb4be","sha256:38a4d347b7ef082d436d18fd4ce5a96bb799862f9fad81db3acccf3856005aab"],"state_sha256":"4391f7ec958a95bff6ac5d3f613d10142cc8f8b24a1069a3959bcb2f7639e64b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+rLNym5PJRFOx85m9CB+iSy+6uKcgKXiUBNy9UimpsIIiX/7gIeSsTklj6wT1J5UY5n4WgET9/3mivcmgrUAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:21:14.479902Z","bundle_sha256":"3a0d6d6a06383820aedcf20e8d80abf771a4bd4d197a907c561399e3324ec5f0"}}