{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S42YGOYEUBF3SA5FH2U7BPRU3U","short_pith_number":"pith:S42YGOYE","canonical_record":{"source":{"id":"1510.03317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-12T14:51:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4389de04e333d9da2b52ef369ff820dddda0934e76a3add117b5a2d7e5478aa4","abstract_canon_sha256":"8d6acac07873de20b57e56d7eea58f70d5fd2dfe044ea2a90b27d215db7f0b48"},"schema_version":"1.0"},"canonical_sha256":"9735833b04a04bb903a53ea9f0be34dd1206a46ecd35d01770c6b8af99e4a668","source":{"kind":"arxiv","id":"1510.03317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03317","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03317v1","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03317","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"S42YGOYEUBF3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S42YGOYEUBF3SA5F","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S42YGOYE","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S42YGOYEUBF3SA5FH2U7BPRU3U","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-12T14:51:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4389de04e333d9da2b52ef369ff820dddda0934e76a3add117b5a2d7e5478aa4","abstract_canon_sha256":"8d6acac07873de20b57e56d7eea58f70d5fd2dfe044ea2a90b27d215db7f0b48"},"schema_version":"1.0"},"canonical_sha256":"9735833b04a04bb903a53ea9f0be34dd1206a46ecd35d01770c6b8af99e4a668","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:32.205207Z","signature_b64":"WtK7azGeq7T7jvHKQi1dbHQ6MI1KJ2zG1pQo6UBvLNcZQQBMcqkGJ32VRXZU1tp4heWk05bfhVqN3Z4ejMCHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9735833b04a04bb903a53ea9f0be34dd1206a46ecd35d01770c6b8af99e4a668","last_reissued_at":"2026-05-18T01:30:32.204668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:32.204668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03317","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:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTo7SMjhak4v/AhTCDve42eXxA8qEOs3zwdF7DfV9r0S1NGSRxUd4Ob+NSsDN0FvAEEvP4bfnLEJL3Oe296RAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:29:40.218371Z"},"content_sha256":"a2e829d399eb981f5164d285e684945731cdb195f2083df7b470bff3d8038e74","schema_version":"1.0","event_id":"sha256:a2e829d399eb981f5164d285e684945731cdb195f2083df7b470bff3d8038e74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S42YGOYEUBF3SA5FH2U7BPRU3U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Inductive Constraint Programming Loop","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Anastasia Paparrizou, Barry O'Sullivan, Christian Bessiere, Dino Pedreschi, Helmut Simonis, Lars Kotthoff, Luc De Raedt, Mirco Nanni, Siegfried Nijssen, Tias Guns","submitted_at":"2015-10-12T14:51:03Z","abstract_excerpt":"Constraint programming is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems. At the same time, one continuously gathers vast amounts of data about these problems. Current constraint programming software does not exploit such data to update schedules, resources and plans. We propose a new framework, that we call the Inductive Constraint Programming loop. In this approach data is gathered and analyzed systematically, in order to dynamically revise and adapt constraints and optimization criteria. Inductive Constraint Programming "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03317","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:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXenzl2VeJigaoXerwe+vUF8RygYvusE5fxclgN50r/dcSDNSNVf/e0wEE4bPrL0IbItl+532D5t34qblOKhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:29:40.218719Z"},"content_sha256":"a50a2407c1255270c0439d2c09d64efd35e15352f5a215fad15ad1782f58c2a1","schema_version":"1.0","event_id":"sha256:a50a2407c1255270c0439d2c09d64efd35e15352f5a215fad15ad1782f58c2a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S42YGOYEUBF3SA5FH2U7BPRU3U/bundle.json","state_url":"https://pith.science/pith/S42YGOYEUBF3SA5FH2U7BPRU3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S42YGOYEUBF3SA5FH2U7BPRU3U/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-30T14:29:40Z","links":{"resolver":"https://pith.science/pith/S42YGOYEUBF3SA5FH2U7BPRU3U","bundle":"https://pith.science/pith/S42YGOYEUBF3SA5FH2U7BPRU3U/bundle.json","state":"https://pith.science/pith/S42YGOYEUBF3SA5FH2U7BPRU3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S42YGOYEUBF3SA5FH2U7BPRU3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S42YGOYEUBF3SA5FH2U7BPRU3U","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":"8d6acac07873de20b57e56d7eea58f70d5fd2dfe044ea2a90b27d215db7f0b48","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-12T14:51:03Z","title_canon_sha256":"4389de04e333d9da2b52ef369ff820dddda0934e76a3add117b5a2d7e5478aa4"},"schema_version":"1.0","source":{"id":"1510.03317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03317","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03317v1","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03317","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"S42YGOYEUBF3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S42YGOYEUBF3SA5F","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S42YGOYE","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:a50a2407c1255270c0439d2c09d64efd35e15352f5a215fad15ad1782f58c2a1","target":"graph","created_at":"2026-05-18T01:30:32Z","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 is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems. At the same time, one continuously gathers vast amounts of data about these problems. Current constraint programming software does not exploit such data to update schedules, resources and plans. We propose a new framework, that we call the Inductive Constraint Programming loop. In this approach data is gathered and analyzed systematically, in order to dynamically revise and adapt constraints and optimization criteria. Inductive Constraint Programming ","authors_text":"Anastasia Paparrizou, Barry O'Sullivan, Christian Bessiere, Dino Pedreschi, Helmut Simonis, Lars Kotthoff, Luc De Raedt, Mirco Nanni, Siegfried Nijssen, Tias Guns","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-12T14:51:03Z","title":"The Inductive Constraint Programming Loop"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03317","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:a2e829d399eb981f5164d285e684945731cdb195f2083df7b470bff3d8038e74","target":"record","created_at":"2026-05-18T01:30:32Z","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":"8d6acac07873de20b57e56d7eea58f70d5fd2dfe044ea2a90b27d215db7f0b48","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-12T14:51:03Z","title_canon_sha256":"4389de04e333d9da2b52ef369ff820dddda0934e76a3add117b5a2d7e5478aa4"},"schema_version":"1.0","source":{"id":"1510.03317","kind":"arxiv","version":1}},"canonical_sha256":"9735833b04a04bb903a53ea9f0be34dd1206a46ecd35d01770c6b8af99e4a668","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9735833b04a04bb903a53ea9f0be34dd1206a46ecd35d01770c6b8af99e4a668","first_computed_at":"2026-05-18T01:30:32.204668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:32.204668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WtK7azGeq7T7jvHKQi1dbHQ6MI1KJ2zG1pQo6UBvLNcZQQBMcqkGJ32VRXZU1tp4heWk05bfhVqN3Z4ejMCHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:32.205207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2e829d399eb981f5164d285e684945731cdb195f2083df7b470bff3d8038e74","sha256:a50a2407c1255270c0439d2c09d64efd35e15352f5a215fad15ad1782f58c2a1"],"state_sha256":"08a5e7fc91d667425ac5950b97c9d703df516ce19d59eb32a17171680f79a531"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMEGXqxge1y9VNVPPBqKQwT2aR7iB0Vn1i8Mwasa7UqGsIS9aJPNuHnZF+qXS3q3CKSLZ11pQAJvMmUcaneeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:29:40.220565Z","bundle_sha256":"8b9bdfe92a9800a28b9e2302dc3d161d4958a3460ccdd9518157856eb5e5b1de"}}