{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JG7VL53R3HLKG7NQP2LPMPWNVR","short_pith_number":"pith:JG7VL53R","schema_version":"1.0","canonical_sha256":"49bf55f771d9d6a37db07e96f63ecdac6d960c37b45a13cc5574127dddc9fb2e","source":{"kind":"arxiv","id":"2302.03668","version":2},"attestation_state":"computed","paper":{"title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"John Kirchenbauer, Jonas Geiping, Micah Goldblum, Neel Jain, Tom Goldstein, Yuxin Wen","submitted_at":"2023-02-07T18:40:18Z","abstract_excerpt":"The strength of modern generative models lies in their ability to be controlled through text-based prompts. Typical \"hard\" prompts are made from interpretable words and tokens, and must be hand-crafted by humans. There are also \"soft\" prompts, which consist of continuous feature vectors. These can be discovered using powerful optimization methods, but they cannot be easily interpreted, re-used across models, or plugged into a text-based interface.\n  We describe an approach to robustly optimize hard text prompts through efficient gradient-based optimization. Our approach automatically generates"},"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":"2302.03668","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-07T18:40:18Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"b8d706e934d620b0755d2bb687190153c273905dd71b6592a4419a3d2e07a684","abstract_canon_sha256":"72d9cee9907576994ec4153088ca9a8f491686146683fa59a6affe480c57bdbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:15.760861Z","signature_b64":"GPvH7Eu89mEJUyGLMuiEoOxlKlonYzmGcTNElmMW/BT3LooR6wWWuQxI9dL+s+qTw3Nr0jUaA8JG+4iyS+OjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49bf55f771d9d6a37db07e96f63ecdac6d960c37b45a13cc5574127dddc9fb2e","last_reissued_at":"2026-07-05T06:16:15.760324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:15.760324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"John Kirchenbauer, Jonas Geiping, Micah Goldblum, Neel Jain, Tom Goldstein, Yuxin Wen","submitted_at":"2023-02-07T18:40:18Z","abstract_excerpt":"The strength of modern generative models lies in their ability to be controlled through text-based prompts. Typical \"hard\" prompts are made from interpretable words and tokens, and must be hand-crafted by humans. There are also \"soft\" prompts, which consist of continuous feature vectors. These can be discovered using powerful optimization methods, but they cannot be easily interpreted, re-used across models, or plugged into a text-based interface.\n  We describe an approach to robustly optimize hard text prompts through efficient gradient-based optimization. Our approach automatically generates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03668","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/2302.03668/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":"2302.03668","created_at":"2026-07-05T06:16:15.760383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.03668v2","created_at":"2026-07-05T06:16:15.760383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03668","created_at":"2026-07-05T06:16:15.760383+00:00"},{"alias_kind":"pith_short_12","alias_value":"JG7VL53R3HLK","created_at":"2026-07-05T06:16:15.760383+00:00"},{"alias_kind":"pith_short_16","alias_value":"JG7VL53R3HLKG7NQ","created_at":"2026-07-05T06:16:15.760383+00:00"},{"alias_kind":"pith_short_8","alias_value":"JG7VL53R","created_at":"2026-07-05T06:16:15.760383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09563","citing_title":"PRISM: Recovering Instruction Sets from Language Model Activations","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2307.15043","citing_title":"Universal and Transferable Adversarial Attacks on Aligned Language Models","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2310.06987","citing_title":"Catastrophic Jailbreak of Open-source LLMs via Exploiting Generation","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12484","citing_title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2309.03409","citing_title":"Large Language Models as Optimizers","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2309.00614","citing_title":"Baseline Defenses for Adversarial Attacks Against Aligned Language Models","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12484","citing_title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10582","citing_title":"Guaranteed Jailbreaking Defense via Disrupt-and-Rectify Smoothing","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24983","citing_title":"Adaptive Prompt Embedding Optimization for LLM Jailbreaking","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09920","citing_title":"Does Your VFM Speak Plant? The Botanical Grammar of Vision Foundation Models for Object Detection","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR","json":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR.json","graph_json":"https://pith.science/api/pith-number/JG7VL53R3HLKG7NQP2LPMPWNVR/graph.json","events_json":"https://pith.science/api/pith-number/JG7VL53R3HLKG7NQP2LPMPWNVR/events.json","paper":"https://pith.science/paper/JG7VL53R"},"agent_actions":{"view_html":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR","download_json":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR.json","view_paper":"https://pith.science/paper/JG7VL53R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.03668&json=true","fetch_graph":"https://pith.science/api/pith-number/JG7VL53R3HLKG7NQP2LPMPWNVR/graph.json","fetch_events":"https://pith.science/api/pith-number/JG7VL53R3HLKG7NQP2LPMPWNVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR/action/storage_attestation","attest_author":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR/action/author_attestation","sign_citation":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR/action/citation_signature","submit_replication":"https://pith.science/pith/JG7VL53R3HLKG7NQP2LPMPWNVR/action/replication_record"}},"created_at":"2026-07-05T06:16:15.760383+00:00","updated_at":"2026-07-05T06:16:15.760383+00:00"}