{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KZEC76MQ4FZGSBIDUM5VV4NB4H","short_pith_number":"pith:KZEC76MQ","schema_version":"1.0","canonical_sha256":"56482ff990e172690503a33b5af1a1e1dad14c58ac4dcbcb4f6e583ef33b621b","source":{"kind":"arxiv","id":"2210.11292","version":2},"attestation_state":"computed","paper":{"title":"Late Prompt Tuning: A Late Prompt Could Be Better Than Many Prompts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Tianxiang Sun, Xiangyang Liu, Xipeng Qiu, Xuanjing Huang","submitted_at":"2022-10-20T14:23:52Z","abstract_excerpt":"Prompt tuning is a parameter-efficient tuning (PETuning) method for utilizing pre-trained models (PTMs) that simply prepends a soft prompt to the input and only optimizes the prompt to adapt PTMs to downstream tasks. Although it is parameter- and deployment-efficient, its performance still lags behind other state-of-the-art PETuning methods. Besides, the training cost of prompt tuning is not significantly reduced due to the back-propagation through the entire model. Through empirical analyses, we shed some light on the lagging performance of prompt tuning and recognize a trade-off between the "},"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":"2210.11292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-20T14:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"e09285fe57fe01d4d7d55ec309da17e1e69205c0ec16c1ece67a886749b0e48f","abstract_canon_sha256":"eff001057c2c262e0425db928293531d2d85ef17c35a2906ed390cec8e6a84cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:53.823979Z","signature_b64":"zen43wWhCMNK1b0E0j2UFPeidpDuYabDOo+eUS3O0AsrjdFpn8tv6M1gXNE6lSoHHOMUvdIG5NIUyS9R72wWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56482ff990e172690503a33b5af1a1e1dad14c58ac4dcbcb4f6e583ef33b621b","last_reissued_at":"2026-07-05T05:08:53.823531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:53.823531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Late Prompt Tuning: A Late Prompt Could Be Better Than Many Prompts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Tianxiang Sun, Xiangyang Liu, Xipeng Qiu, Xuanjing Huang","submitted_at":"2022-10-20T14:23:52Z","abstract_excerpt":"Prompt tuning is a parameter-efficient tuning (PETuning) method for utilizing pre-trained models (PTMs) that simply prepends a soft prompt to the input and only optimizes the prompt to adapt PTMs to downstream tasks. Although it is parameter- and deployment-efficient, its performance still lags behind other state-of-the-art PETuning methods. Besides, the training cost of prompt tuning is not significantly reduced due to the back-propagation through the entire model. Through empirical analyses, we shed some light on the lagging performance of prompt tuning and recognize a trade-off between the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.11292","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/2210.11292/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":"2210.11292","created_at":"2026-07-05T05:08:53.823591+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.11292v2","created_at":"2026-07-05T05:08:53.823591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.11292","created_at":"2026-07-05T05:08:53.823591+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZEC76MQ4FZG","created_at":"2026-07-05T05:08:53.823591+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZEC76MQ4FZGSBID","created_at":"2026-07-05T05:08:53.823591+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZEC76MQ","created_at":"2026-07-05T05:08:53.823591+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H","json":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H.json","graph_json":"https://pith.science/api/pith-number/KZEC76MQ4FZGSBIDUM5VV4NB4H/graph.json","events_json":"https://pith.science/api/pith-number/KZEC76MQ4FZGSBIDUM5VV4NB4H/events.json","paper":"https://pith.science/paper/KZEC76MQ"},"agent_actions":{"view_html":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H","download_json":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H.json","view_paper":"https://pith.science/paper/KZEC76MQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.11292&json=true","fetch_graph":"https://pith.science/api/pith-number/KZEC76MQ4FZGSBIDUM5VV4NB4H/graph.json","fetch_events":"https://pith.science/api/pith-number/KZEC76MQ4FZGSBIDUM5VV4NB4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H/action/storage_attestation","attest_author":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H/action/author_attestation","sign_citation":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H/action/citation_signature","submit_replication":"https://pith.science/pith/KZEC76MQ4FZGSBIDUM5VV4NB4H/action/replication_record"}},"created_at":"2026-07-05T05:08:53.823591+00:00","updated_at":"2026-07-05T05:08:53.823591+00:00"}