{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AFDVNS2BSMCMQ747RRVY3IZTO5","short_pith_number":"pith:AFDVNS2B","schema_version":"1.0","canonical_sha256":"014756cb419304c87f9f8c6b8da3337769edea6eecb4ff372319a91bca2e935d","source":{"kind":"arxiv","id":"2403.01131","version":2},"attestation_state":"computed","paper":{"title":"LLaMoCo: Instruction Tuning of Large Language Models for Optimization Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG","cs.NE","cs.SE"],"primary_cat":"math.OC","authors_text":"Guojun Peng, Hongshu Guo, Jiacheng Chen, Yining Ma, Yue-Jiao Gong, Zeyuan Ma, Zhiguang Cao","submitted_at":"2024-03-02T08:21:59Z","abstract_excerpt":"Recent research explores optimization using large language models (LLMs) by either iteratively seeking next-step solutions from LLMs or directly prompting LLMs for an optimizer. However, these approaches exhibit inherent limitations, including low operational efficiency, high sensitivity to prompt design, and a lack of domain-specific knowledge. We introduce LLaMoCo, the first instruction-tuning framework designed to adapt LLMs for solving optimization problems in a code-to-code manner. Specifically, we establish a comprehensive instruction set containing well-described problem prompts and eff"},"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":"2403.01131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-02T08:21:59Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG","cs.NE","cs.SE"],"title_canon_sha256":"804bde93aa4d81bca78df646911c72ebb2858d034fffa494c2f1c8fd908c409f","abstract_canon_sha256":"4143086c0edec9b5a6244ea26137ef698d0d50f723ef367c2f5bd9dccd7baae9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:17.092584Z","signature_b64":"qa+nQIZ5dvOpuSazIGfoPz+ETGrEQ09mP4SYUFW3fkG35baBZ513eoyoyjO/pEK42QyACd/3VKUUezcqYY04Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"014756cb419304c87f9f8c6b8da3337769edea6eecb4ff372319a91bca2e935d","last_reissued_at":"2026-07-05T07:52:17.092016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:17.092016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLaMoCo: Instruction Tuning of Large Language Models for Optimization Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG","cs.NE","cs.SE"],"primary_cat":"math.OC","authors_text":"Guojun Peng, Hongshu Guo, Jiacheng Chen, Yining Ma, Yue-Jiao Gong, Zeyuan Ma, Zhiguang Cao","submitted_at":"2024-03-02T08:21:59Z","abstract_excerpt":"Recent research explores optimization using large language models (LLMs) by either iteratively seeking next-step solutions from LLMs or directly prompting LLMs for an optimizer. However, these approaches exhibit inherent limitations, including low operational efficiency, high sensitivity to prompt design, and a lack of domain-specific knowledge. We introduce LLaMoCo, the first instruction-tuning framework designed to adapt LLMs for solving optimization problems in a code-to-code manner. Specifically, we establish a comprehensive instruction set containing well-described problem prompts and eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01131","kind":"arxiv","version":2},"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/2403.01131/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":"2403.01131","created_at":"2026-07-05T07:52:17.092085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01131v2","created_at":"2026-07-05T07:52:17.092085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01131","created_at":"2026-07-05T07:52:17.092085+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFDVNS2BSMCM","created_at":"2026-07-05T07:52:17.092085+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFDVNS2BSMCMQ747","created_at":"2026-07-05T07:52:17.092085+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFDVNS2B","created_at":"2026-07-05T07:52:17.092085+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25832","citing_title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.25832","citing_title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00604","citing_title":"Vehicle Routing Problem Meets Large Language Models: An Overview and Perspectives","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28998","citing_title":"Reward-Free Code Alignment from Pretrained or Fine-Tuned LLM: Unpacking the Trade-offs for Code Generation","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2409.02428","citing_title":"Language Models as Efficient Reward Function Searchers for Custom-Environment Multi-Objective Reinforcement","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19259","citing_title":"ERFSL: An Efficient Reward Function Searcher via Language Models for Custom-Environment Multi-Objective Optimization (Student Abstract)","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2512.14018","citing_title":"PerfCoder: Large Language Models for Interpretable Code Performance Optimization","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2512.18682","citing_title":"Solver-Independent Automated Problem Formulation via LLMs for High-Cost Simulation-Driven Design","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10260","citing_title":"Meta-Black-Box Optimization Can Do Search Guidance for Expensive Constrained Multi-Objective Optimization","ref_index":36,"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":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5","json":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5.json","graph_json":"https://pith.science/api/pith-number/AFDVNS2BSMCMQ747RRVY3IZTO5/graph.json","events_json":"https://pith.science/api/pith-number/AFDVNS2BSMCMQ747RRVY3IZTO5/events.json","paper":"https://pith.science/paper/AFDVNS2B"},"agent_actions":{"view_html":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5","download_json":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5.json","view_paper":"https://pith.science/paper/AFDVNS2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01131&json=true","fetch_graph":"https://pith.science/api/pith-number/AFDVNS2BSMCMQ747RRVY3IZTO5/graph.json","fetch_events":"https://pith.science/api/pith-number/AFDVNS2BSMCMQ747RRVY3IZTO5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5/action/storage_attestation","attest_author":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5/action/author_attestation","sign_citation":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5/action/citation_signature","submit_replication":"https://pith.science/pith/AFDVNS2BSMCMQ747RRVY3IZTO5/action/replication_record"}},"created_at":"2026-07-05T07:52:17.092085+00:00","updated_at":"2026-07-05T07:52:17.092085+00:00"}