{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PO3VTAVRHEZZTFTVWRWFCQONKS","short_pith_number":"pith:PO3VTAVR","schema_version":"1.0","canonical_sha256":"7bb75982b13933999675b46c5141cd5489254781e8572574f4da7a7e51dcf78f","source":{"kind":"arxiv","id":"1805.02782","version":1},"attestation_state":"computed","paper":{"title":"Theoretical challenges towards cutting-plane selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marco Molinaro, Santanu S. Dey","submitted_at":"2018-05-07T23:40:36Z","abstract_excerpt":"While many classes of cutting-planes are at the disposal of integer programming solvers, our scientific understanding is far from complete with regards to cutting-plane selection, i.e., the task of selecting a portfolio of cutting-planes to be added to the LP relaxation at a given node of the branch-and-bound tree. In this paper we review the different classes of cutting-planes available, known theoretical results about their relative strength, important issues pertaining to cut selection, and discuss some possible new directions to be pursued in order to accomplish cutting-plane selection in "},"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":"1805.02782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-07T23:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"8ce90113dfc2ed8c35a28c6a15fbc8e66b8c028190b347e2b8acbdc18c306d54","abstract_canon_sha256":"57c8411cec5348f86b042039fff7322ef2887cda63828a27b608a5ff6e06bc12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:35.723261Z","signature_b64":"GMksT3MEw/2sVsO6Z+ljs3Llk289hZhnmWZs31SIMc8KYZqbIicpPoOhdJhZDjL7Od9+x+6hcqc2DxjUYr2bBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bb75982b13933999675b46c5141cd5489254781e8572574f4da7a7e51dcf78f","last_reissued_at":"2026-05-18T00:16:35.722623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:35.722623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Theoretical challenges towards cutting-plane selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marco Molinaro, Santanu S. Dey","submitted_at":"2018-05-07T23:40:36Z","abstract_excerpt":"While many classes of cutting-planes are at the disposal of integer programming solvers, our scientific understanding is far from complete with regards to cutting-plane selection, i.e., the task of selecting a portfolio of cutting-planes to be added to the LP relaxation at a given node of the branch-and-bound tree. In this paper we review the different classes of cutting-planes available, known theoretical results about their relative strength, important issues pertaining to cut selection, and discuss some possible new directions to be pursued in order to accomplish cutting-plane selection in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02782","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":""},"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":"1805.02782","created_at":"2026-05-18T00:16:35.722724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02782v1","created_at":"2026-05-18T00:16:35.722724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02782","created_at":"2026-05-18T00:16:35.722724+00:00"},{"alias_kind":"pith_short_12","alias_value":"PO3VTAVRHEZZ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PO3VTAVRHEZZTFTV","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PO3VTAVR","created_at":"2026-05-18T12:32:46.962924+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/PO3VTAVRHEZZTFTVWRWFCQONKS","json":"https://pith.science/pith/PO3VTAVRHEZZTFTVWRWFCQONKS.json","graph_json":"https://pith.science/api/pith-number/PO3VTAVRHEZZTFTVWRWFCQONKS/graph.json","events_json":"https://pith.science/api/pith-number/PO3VTAVRHEZZTFTVWRWFCQONKS/events.json","paper":"https://pith.science/paper/PO3VTAVR"},"agent_actions":{"view_html":"https://pith.science/pith/PO3VTAVRHEZZTFTVWRWFCQONKS","download_json":"https://pith.science/pith/PO3VTAVRHEZZTFTVWRWFCQONKS.json","view_paper":"https://pith.science/paper/PO3VTAVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02782&json=true","fetch_graph":"https://pith.science/api/pith-number/PO3VTAVRHEZZTFTVWRWFCQONKS/graph.json","fetch_events":"https://pith.science/api/pith-number/PO3VTAVRHEZZTFTVWRWFCQONKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PO3VTAVRHEZZTFTVWRWFCQONKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PO3VTAVRHEZZTFTVWRWFCQONKS/action/storage_attestation","attest_author":"https://pith.science/pith/PO3VTAVRHEZZTFTVWRWFCQONKS/action/author_attestation","sign_citation":"https://pith.science/pith/PO3VTAVRHEZZTFTVWRWFCQONKS/action/citation_signature","submit_replication":"https://pith.science/pith/PO3VTAVRHEZZTFTVWRWFCQONKS/action/replication_record"}},"created_at":"2026-05-18T00:16:35.722724+00:00","updated_at":"2026-05-18T00:16:35.722724+00:00"}