{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3KBSWQTIKU2WF2CDJI3EJZAJAG","short_pith_number":"pith:3KBSWQTI","schema_version":"1.0","canonical_sha256":"da832b4268553562e8434a3644e409018ffac11e70ba62901ab79a5ccc7a999c","source":{"kind":"arxiv","id":"2503.10009","version":3},"attestation_state":"computed","paper":{"title":"OR-LLM-Agent: Automating Modeling and Solving of Operations Research Optimization Problems with Reasoning LLM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Boon-Hee Soong, Bowen Zhang, Chau Yuen, Genke Yang, Pengcheng Luo","submitted_at":"2025-03-13T03:40:50Z","abstract_excerpt":"With the rise of artificial intelligence (AI), applying large language models (LLMs) to mathematical problem-solving has attracted increasing attention. Most existing approaches attempt to improve Operations Research (OR) optimization problem-solving through prompt engineering or fine-tuning strategies for LLMs. However, these methods are fundamentally constrained by the limited capabilities of non-reasoning LLMs. To overcome these limitations, we propose OR-LLM-Agent, an AI agent framework built on reasoning LLMs for automated OR problem solving. The framework decomposes the task into three s"},"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.10009","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-03-13T03:40:50Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1e2f172201820f3ca7efba51e790dd279ed3bc908231d3c643f18657155ad912","abstract_canon_sha256":"b6423f8f3d03612073aaf5b3b3d1dda3f148648971a1af6cb8d846bc4726090a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:41.051813Z","signature_b64":"+9rNMe/T0DPUC+6CV8jjzsiRXT+4Ho3x44syYr3m8Ek3EUFC4vk5t72K6rJRw4eeDU/sc6c6fSl3ipGEtFI+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da832b4268553562e8434a3644e409018ffac11e70ba62901ab79a5ccc7a999c","last_reissued_at":"2026-07-05T11:46:41.051368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:41.051368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OR-LLM-Agent: Automating Modeling and Solving of Operations Research Optimization Problems with Reasoning LLM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Boon-Hee Soong, Bowen Zhang, Chau Yuen, Genke Yang, Pengcheng Luo","submitted_at":"2025-03-13T03:40:50Z","abstract_excerpt":"With the rise of artificial intelligence (AI), applying large language models (LLMs) to mathematical problem-solving has attracted increasing attention. Most existing approaches attempt to improve Operations Research (OR) optimization problem-solving through prompt engineering or fine-tuning strategies for LLMs. However, these methods are fundamentally constrained by the limited capabilities of non-reasoning LLMs. To overcome these limitations, we propose OR-LLM-Agent, an AI agent framework built on reasoning LLMs for automated OR problem solving. The framework decomposes the task into three s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10009","kind":"arxiv","version":3},"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.10009/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.10009","created_at":"2026-07-05T11:46:41.051424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10009v3","created_at":"2026-07-05T11:46:41.051424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10009","created_at":"2026-07-05T11:46:41.051424+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KBSWQTIKU2W","created_at":"2026-07-05T11:46:41.051424+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KBSWQTIKU2WF2CD","created_at":"2026-07-05T11:46:41.051424+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KBSWQTI","created_at":"2026-07-05T11:46:41.051424+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02141","citing_title":"A$^{2}$utoLPBench: An Auto-Generated, Agent-Friendly LP Benchmark via Inverse-KKT Construction","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10359","citing_title":"ReflectiChain: Epistemic Grounding in LLM-Driven World Models for Supply Chain Resilience","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28158","citing_title":"OR-Space: A Full-Lifecycle Workspace Benchmark for Industrial Optimization Agents","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20849","citing_title":"Large Language Models for Operations Research: A Comprehensive Survey","ref_index":117,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19110","citing_title":"IterSIMP-{\\sigma}: Evaluating LLM-Assisted Spatial Interventions in Stress-Aware Topology Optimization","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21510","citing_title":"OptiVerse: A Comprehensive Benchmark towards Optimization Problem Solving","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20183","citing_title":"Dual-Cluster Memory Agent: Resolving Multi-Paradigm Ambiguity in Optimization Problem Solving","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11174","citing_title":"EmbodiedGovBench: A Benchmark for Governance, Recovery, and Upgrade Safety in Embodied Agent Systems","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18327","citing_title":"PARM: Pipeline-Adapted Reward Model","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16804","citing_title":"AutoOR: Scalably Post-training LLMs to Autoformalize Operations Research Problems","ref_index":6,"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":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG","json":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG.json","graph_json":"https://pith.science/api/pith-number/3KBSWQTIKU2WF2CDJI3EJZAJAG/graph.json","events_json":"https://pith.science/api/pith-number/3KBSWQTIKU2WF2CDJI3EJZAJAG/events.json","paper":"https://pith.science/paper/3KBSWQTI"},"agent_actions":{"view_html":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG","download_json":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG.json","view_paper":"https://pith.science/paper/3KBSWQTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10009&json=true","fetch_graph":"https://pith.science/api/pith-number/3KBSWQTIKU2WF2CDJI3EJZAJAG/graph.json","fetch_events":"https://pith.science/api/pith-number/3KBSWQTIKU2WF2CDJI3EJZAJAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG/action/storage_attestation","attest_author":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG/action/author_attestation","sign_citation":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG/action/citation_signature","submit_replication":"https://pith.science/pith/3KBSWQTIKU2WF2CDJI3EJZAJAG/action/replication_record"}},"created_at":"2026-07-05T11:46:41.051424+00:00","updated_at":"2026-07-05T11:46:41.051424+00:00"}