{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:M4NCW7S7W6OQYYAOLSHZWIACBW","short_pith_number":"pith:M4NCW7S7","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"},"canonical_sha256":"671a2b7e5fb79d0c600e5c8f9b20020da4a50b7b3150d60a9668fccefab5602a","source":{"kind":"arxiv","id":"2408.08449","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08449","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08449v2","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08449","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"M4NCW7S7W6OQ","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"pith_short_16","alias_value":"M4NCW7S7W6OQYYAO","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"pith_short_8","alias_value":"M4NCW7S7","created_at":"2026-07-05T09:48:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:M4NCW7S7W6OQYYAOLSHZWIACBW","target":"record","payload":{"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"},"canonical_sha256":"671a2b7e5fb79d0c600e5c8f9b20020da4a50b7b3150d60a9668fccefab5602a","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"},"source_kind":"arxiv","source_id":"2408.08449","source_version":2,"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-07-05T09:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjlH5ZX8qvICy7oxLYi67ZaL9zzeBCBLPan3Fiq7XMCJgIxMpjqBxeWuJzVs44dOk414PGAsRP3rUDJi0klwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:22:10.527654Z"},"content_sha256":"b9a6a5755e0ac7366ad3f2f3e0f9c826ce87f1261310f64e8a4e01c67baab340","schema_version":"1.0","event_id":"sha256:b9a6a5755e0ac7366ad3f2f3e0f9c826ce87f1261310f64e8a4e01c67baab340"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:M4NCW7S7W6OQYYAOLSHZWIACBW","target":"graph","payload":{"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"},"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-07-05T09:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bMQoh6KaxyBKw+VxZc9npW6BwFmY3IQpjgDpsfyF+g2VjpE5dhtqaIb+2Sow/9y/P4OlE96qSjdTOrJJEhwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:22:10.528068Z"},"content_sha256":"09418683702655f5db732dc14bd0e3358718d65f4c542191a541c61967c2bc78","schema_version":"1.0","event_id":"sha256:09418683702655f5db732dc14bd0e3358718d65f4c542191a541c61967c2bc78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/bundle.json","state_url":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/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-08-14T03:22:10Z","links":{"resolver":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW","bundle":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/bundle.json","state":"https://pith.science/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4NCW7S7W6OQYYAOLSHZWIACBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:M4NCW7S7W6OQYYAOLSHZWIACBW","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":"f3fd276d3fbd0d7299b2e8362a8f16447a9eeb16df985578a2cf3448f7f20634","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-15T23:01:41Z","title_canon_sha256":"6db471aae79d794ef39a544e85b10d3c7a5b53a093d26de81cee180b36b67d8f"},"schema_version":"1.0","source":{"id":"2408.08449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08449","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08449v2","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08449","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"M4NCW7S7W6OQ","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"pith_short_16","alias_value":"M4NCW7S7W6OQYYAO","created_at":"2026-07-05T09:48:34Z"},{"alias_kind":"pith_short_8","alias_value":"M4NCW7S7","created_at":"2026-07-05T09:48:34Z"}],"graph_snapshots":[{"event_id":"sha256:09418683702655f5db732dc14bd0e3358718d65f4c542191a541c61967c2bc78","target":"graph","created_at":"2026-07-05T09:48:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.08449/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aleksandr M. Kazachkov, Arnaud Deza, Elias B. Khalil, Oscar Guaje","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-15T23:01:41Z","title":"Machine Learning for Optimization-Based Separation of Mixed-Integer Rounding Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08449","kind":"arxiv","version":2},"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:b9a6a5755e0ac7366ad3f2f3e0f9c826ce87f1261310f64e8a4e01c67baab340","target":"record","created_at":"2026-07-05T09:48:34Z","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":"f3fd276d3fbd0d7299b2e8362a8f16447a9eeb16df985578a2cf3448f7f20634","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-15T23:01:41Z","title_canon_sha256":"6db471aae79d794ef39a544e85b10d3c7a5b53a093d26de81cee180b36b67d8f"},"schema_version":"1.0","source":{"id":"2408.08449","kind":"arxiv","version":2}},"canonical_sha256":"671a2b7e5fb79d0c600e5c8f9b20020da4a50b7b3150d60a9668fccefab5602a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"671a2b7e5fb79d0c600e5c8f9b20020da4a50b7b3150d60a9668fccefab5602a","first_computed_at":"2026-07-05T09:48:34.979437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:48:34.979437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dF7NH+XOwn7w62oWoCDSRbTGfc0CltOTp0n8694rE9SvfSxN5myF3klbHQ9CKDc1zweVgkHhY3eZJeStFp9FAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:48:34.979829Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.08449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9a6a5755e0ac7366ad3f2f3e0f9c826ce87f1261310f64e8a4e01c67baab340","sha256:09418683702655f5db732dc14bd0e3358718d65f4c542191a541c61967c2bc78"],"state_sha256":"a853ab6408b42b2efd85463fbcde816c4a2f5b5df923569cd77da4a4fddb59f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qb0tXNkVHNgd2qYYY4xJEqqrh/+EQ5ETaLMpd62wjNblGGvIucBbw2sR27f59NPoz4PAr3s2eORN2udKRy2wBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T03:22:10.530827Z","bundle_sha256":"942c711d7fac9feae9b5f8ebe985d1859a28719426877f4fe8229cddb74bf953"}}