{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2BLWUKPNAC2YSQZV3K3SJU2SNS","short_pith_number":"pith:2BLWUKPN","schema_version":"1.0","canonical_sha256":"d0576a29ed00b5894335dab724d3526cac06e5238680ebe492ad974d43b76b1b","source":{"kind":"arxiv","id":"2304.03755","version":1},"attestation_state":"computed","paper":{"title":"Online Learning for Scheduling MIP Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"math.OC","authors_text":"Ambros Gleixner, Antonia Chmiela, Pawel Lichocki, Sebastian Pokutta","submitted_at":"2023-04-04T14:55:15Z","abstract_excerpt":"Mixed Integer Programming (MIP) is NP-hard, and yet modern solvers often solve large real-world problems within minutes. This success can partially be attributed to heuristics. Since their behavior is highly instance-dependent, relying on hard-coded rules derived from empirical testing on a large heterogeneous corpora of benchmark instances might lead to sub-optimal performance. In this work, we propose an online learning approach that adapts the application of heuristics towards the single instance at hand. We replace the commonly used static heuristic handling with an adaptive framework expl"},"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":"2304.03755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-04T14:55:15Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5db09fd67344f7e42caedbbb63703ec69436a0a7054df618e43de7e026880f79","abstract_canon_sha256":"7953450ecb44b73a8d3a44b89ddfea97bd48204f5f551bbf9dab5224913d9619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:59.953544Z","signature_b64":"+Q0bWT9LaLjXwHwmcddSKFwnKfG3STy8ipRx4OeRLl9DMiw9+vjMr1l26oMqC1vqTJseQzMQvxvRhE9lHJx9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0576a29ed00b5894335dab724d3526cac06e5238680ebe492ad974d43b76b1b","last_reissued_at":"2026-07-05T05:58:59.953089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:59.953089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning for Scheduling MIP Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"math.OC","authors_text":"Ambros Gleixner, Antonia Chmiela, Pawel Lichocki, Sebastian Pokutta","submitted_at":"2023-04-04T14:55:15Z","abstract_excerpt":"Mixed Integer Programming (MIP) is NP-hard, and yet modern solvers often solve large real-world problems within minutes. This success can partially be attributed to heuristics. Since their behavior is highly instance-dependent, relying on hard-coded rules derived from empirical testing on a large heterogeneous corpora of benchmark instances might lead to sub-optimal performance. In this work, we propose an online learning approach that adapts the application of heuristics towards the single instance at hand. We replace the commonly used static heuristic handling with an adaptive framework expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03755","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.03755/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.03755","created_at":"2026-07-05T05:58:59.953145+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03755v1","created_at":"2026-07-05T05:58:59.953145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03755","created_at":"2026-07-05T05:58:59.953145+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BLWUKPNAC2Y","created_at":"2026-07-05T05:58:59.953145+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BLWUKPNAC2YSQZV","created_at":"2026-07-05T05:58:59.953145+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BLWUKPN","created_at":"2026-07-05T05:58:59.953145+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/2BLWUKPNAC2YSQZV3K3SJU2SNS","json":"https://pith.science/pith/2BLWUKPNAC2YSQZV3K3SJU2SNS.json","graph_json":"https://pith.science/api/pith-number/2BLWUKPNAC2YSQZV3K3SJU2SNS/graph.json","events_json":"https://pith.science/api/pith-number/2BLWUKPNAC2YSQZV3K3SJU2SNS/events.json","paper":"https://pith.science/paper/2BLWUKPN"},"agent_actions":{"view_html":"https://pith.science/pith/2BLWUKPNAC2YSQZV3K3SJU2SNS","download_json":"https://pith.science/pith/2BLWUKPNAC2YSQZV3K3SJU2SNS.json","view_paper":"https://pith.science/paper/2BLWUKPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03755&json=true","fetch_graph":"https://pith.science/api/pith-number/2BLWUKPNAC2YSQZV3K3SJU2SNS/graph.json","fetch_events":"https://pith.science/api/pith-number/2BLWUKPNAC2YSQZV3K3SJU2SNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BLWUKPNAC2YSQZV3K3SJU2SNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BLWUKPNAC2YSQZV3K3SJU2SNS/action/storage_attestation","attest_author":"https://pith.science/pith/2BLWUKPNAC2YSQZV3K3SJU2SNS/action/author_attestation","sign_citation":"https://pith.science/pith/2BLWUKPNAC2YSQZV3K3SJU2SNS/action/citation_signature","submit_replication":"https://pith.science/pith/2BLWUKPNAC2YSQZV3K3SJU2SNS/action/replication_record"}},"created_at":"2026-07-05T05:58:59.953145+00:00","updated_at":"2026-07-05T05:58:59.953145+00:00"}