{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UYHYEA6ZILXG3RIK4K5GXCOASZ","short_pith_number":"pith:UYHYEA6Z","schema_version":"1.0","canonical_sha256":"a60f8203d942ee6dc50ae2ba6b89c0967e9bdec6b5faa29dc05da4ebb7ee4450","source":{"kind":"arxiv","id":"2306.03082","version":2},"attestation_state":"computed","paper":{"title":"InstructZero: Efficient Instruction Optimization for Black-Box Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Heng Huang, Jiuhai Chen, Lichang Chen, Tianyi Zhou, Tom Goldstein","submitted_at":"2023-06-05T17:55:22Z","abstract_excerpt":"Large language models~(LLMs) are instruction followers, but it can be challenging to find the best instruction for different situations, especially for black-box LLMs on which backpropagation is forbidden. Instead of directly optimizing the discrete instruction, we optimize a low-dimensional soft prompt applied to an open-source LLM to generate the instruction for the black-box LLM. On each iteration of the proposed method, which we call InstructZero, a soft prompt is converted into an instruction using the open-source LLM, which is then submitted to the black-box LLM for zero-shot evaluation,"},"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":"2306.03082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-06-05T17:55:22Z","cross_cats_sorted":[],"title_canon_sha256":"cd6869c480e2eacb38c1fa7ff88aa5b59cf3c328825ab6a80ebbc05284fa4c5b","abstract_canon_sha256":"057b8fa533dfa784ecc804a9fb8d30ca7c7ad0b17499111fd24075937623680e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:38:59.249479Z","signature_b64":"iW7jCFdpFo1/cOlgAvZaPKOUthIK3slZEsgt2Aw78jMOdaG3Rl4Ll1KSfykLbImDY4zYElsSntHvzo1HDglQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a60f8203d942ee6dc50ae2ba6b89c0967e9bdec6b5faa29dc05da4ebb7ee4450","last_reissued_at":"2026-07-05T06:38:59.248971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:38:59.248971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"InstructZero: Efficient Instruction Optimization for Black-Box Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Heng Huang, Jiuhai Chen, Lichang Chen, Tianyi Zhou, Tom Goldstein","submitted_at":"2023-06-05T17:55:22Z","abstract_excerpt":"Large language models~(LLMs) are instruction followers, but it can be challenging to find the best instruction for different situations, especially for black-box LLMs on which backpropagation is forbidden. Instead of directly optimizing the discrete instruction, we optimize a low-dimensional soft prompt applied to an open-source LLM to generate the instruction for the black-box LLM. On each iteration of the proposed method, which we call InstructZero, a soft prompt is converted into an instruction using the open-source LLM, which is then submitted to the black-box LLM for zero-shot evaluation,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.03082","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/2306.03082/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":"2306.03082","created_at":"2026-07-05T06:38:59.249028+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.03082v2","created_at":"2026-07-05T06:38:59.249028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03082","created_at":"2026-07-05T06:38:59.249028+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYHYEA6ZILXG","created_at":"2026-07-05T06:38:59.249028+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYHYEA6ZILXG3RIK","created_at":"2026-07-05T06:38:59.249028+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYHYEA6Z","created_at":"2026-07-05T06:38:59.249028+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24004","citing_title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09125","citing_title":"Unveiling Privacy Risks in Multi-modal Large Language Models: Task-specific Vulnerabilities and Mitigation Challenges","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00407","citing_title":"Personalization as Inverse Planning: Learning Latent Design Intents for Agentic Slide Generation via Structural Denoising","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24004","citing_title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19093","citing_title":"Embedding by Elicitation: Dynamic Representations for Bayesian Optimization of System Prompts","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11328","citing_title":"Select Smarter, Not More: Prompt-Aware Evaluation Scheduling with Submodular Guarantees","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ","json":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ.json","graph_json":"https://pith.science/api/pith-number/UYHYEA6ZILXG3RIK4K5GXCOASZ/graph.json","events_json":"https://pith.science/api/pith-number/UYHYEA6ZILXG3RIK4K5GXCOASZ/events.json","paper":"https://pith.science/paper/UYHYEA6Z"},"agent_actions":{"view_html":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ","download_json":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ.json","view_paper":"https://pith.science/paper/UYHYEA6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.03082&json=true","fetch_graph":"https://pith.science/api/pith-number/UYHYEA6ZILXG3RIK4K5GXCOASZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UYHYEA6ZILXG3RIK4K5GXCOASZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ/action/storage_attestation","attest_author":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ/action/author_attestation","sign_citation":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ/action/citation_signature","submit_replication":"https://pith.science/pith/UYHYEA6ZILXG3RIK4K5GXCOASZ/action/replication_record"}},"created_at":"2026-07-05T06:38:59.249028+00:00","updated_at":"2026-07-05T06:38:59.249028+00:00"}