{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BOGGZTZKRWR7RW3GZDHYAJAJK3","short_pith_number":"pith:BOGGZTZK","schema_version":"1.0","canonical_sha256":"0b8c6ccf2a8da3f8db66c8cf80240956eb3d08217d74d1116e4c121d3b456876","source":{"kind":"arxiv","id":"2107.07136","version":1},"attestation_state":"computed","paper":{"title":"Learning Mixed-Integer Linear Programs from Contextual Examples","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Luc De Raedt, Mohit Kumar, Samuel Kolb, Stefano Teso","submitted_at":"2021-07-15T05:45:52Z","abstract_excerpt":"Mixed-integer linear programs (MILPs) are widely used in artificial intelligence and operations research to model complex decision problems like scheduling and routing. Designing such programs however requires both domain and modelling expertise. In this paper, we study the problem of acquiring MILPs from contextual examples, a novel and realistic setting in which examples capture solutions and non-solutions within a specific context. The resulting learning problem involves acquiring continuous parameters -- namely, a cost vector and a feasibility polytope -- but has a distinctly combinatorial"},"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":"2107.07136","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-07-15T05:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"1b3be9cb5a7a8b3c94cc278bcb6e053be414deb9e6d6982be6161be23b685b3e","abstract_canon_sha256":"a94b22ac4057b69a750cffb919a0ff3274fee20f9d8029fae95f80b2df40c9fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:11.210784Z","signature_b64":"q8ooy7x+k70f2oL9tT1H05CyZMfKOLtBnEtw3qlxFGAhu5hHeLnmlX/0HgFY81XkBZ6LG+R33Uw6vsKwA0+BDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b8c6ccf2a8da3f8db66c8cf80240956eb3d08217d74d1116e4c121d3b456876","last_reissued_at":"2026-07-05T02:58:11.210377Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:11.210377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Mixed-Integer Linear Programs from Contextual Examples","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Luc De Raedt, Mohit Kumar, Samuel Kolb, Stefano Teso","submitted_at":"2021-07-15T05:45:52Z","abstract_excerpt":"Mixed-integer linear programs (MILPs) are widely used in artificial intelligence and operations research to model complex decision problems like scheduling and routing. Designing such programs however requires both domain and modelling expertise. In this paper, we study the problem of acquiring MILPs from contextual examples, a novel and realistic setting in which examples capture solutions and non-solutions within a specific context. The resulting learning problem involves acquiring continuous parameters -- namely, a cost vector and a feasibility polytope -- but has a distinctly combinatorial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.07136","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/2107.07136/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":"2107.07136","created_at":"2026-07-05T02:58:11.210442+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.07136v1","created_at":"2026-07-05T02:58:11.210442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.07136","created_at":"2026-07-05T02:58:11.210442+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOGGZTZKRWR7","created_at":"2026-07-05T02:58:11.210442+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOGGZTZKRWR7RW3G","created_at":"2026-07-05T02:58:11.210442+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOGGZTZK","created_at":"2026-07-05T02:58:11.210442+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/BOGGZTZKRWR7RW3GZDHYAJAJK3","json":"https://pith.science/pith/BOGGZTZKRWR7RW3GZDHYAJAJK3.json","graph_json":"https://pith.science/api/pith-number/BOGGZTZKRWR7RW3GZDHYAJAJK3/graph.json","events_json":"https://pith.science/api/pith-number/BOGGZTZKRWR7RW3GZDHYAJAJK3/events.json","paper":"https://pith.science/paper/BOGGZTZK"},"agent_actions":{"view_html":"https://pith.science/pith/BOGGZTZKRWR7RW3GZDHYAJAJK3","download_json":"https://pith.science/pith/BOGGZTZKRWR7RW3GZDHYAJAJK3.json","view_paper":"https://pith.science/paper/BOGGZTZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.07136&json=true","fetch_graph":"https://pith.science/api/pith-number/BOGGZTZKRWR7RW3GZDHYAJAJK3/graph.json","fetch_events":"https://pith.science/api/pith-number/BOGGZTZKRWR7RW3GZDHYAJAJK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOGGZTZKRWR7RW3GZDHYAJAJK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOGGZTZKRWR7RW3GZDHYAJAJK3/action/storage_attestation","attest_author":"https://pith.science/pith/BOGGZTZKRWR7RW3GZDHYAJAJK3/action/author_attestation","sign_citation":"https://pith.science/pith/BOGGZTZKRWR7RW3GZDHYAJAJK3/action/citation_signature","submit_replication":"https://pith.science/pith/BOGGZTZKRWR7RW3GZDHYAJAJK3/action/replication_record"}},"created_at":"2026-07-05T02:58:11.210442+00:00","updated_at":"2026-07-05T02:58:11.210442+00:00"}