{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FU2H2GCF5WPESUJNXRFPQ33IG3","short_pith_number":"pith:FU2H2GCF","schema_version":"1.0","canonical_sha256":"2d347d1845ed9e49512dbc4af86f6836ea6cede481bf2309a6e966919ad83437","source":{"kind":"arxiv","id":"2601.21372","version":2},"attestation_state":"computed","paper":{"title":"NEMO: Execution-Aware Optimization Modeling via Autonomous Coding Agents","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anoushka Vyas, Graham Neubig, Henrik Ohlsson, Sina Khoshfetrat Pakazad, Yang Song, Zirui Wei","submitted_at":"2026-01-29T07:57:23Z","abstract_excerpt":"We present NEMO, a system that translates Natural-language descriptions of decision problems into formal Executable Mathematical Optimization implementations using autonomous coding agents (ACAs). Existing approaches rely on specialized large language models (LLMs) or bespoke task-specific agents that are often brittle and frequently generate syntactically invalid or non-executable code. NEMO instead treats ACAs as a first-class abstraction analogous to API-based interaction with LLMs; their sandboxed execution guarantees code is executable by construction and supports automated validation and"},"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":"2601.21372","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-29T07:57:23Z","cross_cats_sorted":[],"title_canon_sha256":"ab8b80d2609f9fcf08221249d2e79eba36899fbc8200da1b2f91acec6848ce42","abstract_canon_sha256":"06281e0e9ba390da2035887b356765a860a68b61995e3f86bf77dffce5c5a145"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:30.727576Z","signature_b64":"80JNrVIuCe/C7pqLAwqccX9UFG8GD6k4DXy0mLmZgUnf7whJh6vr8C5EjM0yJX5V8z3sfqLOJcsW2uJhGqX3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d347d1845ed9e49512dbc4af86f6836ea6cede481bf2309a6e966919ad83437","last_reissued_at":"2026-06-01T01:02:30.726623Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:30.726623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NEMO: Execution-Aware Optimization Modeling via Autonomous Coding Agents","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anoushka Vyas, Graham Neubig, Henrik Ohlsson, Sina Khoshfetrat Pakazad, Yang Song, Zirui Wei","submitted_at":"2026-01-29T07:57:23Z","abstract_excerpt":"We present NEMO, a system that translates Natural-language descriptions of decision problems into formal Executable Mathematical Optimization implementations using autonomous coding agents (ACAs). Existing approaches rely on specialized large language models (LLMs) or bespoke task-specific agents that are often brittle and frequently generate syntactically invalid or non-executable code. NEMO instead treats ACAs as a first-class abstraction analogous to API-based interaction with LLMs; their sandboxed execution guarantees code is executable by construction and supports automated validation and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.21372","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/2601.21372/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":"2601.21372","created_at":"2026-06-01T01:02:30.726754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.21372v2","created_at":"2026-06-01T01:02:30.726754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.21372","created_at":"2026-06-01T01:02:30.726754+00:00"},{"alias_kind":"pith_short_12","alias_value":"FU2H2GCF5WPE","created_at":"2026-06-01T01:02:30.726754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FU2H2GCF5WPESUJN","created_at":"2026-06-01T01:02:30.726754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FU2H2GCF","created_at":"2026-06-01T01:02:30.726754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.19787","citing_title":"ORAgentBench: Can LLM Agents Solve Challenging Operations Research Tasks End to End?","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3","json":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3.json","graph_json":"https://pith.science/api/pith-number/FU2H2GCF5WPESUJNXRFPQ33IG3/graph.json","events_json":"https://pith.science/api/pith-number/FU2H2GCF5WPESUJNXRFPQ33IG3/events.json","paper":"https://pith.science/paper/FU2H2GCF"},"agent_actions":{"view_html":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3","download_json":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3.json","view_paper":"https://pith.science/paper/FU2H2GCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.21372&json=true","fetch_graph":"https://pith.science/api/pith-number/FU2H2GCF5WPESUJNXRFPQ33IG3/graph.json","fetch_events":"https://pith.science/api/pith-number/FU2H2GCF5WPESUJNXRFPQ33IG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3/action/storage_attestation","attest_author":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3/action/author_attestation","sign_citation":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3/action/citation_signature","submit_replication":"https://pith.science/pith/FU2H2GCF5WPESUJNXRFPQ33IG3/action/replication_record"}},"created_at":"2026-06-01T01:02:30.726754+00:00","updated_at":"2026-06-01T01:02:30.726754+00:00"}