{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MOUO5RIFSTZE3DHCBLGHDEXI7J","short_pith_number":"pith:MOUO5RIF","schema_version":"1.0","canonical_sha256":"63a8eec50594f24d8ce20acc7192e8fa60d40b8d7ebf8f6a2238f94e14e2d4fd","source":{"kind":"arxiv","id":"2202.10962","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Cut Selection in Mixed-Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Felipe Serrano, Mark Turner, Michael Winkler, Thorsten Koch","submitted_at":"2022-02-22T15:07:33Z","abstract_excerpt":"Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance. These solvers have millions of parameter combinations, and so are excellent candidates for parameter tuning. Cut selection scoring rules are usually weighted sums of different measurements, where the weights are parameters. We present a parametric family of mixed-integer linear programs together with infinitely many family-wide valid cuts. Some of these cuts can induce integer optimal solutions directly"},"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":"2202.10962","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-22T15:07:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1aa057271ce5b9a2314cbcfe8530a23de9a20c6bd1e1053125f26ac042d50c1d","abstract_canon_sha256":"dca28d0221e50761b09e76f6b37d319b883be1ce095788dc3ee057f38d524b38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:47.904401Z","signature_b64":"ii7bNnubo+3ktWlOSJtFF/6Y/8+UUJr014XQXq8ry7zKw1go03fFpmO5zyI7vQZTtwAaokSh4/yMcH9bLQiDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63a8eec50594f24d8ce20acc7192e8fa60d40b8d7ebf8f6a2238f94e14e2d4fd","last_reissued_at":"2026-07-05T05:44:47.903935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:47.903935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Cut Selection in Mixed-Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Felipe Serrano, Mark Turner, Michael Winkler, Thorsten Koch","submitted_at":"2022-02-22T15:07:33Z","abstract_excerpt":"Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance. These solvers have millions of parameter combinations, and so are excellent candidates for parameter tuning. Cut selection scoring rules are usually weighted sums of different measurements, where the weights are parameters. We present a parametric family of mixed-integer linear programs together with infinitely many family-wide valid cuts. Some of these cuts can induce integer optimal solutions directly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10962","kind":"arxiv","version":3},"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/2202.10962/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":"2202.10962","created_at":"2026-07-05T05:44:47.903991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.10962v3","created_at":"2026-07-05T05:44:47.903991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10962","created_at":"2026-07-05T05:44:47.903991+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOUO5RIFSTZE","created_at":"2026-07-05T05:44:47.903991+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOUO5RIFSTZE3DHC","created_at":"2026-07-05T05:44:47.903991+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOUO5RIF","created_at":"2026-07-05T05:44:47.903991+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":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J","json":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J.json","graph_json":"https://pith.science/api/pith-number/MOUO5RIFSTZE3DHCBLGHDEXI7J/graph.json","events_json":"https://pith.science/api/pith-number/MOUO5RIFSTZE3DHCBLGHDEXI7J/events.json","paper":"https://pith.science/paper/MOUO5RIF"},"agent_actions":{"view_html":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J","download_json":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J.json","view_paper":"https://pith.science/paper/MOUO5RIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.10962&json=true","fetch_graph":"https://pith.science/api/pith-number/MOUO5RIFSTZE3DHCBLGHDEXI7J/graph.json","fetch_events":"https://pith.science/api/pith-number/MOUO5RIFSTZE3DHCBLGHDEXI7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J/action/storage_attestation","attest_author":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J/action/author_attestation","sign_citation":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J/action/citation_signature","submit_replication":"https://pith.science/pith/MOUO5RIFSTZE3DHCBLGHDEXI7J/action/replication_record"}},"created_at":"2026-07-05T05:44:47.903991+00:00","updated_at":"2026-07-05T05:44:47.903991+00:00"}