{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7S4W2GQDS6SQWMFHFZA7QNMVAE","short_pith_number":"pith:7S4W2GQD","schema_version":"1.0","canonical_sha256":"fcb96d1a0397a50b30a72e41f8359501200eee9144b538a438c8999b5e24901f","source":{"kind":"arxiv","id":"2404.02717","version":1},"attestation_state":"computed","paper":{"title":"Automatic Prompt Selection for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Duy-Hung Nguyen, Hajime Hotta, Hung Le, Jeff Yang, Minh-Tien Nguyen, Shahab Sabahi, Van-Khanh Hoang, Viet-Tung Do","submitted_at":"2024-04-03T13:20:24Z","abstract_excerpt":"Large Language Models (LLMs) can perform various natural language processing tasks with suitable instruction prompts. However, designing effective prompts manually is challenging and time-consuming. Existing methods for automatic prompt optimization either lack flexibility or efficiency. In this paper, we propose an effective approach to automatically select the optimal prompt for a given input from a finite set of synthetic candidate prompts. Our approach consists of three steps: (1) clustering the training data and generating candidate prompts for each cluster using an LLM-based prompt gener"},"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":"2404.02717","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-03T13:20:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d89bb2107233efce6939deb6803f99a5efe36bde5a3d5cb3e9c0bffde21402cb","abstract_canon_sha256":"935ce05ddfb48fd339ab9bd09d3d167b03cec6dd7770462ed083046787c0e16b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:00.320221Z","signature_b64":"+7fai/q0GggiXxMntB7S+abXzRXpYoGnrRXEdZJHwwkGEw6/CwpMeTZomf0s+9Z8UpVuLHNS5T1OQUvRa+NzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb96d1a0397a50b30a72e41f8359501200eee9144b538a438c8999b5e24901f","last_reissued_at":"2026-07-05T08:04:00.319748Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:00.319748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Prompt Selection for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Duy-Hung Nguyen, Hajime Hotta, Hung Le, Jeff Yang, Minh-Tien Nguyen, Shahab Sabahi, Van-Khanh Hoang, Viet-Tung Do","submitted_at":"2024-04-03T13:20:24Z","abstract_excerpt":"Large Language Models (LLMs) can perform various natural language processing tasks with suitable instruction prompts. However, designing effective prompts manually is challenging and time-consuming. Existing methods for automatic prompt optimization either lack flexibility or efficiency. In this paper, we propose an effective approach to automatically select the optimal prompt for a given input from a finite set of synthetic candidate prompts. Our approach consists of three steps: (1) clustering the training data and generating candidate prompts for each cluster using an LLM-based prompt gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02717","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/2404.02717/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":"2404.02717","created_at":"2026-07-05T08:04:00.319805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.02717v1","created_at":"2026-07-05T08:04:00.319805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02717","created_at":"2026-07-05T08:04:00.319805+00:00"},{"alias_kind":"pith_short_12","alias_value":"7S4W2GQDS6SQ","created_at":"2026-07-05T08:04:00.319805+00:00"},{"alias_kind":"pith_short_16","alias_value":"7S4W2GQDS6SQWMFH","created_at":"2026-07-05T08:04:00.319805+00:00"},{"alias_kind":"pith_short_8","alias_value":"7S4W2GQD","created_at":"2026-07-05T08:04:00.319805+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09418","citing_title":"Automated Instruction Revision (AIR): A Structured Comparison of Task Adaptation Strategies for LLM","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE","json":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE.json","graph_json":"https://pith.science/api/pith-number/7S4W2GQDS6SQWMFHFZA7QNMVAE/graph.json","events_json":"https://pith.science/api/pith-number/7S4W2GQDS6SQWMFHFZA7QNMVAE/events.json","paper":"https://pith.science/paper/7S4W2GQD"},"agent_actions":{"view_html":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE","download_json":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE.json","view_paper":"https://pith.science/paper/7S4W2GQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.02717&json=true","fetch_graph":"https://pith.science/api/pith-number/7S4W2GQDS6SQWMFHFZA7QNMVAE/graph.json","fetch_events":"https://pith.science/api/pith-number/7S4W2GQDS6SQWMFHFZA7QNMVAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE/action/storage_attestation","attest_author":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE/action/author_attestation","sign_citation":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE/action/citation_signature","submit_replication":"https://pith.science/pith/7S4W2GQDS6SQWMFHFZA7QNMVAE/action/replication_record"}},"created_at":"2026-07-05T08:04:00.319805+00:00","updated_at":"2026-07-05T08:04:00.319805+00:00"}