{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LSHRHSSCFA6BHLU75QVTOZIZRY","short_pith_number":"pith:LSHRHSSC","schema_version":"1.0","canonical_sha256":"5c8f13ca42283c13ae9fec2b3765198e1f48621d1d4584dc68271adfe7aa082b","source":{"kind":"arxiv","id":"2310.16427","version":2},"attestation_state":"computed","paper":{"title":"PromptAgent: Strategic Planning with Language Models Enables Expert-level Prompt Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chenxi Li, Eric P. Xing, Fan Bai, Haotian Luo, Jiayou Zhang, Nebojsa Jojic, Xinyuan Wang, Zhen Wang, Zhiting Hu","submitted_at":"2023-10-25T07:47:01Z","abstract_excerpt":"Highly effective, task-specific prompts are often heavily engineered by experts to integrate detailed instructions and domain insights based on a deep understanding of both instincts of large language models (LLMs) and the intricacies of the target task. However, automating the generation of such expert-level prompts remains elusive. Existing prompt optimization methods tend to overlook the depth of domain knowledge and struggle to efficiently explore the vast space of expert-level prompts. Addressing this, we present PromptAgent, an optimization method that autonomously crafts prompts equival"},"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.16427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-10-25T07:47:01Z","cross_cats_sorted":[],"title_canon_sha256":"4d8c1f122051e5d3c3d200a55daa40843c91b9ce8f5895ebc5e3615d8876bc18","abstract_canon_sha256":"984f2d72f4566aad1cc93e04944489bd2712609024f8403e5140853db5209011"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:28.631827Z","signature_b64":"TTnQLF766EiynY5an8NeHYWQ0eoTR5xjJFYVkQwbQQ22Q+BQZ0NZjq4uw7neZtbBOkPu1QmpFScwDZ/KVq30BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c8f13ca42283c13ae9fec2b3765198e1f48621d1d4584dc68271adfe7aa082b","last_reissued_at":"2026-07-05T07:21:28.631211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:28.631211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PromptAgent: Strategic Planning with Language Models Enables Expert-level Prompt Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chenxi Li, Eric P. Xing, Fan Bai, Haotian Luo, Jiayou Zhang, Nebojsa Jojic, Xinyuan Wang, Zhen Wang, Zhiting Hu","submitted_at":"2023-10-25T07:47:01Z","abstract_excerpt":"Highly effective, task-specific prompts are often heavily engineered by experts to integrate detailed instructions and domain insights based on a deep understanding of both instincts of large language models (LLMs) and the intricacies of the target task. However, automating the generation of such expert-level prompts remains elusive. Existing prompt optimization methods tend to overlook the depth of domain knowledge and struggle to efficiently explore the vast space of expert-level prompts. Addressing this, we present PromptAgent, an optimization method that autonomously crafts prompts equival"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.16427","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/2310.16427/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.16427","created_at":"2026-07-05T07:21:28.631289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.16427v2","created_at":"2026-07-05T07:21:28.631289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.16427","created_at":"2026-07-05T07:21:28.631289+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSHRHSSCFA6B","created_at":"2026-07-05T07:21:28.631289+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSHRHSSCFA6BHLU7","created_at":"2026-07-05T07:21:28.631289+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSHRHSSC","created_at":"2026-07-05T07:21:28.631289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24094","citing_title":"Universal Guideline-Driven Image Clustering via a Hybrid LLM Agent","ref_index":82,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24004","citing_title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","ref_index":106,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18235","citing_title":"EvolveNav: Proactive Preflection and Self-Evolving Memory for Zero-Shot Object Goal Navigation","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24004","citing_title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","ref_index":106,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23019","citing_title":"PACE: Two-Timescale Self-Evolution for Small Language Model Agents","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2507.21046","citing_title":"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11225","citing_title":"PIVOT: Bridging Planning and Execution in LLM Agents via Trajectory Refinement","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08520","citing_title":"FlashEvolve: Accelerating Agent Self-Evolution with Asynchronous Stage Orchestration","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04107","citing_title":"TSCG: Deterministic Tool-Schema Compilation for Agentic LLM Deployments","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20714","citing_title":"Learning to Evolve: A Self-Improving Framework for Multi-Agent Systems via Textual Parameter Graph Optimization","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11328","citing_title":"Select Smarter, Not More: Prompt-Aware Evaluation Scheduling with Submodular Guarantees","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17175","citing_title":"RosettaSearch: Multi-Objective Inference-Time Search for Protein Sequence Design","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY","json":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY.json","graph_json":"https://pith.science/api/pith-number/LSHRHSSCFA6BHLU75QVTOZIZRY/graph.json","events_json":"https://pith.science/api/pith-number/LSHRHSSCFA6BHLU75QVTOZIZRY/events.json","paper":"https://pith.science/paper/LSHRHSSC"},"agent_actions":{"view_html":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY","download_json":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY.json","view_paper":"https://pith.science/paper/LSHRHSSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.16427&json=true","fetch_graph":"https://pith.science/api/pith-number/LSHRHSSCFA6BHLU75QVTOZIZRY/graph.json","fetch_events":"https://pith.science/api/pith-number/LSHRHSSCFA6BHLU75QVTOZIZRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY/action/storage_attestation","attest_author":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY/action/author_attestation","sign_citation":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY/action/citation_signature","submit_replication":"https://pith.science/pith/LSHRHSSCFA6BHLU75QVTOZIZRY/action/replication_record"}},"created_at":"2026-07-05T07:21:28.631289+00:00","updated_at":"2026-07-05T07:21:28.631289+00:00"}