{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VMK3YMKMF4HJEIFJU7XW4R5PGF","short_pith_number":"pith:VMK3YMKM","schema_version":"1.0","canonical_sha256":"ab15bc314c2f0e9220a9a7ef6e47af315018bd243bb81394609b2d1690eef262","source":{"kind":"arxiv","id":"2402.10172","version":1},"attestation_state":"computed","paper":{"title":"OptiMUS: Scalable Optimization Modeling with (MI)LP Solvers and Large Language Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Ali AhmadiTeshnizi, Madeleine Udell, Wenzhi Gao","submitted_at":"2024-02-15T18:19:18Z","abstract_excerpt":"Optimization problems are pervasive in sectors from manufacturing and distribution to healthcare. However, most such problems are still solved heuristically by hand rather than optimally by state-of-the-art solvers because the expertise required to formulate and solve these problems limits the widespread adoption of optimization tools and techniques. This paper introduces OptiMUS, a Large Language Model (LLM)-based agent designed to formulate and solve (mixed integer) linear programming problems from their natural language descriptions. OptiMUS can develop mathematical models, write and debug "},"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":"2402.10172","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-15T18:19:18Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"6dec21e27ac19743dac209fb904df101bbf33c3f397dbdd01d80351f9800e870","abstract_canon_sha256":"b5c1dc076496b9fa4aa0819ef41a4ab7b636403eace52e1dee317cefcbbeb695"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:42.349085Z","signature_b64":"8/RnTbqLB6RtbkT/kJBlv+npoOiEAENmaPk9FsQLGF0b1QDCtiRjrT7Asww1Wb6eqCh+s6Sxuo25bC9DFjxdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab15bc314c2f0e9220a9a7ef6e47af315018bd243bb81394609b2d1690eef262","last_reissued_at":"2026-07-05T07:45:42.348648Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:42.348648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OptiMUS: Scalable Optimization Modeling with (MI)LP Solvers and Large Language Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Ali AhmadiTeshnizi, Madeleine Udell, Wenzhi Gao","submitted_at":"2024-02-15T18:19:18Z","abstract_excerpt":"Optimization problems are pervasive in sectors from manufacturing and distribution to healthcare. However, most such problems are still solved heuristically by hand rather than optimally by state-of-the-art solvers because the expertise required to formulate and solve these problems limits the widespread adoption of optimization tools and techniques. This paper introduces OptiMUS, a Large Language Model (LLM)-based agent designed to formulate and solve (mixed integer) linear programming problems from their natural language descriptions. OptiMUS can develop mathematical models, write and debug "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10172","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/2402.10172/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":"2402.10172","created_at":"2026-07-05T07:45:42.348710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10172v1","created_at":"2026-07-05T07:45:42.348710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10172","created_at":"2026-07-05T07:45:42.348710+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMK3YMKMF4HJ","created_at":"2026-07-05T07:45:42.348710+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMK3YMKMF4HJEIFJ","created_at":"2026-07-05T07:45:42.348710+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMK3YMKM","created_at":"2026-07-05T07:45:42.348710+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25923","citing_title":"$\\text{DT}^2$: Decision-Targeted Digital Twins","ref_index":124,"is_internal_anchor":false},{"citing_arxiv_id":"2607.02141","citing_title":"A$^{2}$utoLPBench: An Auto-Generated, Agent-Friendly LP Benchmark via Inverse-KKT Construction","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25246","citing_title":"FrontierOR: Benchmarking LLMs' Capacity for Efficient Algorithm Design in Large-Scale Optimization","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28158","citing_title":"OR-Space: A Full-Lifecycle Workspace Benchmark for Industrial Optimization Agents","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18692","citing_title":"Democratizing Large-Scale Re-Optimization with LLM-Guided Model Patches","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2601.19924","citing_title":"OPT-Engine: Benchmarking the Limits of LLMs in Optimization Modeling via Complexity Scaling","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12204","citing_title":"Graph-Grounded Optimization: Rao-Family Metaheuristics, Classical OR, and SLM-Driven Formulation over Knowledge Graphs","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12421","citing_title":"Formalize, Don't Optimize: The Heuristic Trap in LLM-Generated Combinatorial Solvers","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12204","citing_title":"Graph-Grounded Optimization: Rao-Family Metaheuristics, Classical OR, and SLM-Driven Formulation over Knowledge Graphs","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07214","citing_title":"HMACE: Heterogeneous Multi-Agent Collaborative Evolution for Combinatorial Optimization","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02728","citing_title":"ORPilot: A Production-Oriented Agentic LLM-for-OR Tool for Optimization Modeling","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF","json":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF.json","graph_json":"https://pith.science/api/pith-number/VMK3YMKMF4HJEIFJU7XW4R5PGF/graph.json","events_json":"https://pith.science/api/pith-number/VMK3YMKMF4HJEIFJU7XW4R5PGF/events.json","paper":"https://pith.science/paper/VMK3YMKM"},"agent_actions":{"view_html":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF","download_json":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF.json","view_paper":"https://pith.science/paper/VMK3YMKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10172&json=true","fetch_graph":"https://pith.science/api/pith-number/VMK3YMKMF4HJEIFJU7XW4R5PGF/graph.json","fetch_events":"https://pith.science/api/pith-number/VMK3YMKMF4HJEIFJU7XW4R5PGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF/action/storage_attestation","attest_author":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF/action/author_attestation","sign_citation":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF/action/citation_signature","submit_replication":"https://pith.science/pith/VMK3YMKMF4HJEIFJU7XW4R5PGF/action/replication_record"}},"created_at":"2026-07-05T07:45:42.348710+00:00","updated_at":"2026-07-05T07:45:42.348710+00:00"}