{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AMZJHQZN6JSKQF4GTBXZ2HJCXH","short_pith_number":"pith:AMZJHQZN","canonical_record":{"source":{"id":"1902.02587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T12:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"7053a884445edcd754c0a21a2ff942214491dc60a525894afacd1d4701e0730a","abstract_canon_sha256":"b68de55913f2e8c83182188bf3574b17f2634983bbf08df6c5818176468af42d"},"schema_version":"1.0"},"canonical_sha256":"033293c32df264a81786986f9d1d22b9e6692dca0f3ba56fc1b662d909724b86","source":{"kind":"arxiv","id":"1902.02587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02587","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02587v1","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02587","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"pith_short_12","alias_value":"AMZJHQZN6JSK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AMZJHQZN6JSKQF4G","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AMZJHQZN","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AMZJHQZN6JSKQF4GTBXZ2HJCXH","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T12:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"7053a884445edcd754c0a21a2ff942214491dc60a525894afacd1d4701e0730a","abstract_canon_sha256":"b68de55913f2e8c83182188bf3574b17f2634983bbf08df6c5818176468af42d"},"schema_version":"1.0"},"canonical_sha256":"033293c32df264a81786986f9d1d22b9e6692dca0f3ba56fc1b662d909724b86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:32.764721Z","signature_b64":"gmz+6Bs28BF/Flev74AxG+PuPP708vCcZPLhvx0qf34Aa/lc0BniJKc+xg/PSoU7P2lUMEwZFioH7OZuxZSPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"033293c32df264a81786986f9d1d22b9e6692dca0f3ba56fc1b662d909724b86","last_reissued_at":"2026-05-17T23:54:32.764083Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:32.764083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02587","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-17T23:54:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dq4C+XjGt3Gcn015nMF35QEOKcTEQKeSlPeaPahNw4licOu67Q5xpZ8ee0wO0ji8+afTtcjHyRCkVzUj4SaVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:44:40.508288Z"},"content_sha256":"2aa9293ae67bcd9c8d3461ed8118d2f3a776f72d3f12e13fafb314fc896b1ec7","schema_version":"1.0","event_id":"sha256:2aa9293ae67bcd9c8d3461ed8118d2f3a776f72d3f12e13fafb314fc896b1ec7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AMZJHQZN6JSKQF4GTBXZ2HJCXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Rapid Learning for Integer Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jakob Witzig, Peter J. Stuckey, Timo Berthold","submitted_at":"2019-02-07T12:34:04Z","abstract_excerpt":"Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the natural mode for CP solving, it is not for MIP solving. Rapid Learning is a hybrid CP/MIP approach where CP search is applied at the root to learn information to support the remaining MIP solve. This has been demonstrated to be beneficial for binary programs. In this paper, we extend the idea of Rapid Learning to integer programs, where not all variables are restricted to the domain {0,1}, and rather than just running"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02587","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-17T23:54:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1riZgJvzlwON5wXHksGoytPiTf4CPi8eBhuIzghaTpEsjAVdo5CRWCqmjtYWl5esxz2bySvb0FRZ44KKapAABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:44:40.508726Z"},"content_sha256":"146ffcac1b571e6534cdb067571ce1072f7ab887cad1e0ba40a7e8ddc8b7129a","schema_version":"1.0","event_id":"sha256:146ffcac1b571e6534cdb067571ce1072f7ab887cad1e0ba40a7e8ddc8b7129a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMZJHQZN6JSKQF4GTBXZ2HJCXH/bundle.json","state_url":"https://pith.science/pith/AMZJHQZN6JSKQF4GTBXZ2HJCXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMZJHQZN6JSKQF4GTBXZ2HJCXH/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-27T00:44:40Z","links":{"resolver":"https://pith.science/pith/AMZJHQZN6JSKQF4GTBXZ2HJCXH","bundle":"https://pith.science/pith/AMZJHQZN6JSKQF4GTBXZ2HJCXH/bundle.json","state":"https://pith.science/pith/AMZJHQZN6JSKQF4GTBXZ2HJCXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMZJHQZN6JSKQF4GTBXZ2HJCXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AMZJHQZN6JSKQF4GTBXZ2HJCXH","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":"b68de55913f2e8c83182188bf3574b17f2634983bbf08df6c5818176468af42d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T12:34:04Z","title_canon_sha256":"7053a884445edcd754c0a21a2ff942214491dc60a525894afacd1d4701e0730a"},"schema_version":"1.0","source":{"id":"1902.02587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02587","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02587v1","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02587","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"pith_short_12","alias_value":"AMZJHQZN6JSK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AMZJHQZN6JSKQF4G","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AMZJHQZN","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:146ffcac1b571e6534cdb067571ce1072f7ab887cad1e0ba40a7e8ddc8b7129a","target":"graph","created_at":"2026-05-17T23:54: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":"Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the natural mode for CP solving, it is not for MIP solving. Rapid Learning is a hybrid CP/MIP approach where CP search is applied at the root to learn information to support the remaining MIP solve. This has been demonstrated to be beneficial for binary programs. In this paper, we extend the idea of Rapid Learning to integer programs, where not all variables are restricted to the domain {0,1}, and rather than just running","authors_text":"Jakob Witzig, Peter J. Stuckey, Timo Berthold","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T12:34:04Z","title":"Local Rapid Learning for Integer Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02587","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:2aa9293ae67bcd9c8d3461ed8118d2f3a776f72d3f12e13fafb314fc896b1ec7","target":"record","created_at":"2026-05-17T23:54: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":"b68de55913f2e8c83182188bf3574b17f2634983bbf08df6c5818176468af42d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T12:34:04Z","title_canon_sha256":"7053a884445edcd754c0a21a2ff942214491dc60a525894afacd1d4701e0730a"},"schema_version":"1.0","source":{"id":"1902.02587","kind":"arxiv","version":1}},"canonical_sha256":"033293c32df264a81786986f9d1d22b9e6692dca0f3ba56fc1b662d909724b86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"033293c32df264a81786986f9d1d22b9e6692dca0f3ba56fc1b662d909724b86","first_computed_at":"2026-05-17T23:54:32.764083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:32.764083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gmz+6Bs28BF/Flev74AxG+PuPP708vCcZPLhvx0qf34Aa/lc0BniJKc+xg/PSoU7P2lUMEwZFioH7OZuxZSPDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:32.764721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aa9293ae67bcd9c8d3461ed8118d2f3a776f72d3f12e13fafb314fc896b1ec7","sha256:146ffcac1b571e6534cdb067571ce1072f7ab887cad1e0ba40a7e8ddc8b7129a"],"state_sha256":"ea6a6ef8f1e1b1fe2d1d25a0616b885ae6221b90a4efd52948ebc8f8cb52c8f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7rix92jm7JUGaSoo3m5OWhGK/wovBAcWXxF4RovS7jC3te/IozRFMdnKQM+ux9Ka0UdT8mHCngpqz2Hqx0iCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:44:40.511311Z","bundle_sha256":"df41c5df864cafa455c88aeb09fd08d4a051f7c32d44713b75c556a0bfb029c3"}}