{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AKGZG3SFNXE3XLIX7YZFOY7GA5","short_pith_number":"pith:AKGZG3SF","schema_version":"1.0","canonical_sha256":"028d936e456dc9bbad17fe325763e60765ee5f8294db9602a25f36502b4b9bc8","source":{"kind":"arxiv","id":"2503.13413","version":3},"attestation_state":"computed","paper":{"title":"DLPO: Towards a Robust, Efficient, and Generalizable Prompt Optimization Framework from a Deep-Learning Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dengyun Peng, Jingjing Chen, Jinhao Liu, Libo Qin, Qiguang Chen, Yuhang Zhou","submitted_at":"2025-03-17T17:42:51Z","abstract_excerpt":"Large Language Models (LLMs) have achieved remarkable success across diverse tasks, largely driven by well-designed prompts. However, crafting and selecting such prompts often requires considerable human effort, significantly limiting its scalability. To mitigate this, recent studies have explored automated prompt optimization as a promising solution. Despite these efforts, existing methods still face critical challenges in robustness, efficiency, and generalization. To systematically address these challenges, we first conduct an empirical analysis to identify the limitations of current reflec"},"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.13413","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-03-17T17:42:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bf4bd16eae7f4fc82c9ddfdae07ec361353c52e86a57650ebe78cdaab9932f8d","abstract_canon_sha256":"291fe8003c361e675f6e207c789ff2247697b9d1eb1af586a737daf90bbe1f15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:34:43.455965Z","signature_b64":"zxnkpUlwb4rHxqC3DL/zOLXZktSc0Uy/0L9dc6O0Bw4F9YMddQQ656Cjh++/qJ80Bt3Uq6Jf2iXuadUTTwoZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"028d936e456dc9bbad17fe325763e60765ee5f8294db9602a25f36502b4b9bc8","last_reissued_at":"2026-07-05T10:34:43.455486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:34:43.455486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DLPO: Towards a Robust, Efficient, and Generalizable Prompt Optimization Framework from a Deep-Learning Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dengyun Peng, Jingjing Chen, Jinhao Liu, Libo Qin, Qiguang Chen, Yuhang Zhou","submitted_at":"2025-03-17T17:42:51Z","abstract_excerpt":"Large Language Models (LLMs) have achieved remarkable success across diverse tasks, largely driven by well-designed prompts. However, crafting and selecting such prompts often requires considerable human effort, significantly limiting its scalability. To mitigate this, recent studies have explored automated prompt optimization as a promising solution. Despite these efforts, existing methods still face critical challenges in robustness, efficiency, and generalization. To systematically address these challenges, we first conduct an empirical analysis to identify the limitations of current reflec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13413","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.13413/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.13413","created_at":"2026-07-05T10:34:43.455544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13413v3","created_at":"2026-07-05T10:34:43.455544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13413","created_at":"2026-07-05T10:34:43.455544+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKGZG3SFNXE3","created_at":"2026-07-05T10:34:43.455544+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKGZG3SFNXE3XLIX","created_at":"2026-07-05T10:34:43.455544+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKGZG3SF","created_at":"2026-07-05T10:34:43.455544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21318","citing_title":"TextReg: Mitigating Prompt Distributional Overfitting via Regularized Text-Space Optimization","ref_index":30,"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":139,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12943","citing_title":"Reinforced Collaboration in Multi-Agent Flow Networks","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5","json":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5.json","graph_json":"https://pith.science/api/pith-number/AKGZG3SFNXE3XLIX7YZFOY7GA5/graph.json","events_json":"https://pith.science/api/pith-number/AKGZG3SFNXE3XLIX7YZFOY7GA5/events.json","paper":"https://pith.science/paper/AKGZG3SF"},"agent_actions":{"view_html":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5","download_json":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5.json","view_paper":"https://pith.science/paper/AKGZG3SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13413&json=true","fetch_graph":"https://pith.science/api/pith-number/AKGZG3SFNXE3XLIX7YZFOY7GA5/graph.json","fetch_events":"https://pith.science/api/pith-number/AKGZG3SFNXE3XLIX7YZFOY7GA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5/action/storage_attestation","attest_author":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5/action/author_attestation","sign_citation":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5/action/citation_signature","submit_replication":"https://pith.science/pith/AKGZG3SFNXE3XLIX7YZFOY7GA5/action/replication_record"}},"created_at":"2026-07-05T10:34:43.455544+00:00","updated_at":"2026-07-05T10:34:43.455544+00:00"}