{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S2VUVFY3S7FKO5AOJDQJEEM4UM","short_pith_number":"pith:S2VUVFY3","schema_version":"1.0","canonical_sha256":"96ab4a971b97caa7740e48e092119ca31e326598ec9d439cf5d36f8ea8e854f8","source":{"kind":"arxiv","id":"2503.15847","version":1},"attestation_state":"computed","paper":{"title":"Beyond Local Selection: Global Cut Selection for Enhanced Mixed-Integer Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Feng Wu, Shaoang Li, Shuli Zeng, Sijia Zhang, Xiang-Yang Li","submitted_at":"2025-03-20T04:59:18Z","abstract_excerpt":"In mixed-integer programming (MIP) solvers, cutting planes are essential for Branch-and-Cut (B&C) algorithms as they reduce the search space and accelerate the solving process. Traditional methods rely on hard-coded heuristics for cut plane selection but fail to leverage problem-specific structural features. Recent machine learning approaches use neural networks for cut selection but focus narrowly on the efficiency of single-node within the B&C algorithm, without considering the broader contextual information. To address this, we propose Global Cut Selection (GCS), which uses a bipartite grap"},"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":"2503.15847","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-20T04:59:18Z","cross_cats_sorted":[],"title_canon_sha256":"55dffe28d983c162f80bd2245a31fe09cb60a1f3565d5724551befb0dc19eab2","abstract_canon_sha256":"0b8618e5da0bb0b5ee9fd3f9630652efbf42286f048fae9a25119bec34e2c66c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:35:59.903529Z","signature_b64":"ZM+ZrrOlJ+il1RYnVlsCjUo1DgxGJrmy2id6BNjekYePqBndFMnCI5davglDPQHosvtEuLQLwkmTH9/Kd/5QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96ab4a971b97caa7740e48e092119ca31e326598ec9d439cf5d36f8ea8e854f8","last_reissued_at":"2026-07-05T10:35:59.902415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:35:59.902415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Local Selection: Global Cut Selection for Enhanced Mixed-Integer Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Feng Wu, Shaoang Li, Shuli Zeng, Sijia Zhang, Xiang-Yang Li","submitted_at":"2025-03-20T04:59:18Z","abstract_excerpt":"In mixed-integer programming (MIP) solvers, cutting planes are essential for Branch-and-Cut (B&C) algorithms as they reduce the search space and accelerate the solving process. Traditional methods rely on hard-coded heuristics for cut plane selection but fail to leverage problem-specific structural features. Recent machine learning approaches use neural networks for cut selection but focus narrowly on the efficiency of single-node within the B&C algorithm, without considering the broader contextual information. To address this, we propose Global Cut Selection (GCS), which uses a bipartite grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.15847","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/2503.15847/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":"2503.15847","created_at":"2026-07-05T10:35:59.902537+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.15847v1","created_at":"2026-07-05T10:35:59.902537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.15847","created_at":"2026-07-05T10:35:59.902537+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2VUVFY3S7FK","created_at":"2026-07-05T10:35:59.902537+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2VUVFY3S7FKO5AO","created_at":"2026-07-05T10:35:59.902537+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2VUVFY3","created_at":"2026-07-05T10:35:59.902537+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/S2VUVFY3S7FKO5AOJDQJEEM4UM","json":"https://pith.science/pith/S2VUVFY3S7FKO5AOJDQJEEM4UM.json","graph_json":"https://pith.science/api/pith-number/S2VUVFY3S7FKO5AOJDQJEEM4UM/graph.json","events_json":"https://pith.science/api/pith-number/S2VUVFY3S7FKO5AOJDQJEEM4UM/events.json","paper":"https://pith.science/paper/S2VUVFY3"},"agent_actions":{"view_html":"https://pith.science/pith/S2VUVFY3S7FKO5AOJDQJEEM4UM","download_json":"https://pith.science/pith/S2VUVFY3S7FKO5AOJDQJEEM4UM.json","view_paper":"https://pith.science/paper/S2VUVFY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.15847&json=true","fetch_graph":"https://pith.science/api/pith-number/S2VUVFY3S7FKO5AOJDQJEEM4UM/graph.json","fetch_events":"https://pith.science/api/pith-number/S2VUVFY3S7FKO5AOJDQJEEM4UM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2VUVFY3S7FKO5AOJDQJEEM4UM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2VUVFY3S7FKO5AOJDQJEEM4UM/action/storage_attestation","attest_author":"https://pith.science/pith/S2VUVFY3S7FKO5AOJDQJEEM4UM/action/author_attestation","sign_citation":"https://pith.science/pith/S2VUVFY3S7FKO5AOJDQJEEM4UM/action/citation_signature","submit_replication":"https://pith.science/pith/S2VUVFY3S7FKO5AOJDQJEEM4UM/action/replication_record"}},"created_at":"2026-07-05T10:35:59.902537+00:00","updated_at":"2026-07-05T10:35:59.902537+00:00"}