{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SEY7RLHRZFMFEMOSNNBEEG22KL","short_pith_number":"pith:SEY7RLHR","schema_version":"1.0","canonical_sha256":"9131f8acf1c9585231d26b42421b5a52c786f26cab2443e421d9d0dbc801ee78","source":{"kind":"arxiv","id":"2501.00307","version":1},"attestation_state":"computed","paper":{"title":"Fast and Interpretable Mixed-Integer Linear Program Solving by Learning Model Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Can Chen, Jiahui Duan, Jiajun Li, Tao Zhong, Vincent Chau, Wanyuan Wang, WeiWei Wu, Xiongwei Han, Yixuan Li","submitted_at":"2024-12-31T06:50:42Z","abstract_excerpt":"By exploiting the correlation between the structure and the solution of Mixed-Integer Linear Programming (MILP), Machine Learning (ML) has become a promising method for solving large-scale MILP problems. Existing ML-based MILP solvers mainly focus on end-to-end solution learning, which suffers from the scalability issue due to the high dimensionality of the solution space. Instead of directly learning the optimal solution, this paper aims to learn a reduced and equivalent model of the original MILP as an intermediate step. The reduced model often corresponds to interpretable operations and is "},"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":"2501.00307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-31T06:50:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ee69caf625c8d183e249d27fcb705ad53b2af2cd7f05ff32df306b58061cd127","abstract_canon_sha256":"5b44d5298004bc665d3899f9b4240c795ce3e725711681b6565cca4be858c73b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:42.585370Z","signature_b64":"5hqNIshMjuu9LkDXFQPLLmq0tcfuczgxJ16kZoPwbOsjF4weBq8Izcb9Qno+6xRCAKyicb0Rg7lODZlb/F3GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9131f8acf1c9585231d26b42421b5a52c786f26cab2443e421d9d0dbc801ee78","last_reissued_at":"2026-07-05T09:55:42.584916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:42.584916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Interpretable Mixed-Integer Linear Program Solving by Learning Model Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Can Chen, Jiahui Duan, Jiajun Li, Tao Zhong, Vincent Chau, Wanyuan Wang, WeiWei Wu, Xiongwei Han, Yixuan Li","submitted_at":"2024-12-31T06:50:42Z","abstract_excerpt":"By exploiting the correlation between the structure and the solution of Mixed-Integer Linear Programming (MILP), Machine Learning (ML) has become a promising method for solving large-scale MILP problems. Existing ML-based MILP solvers mainly focus on end-to-end solution learning, which suffers from the scalability issue due to the high dimensionality of the solution space. Instead of directly learning the optimal solution, this paper aims to learn a reduced and equivalent model of the original MILP as an intermediate step. The reduced model often corresponds to interpretable operations and is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00307","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/2501.00307/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":"2501.00307","created_at":"2026-07-05T09:55:42.584974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00307v1","created_at":"2026-07-05T09:55:42.584974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00307","created_at":"2026-07-05T09:55:42.584974+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEY7RLHRZFMF","created_at":"2026-07-05T09:55:42.584974+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEY7RLHRZFMFEMOS","created_at":"2026-07-05T09:55:42.584974+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEY7RLHR","created_at":"2026-07-05T09:55:42.584974+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/SEY7RLHRZFMFEMOSNNBEEG22KL","json":"https://pith.science/pith/SEY7RLHRZFMFEMOSNNBEEG22KL.json","graph_json":"https://pith.science/api/pith-number/SEY7RLHRZFMFEMOSNNBEEG22KL/graph.json","events_json":"https://pith.science/api/pith-number/SEY7RLHRZFMFEMOSNNBEEG22KL/events.json","paper":"https://pith.science/paper/SEY7RLHR"},"agent_actions":{"view_html":"https://pith.science/pith/SEY7RLHRZFMFEMOSNNBEEG22KL","download_json":"https://pith.science/pith/SEY7RLHRZFMFEMOSNNBEEG22KL.json","view_paper":"https://pith.science/paper/SEY7RLHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00307&json=true","fetch_graph":"https://pith.science/api/pith-number/SEY7RLHRZFMFEMOSNNBEEG22KL/graph.json","fetch_events":"https://pith.science/api/pith-number/SEY7RLHRZFMFEMOSNNBEEG22KL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEY7RLHRZFMFEMOSNNBEEG22KL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEY7RLHRZFMFEMOSNNBEEG22KL/action/storage_attestation","attest_author":"https://pith.science/pith/SEY7RLHRZFMFEMOSNNBEEG22KL/action/author_attestation","sign_citation":"https://pith.science/pith/SEY7RLHRZFMFEMOSNNBEEG22KL/action/citation_signature","submit_replication":"https://pith.science/pith/SEY7RLHRZFMFEMOSNNBEEG22KL/action/replication_record"}},"created_at":"2026-07-05T09:55:42.584974+00:00","updated_at":"2026-07-05T09:55:42.584974+00:00"}