{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6GC247E5QBFTSWI7TF7NQBRSAT","short_pith_number":"pith:6GC247E5","schema_version":"1.0","canonical_sha256":"f185ae7c9d804b39591f997ed8063204c2d67ae8aa5578f4b55738e19da74612","source":{"kind":"arxiv","id":"2310.05204","version":3},"attestation_state":"computed","paper":{"title":"Towards Optimizing with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pei-Fu Guo, Shou-De Lin, Ying-Hsuan Chen, Yun-Da Tsai","submitted_at":"2023-10-08T15:35:00Z","abstract_excerpt":"In this work, we conduct an assessment of the optimization capabilities of LLMs across various tasks and data sizes. Each of these tasks corresponds to unique optimization domains, and LLMs are required to execute these tasks with interactive prompting. That is, in each optimization step, the LLM generates new solutions from the past generated solutions with their values, and then the new solutions are evaluated and considered in the next optimization step. Additionally, we introduce three distinct metrics for a comprehensive assessment of task performance from various perspectives. These metr"},"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":"2310.05204","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-08T15:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"67c0b73d32d9e56d25a25722dc325a686fa776e9df0bd8b241139a4a632e8575","abstract_canon_sha256":"0a24a950959647bc56600fc17cd7248a37fd4dc39cd51984162056c63ca9f3d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:12.698522Z","signature_b64":"QoS+S8zm8FZDYSLza1Qo9Iv4n3JQPbXK1swom8yV1Ek6CrdFw2jmRFDUr/4Rq0ThBHFDX0dfIGHXVz/E+7dcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f185ae7c9d804b39591f997ed8063204c2d67ae8aa5578f4b55738e19da74612","last_reissued_at":"2026-07-05T08:23:12.698041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:12.698041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimizing with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pei-Fu Guo, Shou-De Lin, Ying-Hsuan Chen, Yun-Da Tsai","submitted_at":"2023-10-08T15:35:00Z","abstract_excerpt":"In this work, we conduct an assessment of the optimization capabilities of LLMs across various tasks and data sizes. Each of these tasks corresponds to unique optimization domains, and LLMs are required to execute these tasks with interactive prompting. That is, in each optimization step, the LLM generates new solutions from the past generated solutions with their values, and then the new solutions are evaluated and considered in the next optimization step. Additionally, we introduce three distinct metrics for a comprehensive assessment of task performance from various perspectives. These metr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.05204","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/2310.05204/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":"2310.05204","created_at":"2026-07-05T08:23:12.698100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.05204v3","created_at":"2026-07-05T08:23:12.698100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.05204","created_at":"2026-07-05T08:23:12.698100+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GC247E5QBFT","created_at":"2026-07-05T08:23:12.698100+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GC247E5QBFTSWI7","created_at":"2026-07-05T08:23:12.698100+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GC247E5","created_at":"2026-07-05T08:23:12.698100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.19924","citing_title":"OPT-Engine: Benchmarking the Limits of LLMs in Optimization Modeling via Complexity Scaling","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06747","citing_title":"TurboAgent: An LLM-Driven Autonomous Multi-Agent Framework for Turbomachinery Aerodynamic Design","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT","json":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT.json","graph_json":"https://pith.science/api/pith-number/6GC247E5QBFTSWI7TF7NQBRSAT/graph.json","events_json":"https://pith.science/api/pith-number/6GC247E5QBFTSWI7TF7NQBRSAT/events.json","paper":"https://pith.science/paper/6GC247E5"},"agent_actions":{"view_html":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT","download_json":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT.json","view_paper":"https://pith.science/paper/6GC247E5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.05204&json=true","fetch_graph":"https://pith.science/api/pith-number/6GC247E5QBFTSWI7TF7NQBRSAT/graph.json","fetch_events":"https://pith.science/api/pith-number/6GC247E5QBFTSWI7TF7NQBRSAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT/action/storage_attestation","attest_author":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT/action/author_attestation","sign_citation":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT/action/citation_signature","submit_replication":"https://pith.science/pith/6GC247E5QBFTSWI7TF7NQBRSAT/action/replication_record"}},"created_at":"2026-07-05T08:23:12.698100+00:00","updated_at":"2026-07-05T08:23:12.698100+00:00"}