{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TT4XLHMIR5NXSXCJRD3PJARHSS","short_pith_number":"pith:TT4XLHMI","schema_version":"1.0","canonical_sha256":"9cf9759d888f5b795c4988f6f4822794ae7d4b8e65ddce33cc5015d0da7f9f4d","source":{"kind":"arxiv","id":"2405.18369","version":2},"attestation_state":"computed","paper":{"title":"PromptWizard: Task-Aware Prompt Optimization Framework","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Akshay Nambi, Eshaan Agarwal, Joykirat Singh, Raghav Magazine, Tanuja Ganu, Vivek Dani","submitted_at":"2024-05-28T17:08:31Z","abstract_excerpt":"Large language models (LLMs) have transformed AI across diverse domains, with prompting being central to their success in guiding model outputs. However, manual prompt engineering is both labor-intensive and domain-specific, necessitating the need for automated solutions. We introduce PromptWizard, a novel, fully automated framework for discrete prompt optimization, utilizing a self-evolving, self-adapting mechanism. Through a feedback-driven critique and synthesis process, PromptWizard achieves an effective balance between exploration and exploitation, iteratively refining both prompt instruc"},"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":"2405.18369","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-28T17:08:31Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c24b81b611c06de8b77cb760c8223012d10566dde69ffce44b997442d4d4d5ec","abstract_canon_sha256":"1914e640425df6d3b07afad8e71d86c7771eb5d61dfcfc6da42314af15bb1ab5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:10.806411Z","signature_b64":"FwmGn1i2WWstUiEfctk42rF1zrDgF7Yp0seRXGObqSUEuuHslhzHYZJ6ubQG5+C6ca6SmmIcXac4n9fyv9NQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cf9759d888f5b795c4988f6f4822794ae7d4b8e65ddce33cc5015d0da7f9f4d","last_reissued_at":"2026-07-05T09:15:10.805954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:10.805954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PromptWizard: Task-Aware Prompt Optimization Framework","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Akshay Nambi, Eshaan Agarwal, Joykirat Singh, Raghav Magazine, Tanuja Ganu, Vivek Dani","submitted_at":"2024-05-28T17:08:31Z","abstract_excerpt":"Large language models (LLMs) have transformed AI across diverse domains, with prompting being central to their success in guiding model outputs. However, manual prompt engineering is both labor-intensive and domain-specific, necessitating the need for automated solutions. We introduce PromptWizard, a novel, fully automated framework for discrete prompt optimization, utilizing a self-evolving, self-adapting mechanism. Through a feedback-driven critique and synthesis process, PromptWizard achieves an effective balance between exploration and exploitation, iteratively refining both prompt instruc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18369","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/2405.18369/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":"2405.18369","created_at":"2026-07-05T09:15:10.806009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.18369v2","created_at":"2026-07-05T09:15:10.806009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18369","created_at":"2026-07-05T09:15:10.806009+00:00"},{"alias_kind":"pith_short_12","alias_value":"TT4XLHMIR5NX","created_at":"2026-07-05T09:15:10.806009+00:00"},{"alias_kind":"pith_short_16","alias_value":"TT4XLHMIR5NXSXCJ","created_at":"2026-07-05T09:15:10.806009+00:00"},{"alias_kind":"pith_short_8","alias_value":"TT4XLHMI","created_at":"2026-07-05T09:15:10.806009+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24004","citing_title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04221","citing_title":"Self-Prompting Small Language Models for Privacy-Sensitive Clinical Information Extraction","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24004","citing_title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23019","citing_title":"PACE: Two-Timescale Self-Evolution for Small Language Model Agents","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22166","citing_title":"Adapting the Interface, Not the Model: Runtime Harness Adaptation for Deterministic LLM Agents","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15721","citing_title":"Contexting as Recommendation: Evolutionary Collaborative Filtering for Context Engineering","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2508.11222","citing_title":"ORFuzz: Fuzzing the \"Other Side\" of LLM Safety -- Testing Over-Refusal","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2512.12794","citing_title":"A Rule-Aware Prompt Framework for Structured Numeric Reasoning in Cyber-Physical Systems","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2508.07407","citing_title":"A Comprehensive Survey of Self-Evolving AI Agents: A New Paradigm Bridging Foundation Models and Lifelong Agentic Systems","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12484","citing_title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12484","citing_title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2512.13564","citing_title":"Memory in the Age of AI Agents","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09741","citing_title":"ExecTune: Effective Steering of Black-Box LLMs with Guide Models","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04221","citing_title":"Self-Prompting Small Language Models for Privacy-Sensitive Clinical Information Extraction","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS","json":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS.json","graph_json":"https://pith.science/api/pith-number/TT4XLHMIR5NXSXCJRD3PJARHSS/graph.json","events_json":"https://pith.science/api/pith-number/TT4XLHMIR5NXSXCJRD3PJARHSS/events.json","paper":"https://pith.science/paper/TT4XLHMI"},"agent_actions":{"view_html":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS","download_json":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS.json","view_paper":"https://pith.science/paper/TT4XLHMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.18369&json=true","fetch_graph":"https://pith.science/api/pith-number/TT4XLHMIR5NXSXCJRD3PJARHSS/graph.json","fetch_events":"https://pith.science/api/pith-number/TT4XLHMIR5NXSXCJRD3PJARHSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS/action/storage_attestation","attest_author":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS/action/author_attestation","sign_citation":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS/action/citation_signature","submit_replication":"https://pith.science/pith/TT4XLHMIR5NXSXCJRD3PJARHSS/action/replication_record"}},"created_at":"2026-07-05T09:15:10.806009+00:00","updated_at":"2026-07-05T09:15:10.806009+00:00"}