{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:P5I5SRN7IBZQXSNB572GKCWSHU","short_pith_number":"pith:P5I5SRN7","canonical_record":{"source":{"id":"2105.13645","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-28T07:48:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ad89bcee4114776024b2c6b9c13c70856df207ad14f6de879587eb0cf64b2639","abstract_canon_sha256":"6831f22669076c65bc839e79e9143e018938ef418807f60b0fb8fe874fca7e8f"},"schema_version":"1.0"},"canonical_sha256":"7f51d945bf40730bc9a1eff4650ad23d0055851a1eff1a21944f574ae9a519aa","source":{"kind":"arxiv","id":"2105.13645","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.13645","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"2105.13645v4","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13645","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"P5I5SRN7IBZQ","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"pith_short_16","alias_value":"P5I5SRN7IBZQXSNB","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"pith_short_8","alias_value":"P5I5SRN7","created_at":"2026-07-05T03:20:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:P5I5SRN7IBZQXSNB572GKCWSHU","target":"record","payload":{"canonical_record":{"source":{"id":"2105.13645","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-28T07:48:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ad89bcee4114776024b2c6b9c13c70856df207ad14f6de879587eb0cf64b2639","abstract_canon_sha256":"6831f22669076c65bc839e79e9143e018938ef418807f60b0fb8fe874fca7e8f"},"schema_version":"1.0"},"canonical_sha256":"7f51d945bf40730bc9a1eff4650ad23d0055851a1eff1a21944f574ae9a519aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:55.993591Z","signature_b64":"NZa2eGNVwAILnYzVD8ZnNnfkn4dcldH2NaK82G3MosmNxR34raEtVYa5yqMDai8iF6MpiCH4PXXM5mXetVmuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f51d945bf40730bc9a1eff4650ad23d0055851a1eff1a21944f574ae9a519aa","last_reissued_at":"2026-07-05T03:20:55.993167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:55.993167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.13645","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjNBvFt2b23WnDIvH4teofwSl/N+mm86v2tZLiYfP927yVMRxYEpxEfXB9o4o9+nTsoOatebBCit/0EFy9jvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:27:28.811685Z"},"content_sha256":"e414491569257a18b8b27a66f68f083417b06713cc8caf9140c6796116239157","schema_version":"1.0","event_id":"sha256:e414491569257a18b8b27a66f68f083417b06713cc8caf9140c6796116239157"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:P5I5SRN7IBZQXSNB572GKCWSHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Select Cuts for Efficient Mixed-Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Furui Liu, Hui-Ling Zhen, Jianye Hao, Jun Wang, Kerong Wang, Mingxuan Yuan, Weinan Zhang, Yong Yu, Zeren Huang","submitted_at":"2021-05-28T07:48:34Z","abstract_excerpt":"Cutting plane methods play a significant role in modern solvers for tackling mixed-integer programming (MIP) problems. Proper selection of cuts would remove infeasible solutions in the early stage, thus largely reducing the computational burden without hurting the solution accuracy. However, the major cut selection approaches heavily rely on heuristics, which strongly depend on the specific problem at hand and thus limit their generalization capability. In this paper, we propose a data-driven and generalizable cut selection approach, named Cut Ranking, in the settings of multiple instance lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13645","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/2105.13645/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZ051Bquhz+b8zujAnF1yPyTFsMvRX6vGPN1MSvpaapKRkpiSKOue7gIVZ8prK/ivyt0eP0MvEIsPsLtPbyjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:27:28.812056Z"},"content_sha256":"95fa894bf7a3933a5a413a6d5a143a64e752b91efaac0c6fa193490fa484e143","schema_version":"1.0","event_id":"sha256:95fa894bf7a3933a5a413a6d5a143a64e752b91efaac0c6fa193490fa484e143"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5I5SRN7IBZQXSNB572GKCWSHU/bundle.json","state_url":"https://pith.science/pith/P5I5SRN7IBZQXSNB572GKCWSHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5I5SRN7IBZQXSNB572GKCWSHU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T09:27:28Z","links":{"resolver":"https://pith.science/pith/P5I5SRN7IBZQXSNB572GKCWSHU","bundle":"https://pith.science/pith/P5I5SRN7IBZQXSNB572GKCWSHU/bundle.json","state":"https://pith.science/pith/P5I5SRN7IBZQXSNB572GKCWSHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5I5SRN7IBZQXSNB572GKCWSHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:P5I5SRN7IBZQXSNB572GKCWSHU","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":"6831f22669076c65bc839e79e9143e018938ef418807f60b0fb8fe874fca7e8f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-28T07:48:34Z","title_canon_sha256":"ad89bcee4114776024b2c6b9c13c70856df207ad14f6de879587eb0cf64b2639"},"schema_version":"1.0","source":{"id":"2105.13645","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.13645","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"2105.13645v4","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13645","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"P5I5SRN7IBZQ","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"pith_short_16","alias_value":"P5I5SRN7IBZQXSNB","created_at":"2026-07-05T03:20:55Z"},{"alias_kind":"pith_short_8","alias_value":"P5I5SRN7","created_at":"2026-07-05T03:20:55Z"}],"graph_snapshots":[{"event_id":"sha256:95fa894bf7a3933a5a413a6d5a143a64e752b91efaac0c6fa193490fa484e143","target":"graph","created_at":"2026-07-05T03:20:55Z","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/2105.13645/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cutting plane methods play a significant role in modern solvers for tackling mixed-integer programming (MIP) problems. Proper selection of cuts would remove infeasible solutions in the early stage, thus largely reducing the computational burden without hurting the solution accuracy. However, the major cut selection approaches heavily rely on heuristics, which strongly depend on the specific problem at hand and thus limit their generalization capability. In this paper, we propose a data-driven and generalizable cut selection approach, named Cut Ranking, in the settings of multiple instance lear","authors_text":"Furui Liu, Hui-Ling Zhen, Jianye Hao, Jun Wang, Kerong Wang, Mingxuan Yuan, Weinan Zhang, Yong Yu, Zeren Huang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-28T07:48:34Z","title":"Learning to Select Cuts for Efficient Mixed-Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13645","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:e414491569257a18b8b27a66f68f083417b06713cc8caf9140c6796116239157","target":"record","created_at":"2026-07-05T03:20:55Z","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":"6831f22669076c65bc839e79e9143e018938ef418807f60b0fb8fe874fca7e8f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-28T07:48:34Z","title_canon_sha256":"ad89bcee4114776024b2c6b9c13c70856df207ad14f6de879587eb0cf64b2639"},"schema_version":"1.0","source":{"id":"2105.13645","kind":"arxiv","version":4}},"canonical_sha256":"7f51d945bf40730bc9a1eff4650ad23d0055851a1eff1a21944f574ae9a519aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f51d945bf40730bc9a1eff4650ad23d0055851a1eff1a21944f574ae9a519aa","first_computed_at":"2026-07-05T03:20:55.993167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:20:55.993167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NZa2eGNVwAILnYzVD8ZnNnfkn4dcldH2NaK82G3MosmNxR34raEtVYa5yqMDai8iF6MpiCH4PXXM5mXetVmuBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:20:55.993591Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.13645","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e414491569257a18b8b27a66f68f083417b06713cc8caf9140c6796116239157","sha256:95fa894bf7a3933a5a413a6d5a143a64e752b91efaac0c6fa193490fa484e143"],"state_sha256":"9130f9ff60b057702e6cb72862644f7f80095660d3d53d4f92cabe5b559dd471"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l404Drz+2phCMQkuO50QuSIDy7PY5e1cq/g7HtFyGRmM1jmsIh3wy0N0L4dNEyCOW0Ip0IGQt3pwJL9xG1aBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:27:28.813988Z","bundle_sha256":"2857988545d4fd7caaf44d946646a045876fc6e27c62e96d432c128ba2fcec63"}}