{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:B4EV5NCB3WPSHIEYVFXR7LEHOY","short_pith_number":"pith:B4EV5NCB","schema_version":"1.0","canonical_sha256":"0f095eb441dd9f23a098a96f1fac8776021f652d7905620062d650457b8db8ff","source":{"kind":"arxiv","id":"2206.11618","version":1},"attestation_state":"computed","paper":{"title":"Learning to Use Local Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gregor Hendel, Matteo Francobaldi, Timo Berthold","submitted_at":"2022-06-23T11:02:10Z","abstract_excerpt":"An essential component in modern solvers for mixed-integer (linear) programs (MIPs) is the separation of additional inequalities (cutting planes) to tighten the linear programming relaxation. Various algorithmic decisions are necessary when integrating cutting plane methods into a branch-and-bound (B&B) solver as there is always the trade-off between the efficiency of the cuts and their costs, given that they tend to slow down the solution time of the relaxation. One of the most crucial questions is: Should cuts only be generated globally at the root or also locally at nodes of the tree? We ad"},"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":"2206.11618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-06-23T11:02:10Z","cross_cats_sorted":[],"title_canon_sha256":"86d53025426b993cefbafab9b106a8f392ce907f8644d4d9f999ba28ec01a7be","abstract_canon_sha256":"7773bb069c3ec4f167040a3d629545551617d5e0bcb7c7a7d6656f6b50c416fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:21.961191Z","signature_b64":"2TI3FZILPICg/tTX7iwD+tjphrSsDMyAk9zqDnP91ektxt5eeMXbn1auJOWBan8k0o3bRyQZ6ZsOhyZ2J77uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f095eb441dd9f23a098a96f1fac8776021f652d7905620062d650457b8db8ff","last_reissued_at":"2026-07-05T04:34:21.960721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:21.960721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Use Local Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gregor Hendel, Matteo Francobaldi, Timo Berthold","submitted_at":"2022-06-23T11:02:10Z","abstract_excerpt":"An essential component in modern solvers for mixed-integer (linear) programs (MIPs) is the separation of additional inequalities (cutting planes) to tighten the linear programming relaxation. Various algorithmic decisions are necessary when integrating cutting plane methods into a branch-and-bound (B&B) solver as there is always the trade-off between the efficiency of the cuts and their costs, given that they tend to slow down the solution time of the relaxation. One of the most crucial questions is: Should cuts only be generated globally at the root or also locally at nodes of the tree? We ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.11618","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/2206.11618/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":"2206.11618","created_at":"2026-07-05T04:34:21.960778+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.11618v1","created_at":"2026-07-05T04:34:21.960778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.11618","created_at":"2026-07-05T04:34:21.960778+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4EV5NCB3WPS","created_at":"2026-07-05T04:34:21.960778+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4EV5NCB3WPSHIEY","created_at":"2026-07-05T04:34:21.960778+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4EV5NCB","created_at":"2026-07-05T04:34:21.960778+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":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY","json":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY.json","graph_json":"https://pith.science/api/pith-number/B4EV5NCB3WPSHIEYVFXR7LEHOY/graph.json","events_json":"https://pith.science/api/pith-number/B4EV5NCB3WPSHIEYVFXR7LEHOY/events.json","paper":"https://pith.science/paper/B4EV5NCB"},"agent_actions":{"view_html":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY","download_json":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY.json","view_paper":"https://pith.science/paper/B4EV5NCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.11618&json=true","fetch_graph":"https://pith.science/api/pith-number/B4EV5NCB3WPSHIEYVFXR7LEHOY/graph.json","fetch_events":"https://pith.science/api/pith-number/B4EV5NCB3WPSHIEYVFXR7LEHOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY/action/storage_attestation","attest_author":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY/action/author_attestation","sign_citation":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY/action/citation_signature","submit_replication":"https://pith.science/pith/B4EV5NCB3WPSHIEYVFXR7LEHOY/action/replication_record"}},"created_at":"2026-07-05T04:34:21.960778+00:00","updated_at":"2026-07-05T04:34:21.960778+00:00"}