{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HPVZUZ65HFMUPXYFD7S27UZFM3","short_pith_number":"pith:HPVZUZ65","schema_version":"1.0","canonical_sha256":"3beb9a67dd395947df051fe5afd32566d2d00cf77f1e03f541ab53a089a3b1f1","source":{"kind":"arxiv","id":"2501.00568","version":1},"attestation_state":"computed","paper":{"title":"Robust and Adaptive Optimization under a Large Language Model Lens","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimitris Bertsimas, Georgios Margaritis","submitted_at":"2024-12-31T17:53:42Z","abstract_excerpt":"In this paper, we explore the application of ChatGPT in the domain of Robust and Adaptive Robust Optimization. We demonstrate that with appropriate prompting, ChatGPT can be used to auto-formulate and solve simple Robust and Adaptive Optimization Problems. We first develop specialized informational prompts tailored to the domains of Adaptive and Robust Optimization. Then, we show that using these prompts, ChatGPT is able to (i) formulate an optimization problem, (ii) adapt the problem so that it accounts for user-specified uncertainty, (iii) derive the computationally tractable robust counterp"},"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.00568","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-31T17:53:42Z","cross_cats_sorted":[],"title_canon_sha256":"d7d6cd1af52dc759f97040ed8787b6df2f5a474cb7b8f5eaea612c605a61c59d","abstract_canon_sha256":"f3000adcaf7cb0361aac9d4617f44a327de64f07bcbf10fb80f27f6d4c59c349"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:07.629453Z","signature_b64":"Io27L5aALlLRSbvObn6Q/MndxEsJdpAQMQbKHWSkwDxpKeHlql+qNcfMvYJJ3XGYwemt2xq4H8AWfsN1w0QYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3beb9a67dd395947df051fe5afd32566d2d00cf77f1e03f541ab53a089a3b1f1","last_reissued_at":"2026-07-05T09:56:07.628966Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:07.628966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Adaptive Optimization under a Large Language Model Lens","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimitris Bertsimas, Georgios Margaritis","submitted_at":"2024-12-31T17:53:42Z","abstract_excerpt":"In this paper, we explore the application of ChatGPT in the domain of Robust and Adaptive Robust Optimization. We demonstrate that with appropriate prompting, ChatGPT can be used to auto-formulate and solve simple Robust and Adaptive Optimization Problems. We first develop specialized informational prompts tailored to the domains of Adaptive and Robust Optimization. Then, we show that using these prompts, ChatGPT is able to (i) formulate an optimization problem, (ii) adapt the problem so that it accounts for user-specified uncertainty, (iii) derive the computationally tractable robust counterp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00568","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.00568/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.00568","created_at":"2026-07-05T09:56:07.629020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00568v1","created_at":"2026-07-05T09:56:07.629020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00568","created_at":"2026-07-05T09:56:07.629020+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPVZUZ65HFMU","created_at":"2026-07-05T09:56:07.629020+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPVZUZ65HFMUPXYF","created_at":"2026-07-05T09:56:07.629020+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPVZUZ65","created_at":"2026-07-05T09:56:07.629020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20849","citing_title":"Large Language Models for Operations Research: A Comprehensive Survey","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11813","citing_title":"Automated Reformulation of Robust Optimization via Memory-Augmented Large Language Models","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04383","citing_title":"Optimizing Service Operations via LLM-Powered Multi-Agent Simulation","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3","json":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3.json","graph_json":"https://pith.science/api/pith-number/HPVZUZ65HFMUPXYFD7S27UZFM3/graph.json","events_json":"https://pith.science/api/pith-number/HPVZUZ65HFMUPXYFD7S27UZFM3/events.json","paper":"https://pith.science/paper/HPVZUZ65"},"agent_actions":{"view_html":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3","download_json":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3.json","view_paper":"https://pith.science/paper/HPVZUZ65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00568&json=true","fetch_graph":"https://pith.science/api/pith-number/HPVZUZ65HFMUPXYFD7S27UZFM3/graph.json","fetch_events":"https://pith.science/api/pith-number/HPVZUZ65HFMUPXYFD7S27UZFM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3/action/storage_attestation","attest_author":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3/action/author_attestation","sign_citation":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3/action/citation_signature","submit_replication":"https://pith.science/pith/HPVZUZ65HFMUPXYFD7S27UZFM3/action/replication_record"}},"created_at":"2026-07-05T09:56:07.629020+00:00","updated_at":"2026-07-05T09:56:07.629020+00:00"}