{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M4NCW7S7W6OQYYAOLSHZWIACBW","short_pith_number":"pith:M4NCW7S7","schema_version":"1.0","canonical_sha256":"671a2b7e5fb79d0c600e5c8f9b20020da4a50b7b3150d60a9668fccefab5602a","source":{"kind":"arxiv","id":"2408.08449","version":2},"attestation_state":"computed","paper":{"title":"Machine Learning for Optimization-Based Separation of Mixed-Integer Rounding Cuts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksandr M. Kazachkov, Arnaud Deza, Elias B. Khalil, Oscar Guaje","submitted_at":"2024-08-15T23:01:41Z","abstract_excerpt":"Mixed-integer rounding (MIR) cutting planes (cuts) are effective at improving the strength of a linear relaxation for mixed-integer linear programming (MIP) problems. The cuts in this family are derived by aggregating constraints then rounding coefficients, but finding the strongest MIR cuts requires optimizing a costly MIP for the aggregation step, so in practice, heuristic strategies for separating fractional points are employed. We propose to improve MIR cut generation in the context of a common scenario in applications, where constraints remain fixed but costs are varied. We present a hybr"},"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":"2408.08449","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-15T23:01:41Z","cross_cats_sorted":[],"title_canon_sha256":"6db471aae79d794ef39a544e85b10d3c7a5b53a093d26de81cee180b36b67d8f","abstract_canon_sha256":"f3fd276d3fbd0d7299b2e8362a8f16447a9eeb16df985578a2cf3448f7f20634"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:34.979829Z","signature_b64":"dF7NH+XOwn7w62oWoCDSRbTGfc0CltOTp0n8694rE9SvfSxN5myF3klbHQ9CKDc1zweVgkHhY3eZJeStFp9FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"671a2b7e5fb79d0c600e5c8f9b20020da4a50b7b3150d60a9668fccefab5602a","last_reissued_at":"2026-07-05T09:48:34.979437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:34.979437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine Learning for Optimization-Based Separation of Mixed-Integer Rounding Cuts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksandr M. Kazachkov, Arnaud Deza, Elias B. Khalil, Oscar Guaje","submitted_at":"2024-08-15T23:01:41Z","abstract_excerpt":"Mixed-integer rounding (MIR) cutting planes (cuts) are effective at improving the strength of a linear relaxation for mixed-integer linear programming (MIP) problems. The cuts in this family are derived by aggregating constraints then rounding coefficients, but finding the strongest MIR cuts requires optimizing a costly MIP for the aggregation step, so in practice, heuristic strategies for separating fractional points are employed. We propose to improve MIR cut generation in the context of a common scenario in applications, where constraints remain fixed but costs are varied. We present a hybr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08449","kind":"arxiv","version":2},"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/2408.08449/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":"2408.08449","created_at":"2026-07-05T09:48:34.979483+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.08449v2","created_at":"2026-07-05T09:48:34.979483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08449","created_at":"2026-07-05T09:48:34.979483+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4NCW7S7W6OQ","created_at":"2026-07-05T09:48:34.979483+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4NCW7S7W6OQYYAO","created_at":"2026-07-05T09:48:34.979483+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4NCW7S7","created_at":"2026-07-05T09:48:34.979483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15090","citing_title":"Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW","json":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW.json","graph_json":"https://pith.science/api/pith-number/M4NCW7S7W6OQYYAOLSHZWIACBW/graph.json","events_json":"https://pith.science/api/pith-number/M4NCW7S7W6OQYYAOLSHZWIACBW/events.json","paper":"https://pith.science/paper/M4NCW7S7"},"agent_actions":{"view_html":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW","download_json":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW.json","view_paper":"https://pith.science/paper/M4NCW7S7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.08449&json=true","fetch_graph":"https://pith.science/api/pith-number/M4NCW7S7W6OQYYAOLSHZWIACBW/graph.json","fetch_events":"https://pith.science/api/pith-number/M4NCW7S7W6OQYYAOLSHZWIACBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/action/storage_attestation","attest_author":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/action/author_attestation","sign_citation":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/action/citation_signature","submit_replication":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/action/replication_record"}},"created_at":"2026-07-05T09:48:34.979483+00:00","updated_at":"2026-07-05T09:48:34.979483+00:00"}