{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SANXBKUI5BSORUHD6YZUL4WC4I","short_pith_number":"pith:SANXBKUI","schema_version":"1.0","canonical_sha256":"901b70aa88e864e8d0e3f63345f2c2e21743605ed02635e016c3f90ba5632739","source":{"kind":"arxiv","id":"2011.05474","version":4},"attestation_state":"computed","paper":{"title":"Complexity of branch-and-bound and cutting planes in mixed-integer optimization -- II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Amitabh Basu, Hongyi Jiang, Marco Di Summa, Michele Conforti","submitted_at":"2020-11-11T00:17:17Z","abstract_excerpt":"We study the complexity of cutting planes and branching schemes from a theoretical point of view. We give some rigorous underpinnings to the empirically observed phenomenon that combining cutting planes and branching into a branch-and-cut framework can be orders of magnitude more efficient than employing these tools on their own. In particular, we give general conditions under which a cutting plane strategy and a branching scheme give a provably exponential advantage in efficiency when combined into branch-and-cut. The efficiency of these algorithms is evaluated using two concrete measures: nu"},"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":"2011.05474","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-11T00:17:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e8d32b44085dcfeb832fab12a2ca49f07458ad265d84a14b7a7691c221796a80","abstract_canon_sha256":"b018008b462dcebda436c14d2d99c608d9097a1e37e925481b206b9fd8c4c8ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:29.045097Z","signature_b64":"+lqojH8WnCaasRzSMawMqBeFEGuqThhOcYlSNdxvbK5NfXWySkFb3YU8ni/B1Y+xO1Qr29+vD8I7o8WZ/Xh0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"901b70aa88e864e8d0e3f63345f2c2e21743605ed02635e016c3f90ba5632739","last_reissued_at":"2026-07-05T02:41:29.044652Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:29.044652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of branch-and-bound and cutting planes in mixed-integer optimization -- II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Amitabh Basu, Hongyi Jiang, Marco Di Summa, Michele Conforti","submitted_at":"2020-11-11T00:17:17Z","abstract_excerpt":"We study the complexity of cutting planes and branching schemes from a theoretical point of view. We give some rigorous underpinnings to the empirically observed phenomenon that combining cutting planes and branching into a branch-and-cut framework can be orders of magnitude more efficient than employing these tools on their own. In particular, we give general conditions under which a cutting plane strategy and a branching scheme give a provably exponential advantage in efficiency when combined into branch-and-cut. The efficiency of these algorithms is evaluated using two concrete measures: nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05474","kind":"arxiv","version":4},"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/2011.05474/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":"2011.05474","created_at":"2026-07-05T02:41:29.044714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.05474v4","created_at":"2026-07-05T02:41:29.044714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05474","created_at":"2026-07-05T02:41:29.044714+00:00"},{"alias_kind":"pith_short_12","alias_value":"SANXBKUI5BSO","created_at":"2026-07-05T02:41:29.044714+00:00"},{"alias_kind":"pith_short_16","alias_value":"SANXBKUI5BSORUHD","created_at":"2026-07-05T02:41:29.044714+00:00"},{"alias_kind":"pith_short_8","alias_value":"SANXBKUI","created_at":"2026-07-05T02:41:29.044714+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/SANXBKUI5BSORUHD6YZUL4WC4I","json":"https://pith.science/pith/SANXBKUI5BSORUHD6YZUL4WC4I.json","graph_json":"https://pith.science/api/pith-number/SANXBKUI5BSORUHD6YZUL4WC4I/graph.json","events_json":"https://pith.science/api/pith-number/SANXBKUI5BSORUHD6YZUL4WC4I/events.json","paper":"https://pith.science/paper/SANXBKUI"},"agent_actions":{"view_html":"https://pith.science/pith/SANXBKUI5BSORUHD6YZUL4WC4I","download_json":"https://pith.science/pith/SANXBKUI5BSORUHD6YZUL4WC4I.json","view_paper":"https://pith.science/paper/SANXBKUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.05474&json=true","fetch_graph":"https://pith.science/api/pith-number/SANXBKUI5BSORUHD6YZUL4WC4I/graph.json","fetch_events":"https://pith.science/api/pith-number/SANXBKUI5BSORUHD6YZUL4WC4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SANXBKUI5BSORUHD6YZUL4WC4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SANXBKUI5BSORUHD6YZUL4WC4I/action/storage_attestation","attest_author":"https://pith.science/pith/SANXBKUI5BSORUHD6YZUL4WC4I/action/author_attestation","sign_citation":"https://pith.science/pith/SANXBKUI5BSORUHD6YZUL4WC4I/action/citation_signature","submit_replication":"https://pith.science/pith/SANXBKUI5BSORUHD6YZUL4WC4I/action/replication_record"}},"created_at":"2026-07-05T02:41:29.044714+00:00","updated_at":"2026-07-05T02:41:29.044714+00:00"}