{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SANXBKUI5BSORUHD6YZUL4WC4I","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":"b018008b462dcebda436c14d2d99c608d9097a1e37e925481b206b9fd8c4c8ff","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-11T00:17:17Z","title_canon_sha256":"e8d32b44085dcfeb832fab12a2ca49f07458ad265d84a14b7a7691c221796a80"},"schema_version":"1.0","source":{"id":"2011.05474","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05474","created_at":"2026-07-05T02:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05474v4","created_at":"2026-07-05T02:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05474","created_at":"2026-07-05T02:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"SANXBKUI5BSO","created_at":"2026-07-05T02:41:29Z"},{"alias_kind":"pith_short_16","alias_value":"SANXBKUI5BSORUHD","created_at":"2026-07-05T02:41:29Z"},{"alias_kind":"pith_short_8","alias_value":"SANXBKUI","created_at":"2026-07-05T02:41:29Z"}],"graph_snapshots":[{"event_id":"sha256:6ff9db2d363239dc2f384123cb85e8bfaa80d75ff8476db7cff9ba0a256c66cf","target":"graph","created_at":"2026-07-05T02:41:29Z","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/2011.05474/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amitabh Basu, Hongyi Jiang, Marco Di Summa, Michele Conforti","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-11T00:17:17Z","title":"Complexity of branch-and-bound and cutting planes in mixed-integer optimization -- II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05474","kind":"arxiv","version":4},"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:7752a829ffd53fdc62dc6fd1ec3e14bfc3dd62c8735395b79c70c05b660a1915","target":"record","created_at":"2026-07-05T02:41:29Z","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":"b018008b462dcebda436c14d2d99c608d9097a1e37e925481b206b9fd8c4c8ff","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-11T00:17:17Z","title_canon_sha256":"e8d32b44085dcfeb832fab12a2ca49f07458ad265d84a14b7a7691c221796a80"},"schema_version":"1.0","source":{"id":"2011.05474","kind":"arxiv","version":4}},"canonical_sha256":"901b70aa88e864e8d0e3f63345f2c2e21743605ed02635e016c3f90ba5632739","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"901b70aa88e864e8d0e3f63345f2c2e21743605ed02635e016c3f90ba5632739","first_computed_at":"2026-07-05T02:41:29.044652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:41:29.044652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+lqojH8WnCaasRzSMawMqBeFEGuqThhOcYlSNdxvbK5NfXWySkFb3YU8ni/B1Y+xO1Qr29+vD8I7o8WZ/Xh0Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:41:29.045097Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.05474","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7752a829ffd53fdc62dc6fd1ec3e14bfc3dd62c8735395b79c70c05b660a1915","sha256:6ff9db2d363239dc2f384123cb85e8bfaa80d75ff8476db7cff9ba0a256c66cf"],"state_sha256":"8f5ca63587af3c5aa6f0bd6a0b44d61e7c8957207a8e3f129915210063b61f1d"}