{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Y2NIZDPWVBKC47B56VDCASRLGH","short_pith_number":"pith:Y2NIZDPW","schema_version":"1.0","canonical_sha256":"c69a8c8df6a8542e7c3df546204a2b31d98d4600aefd92691a660f47ac1a3fc0","source":{"kind":"arxiv","id":"2406.19486","version":1},"attestation_state":"computed","paper":{"title":"LoPT: Low-Rank Prompt Tuning for Parameter Efficient Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.ET","cs.LG","eess.SP"],"primary_cat":"cs.CL","authors_text":"Keng-hao Chang, Shouchang Guo, Sonam Damani","submitted_at":"2024-06-27T19:02:41Z","abstract_excerpt":"In prompt tuning, a prefix or suffix text is added to the prompt, and the embeddings (soft prompts) or token indices (hard prompts) of the prefix/suffix are optimized to gain more control over language models for specific tasks. This approach eliminates the need for hand-crafted prompt engineering or explicit model fine-tuning. Prompt tuning is significantly more parameter-efficient than model fine-tuning, as it involves optimizing partial inputs of language models to produce desired outputs.\n  In this work, we aim to further reduce the amount of trainable parameters required for a language mo"},"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":"2406.19486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-06-27T19:02:41Z","cross_cats_sorted":["cs.AI","cs.ET","cs.LG","eess.SP"],"title_canon_sha256":"b761b8e9dc7022bc636f205cc98621063ac43378ab568dc15587bd8dadeed04e","abstract_canon_sha256":"c5b9a6f179c97a2c8384eb806b997e57d08b6320178c6fba459821548e1b30fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:40.181216Z","signature_b64":"WdU3uvzi7No+ViM2aKMRr+ej0FY71sf+T3bFjffei/BwWsZs4UII+tpk494ok2wJrgrh+msr4kH/BqjyhiCIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c69a8c8df6a8542e7c3df546204a2b31d98d4600aefd92691a660f47ac1a3fc0","last_reissued_at":"2026-07-05T08:37:40.180821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:40.180821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoPT: Low-Rank Prompt Tuning for Parameter Efficient Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.ET","cs.LG","eess.SP"],"primary_cat":"cs.CL","authors_text":"Keng-hao Chang, Shouchang Guo, Sonam Damani","submitted_at":"2024-06-27T19:02:41Z","abstract_excerpt":"In prompt tuning, a prefix or suffix text is added to the prompt, and the embeddings (soft prompts) or token indices (hard prompts) of the prefix/suffix are optimized to gain more control over language models for specific tasks. This approach eliminates the need for hand-crafted prompt engineering or explicit model fine-tuning. Prompt tuning is significantly more parameter-efficient than model fine-tuning, as it involves optimizing partial inputs of language models to produce desired outputs.\n  In this work, we aim to further reduce the amount of trainable parameters required for a language mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19486","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/2406.19486/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":"2406.19486","created_at":"2026-07-05T08:37:40.180869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19486v1","created_at":"2026-07-05T08:37:40.180869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19486","created_at":"2026-07-05T08:37:40.180869+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2NIZDPWVBKC","created_at":"2026-07-05T08:37:40.180869+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2NIZDPWVBKC47B5","created_at":"2026-07-05T08:37:40.180869+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2NIZDPW","created_at":"2026-07-05T08:37:40.180869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.04501","citing_title":"Ultra-Low-Dimensional Prompt Tuning via Random Projection","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH","json":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH.json","graph_json":"https://pith.science/api/pith-number/Y2NIZDPWVBKC47B56VDCASRLGH/graph.json","events_json":"https://pith.science/api/pith-number/Y2NIZDPWVBKC47B56VDCASRLGH/events.json","paper":"https://pith.science/paper/Y2NIZDPW"},"agent_actions":{"view_html":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH","download_json":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH.json","view_paper":"https://pith.science/paper/Y2NIZDPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19486&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2NIZDPWVBKC47B56VDCASRLGH/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2NIZDPWVBKC47B56VDCASRLGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH/action/storage_attestation","attest_author":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH/action/author_attestation","sign_citation":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH/action/citation_signature","submit_replication":"https://pith.science/pith/Y2NIZDPWVBKC47B56VDCASRLGH/action/replication_record"}},"created_at":"2026-07-05T08:37:40.180869+00:00","updated_at":"2026-07-05T08:37:40.180869+00:00"}