{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BI3XZEWJTGNOYNCTBJIOWLLCCL","short_pith_number":"pith:BI3XZEWJ","schema_version":"1.0","canonical_sha256":"0a377c92c9999aec34530a50eb2d6212f8d74ae5f826607a86e4d9b640593014","source":{"kind":"arxiv","id":"2309.14763","version":1},"attestation_state":"computed","paper":{"title":"ConPET: Continual Parameter-Efficient Tuning for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chen Chen, Chenyang Song, Kuai Li, Maosong Sun, Tao Yang, Xu Han, Zheni Zeng, Zhiyuan Liu","submitted_at":"2023-09-26T08:52:04Z","abstract_excerpt":"Continual learning necessitates the continual adaptation of models to newly emerging tasks while minimizing the catastrophic forgetting of old ones. This is extremely challenging for large language models (LLMs) with vanilla full-parameter tuning due to high computation costs, memory consumption, and forgetting issue. Inspired by the success of parameter-efficient tuning (PET), we propose Continual Parameter-Efficient Tuning (ConPET), a generalizable paradigm for continual task adaptation of LLMs with task-number-independent training complexity. ConPET includes two versions with different appl"},"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":"2309.14763","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-09-26T08:52:04Z","cross_cats_sorted":[],"title_canon_sha256":"68525f68fe263fafe90346aa14511956bcc48f0a4df344ac815649632b3b9886","abstract_canon_sha256":"a17f79c2e8fe5579a85c70a617ccda3bc47eb4323828214b7b970f5ab7730918"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:33.914865Z","signature_b64":"aBU7668vuo9QPbYV1PuYpaF9cuS3MF8JfAQ5I69EKC19Tjb4OBfOxG2ftJxZZpXfTinBvgdtdUz/4JoyoMTwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a377c92c9999aec34530a50eb2d6212f8d74ae5f826607a86e4d9b640593014","last_reissued_at":"2026-07-05T09:25:33.914368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:33.914368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ConPET: Continual Parameter-Efficient Tuning for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chen Chen, Chenyang Song, Kuai Li, Maosong Sun, Tao Yang, Xu Han, Zheni Zeng, Zhiyuan Liu","submitted_at":"2023-09-26T08:52:04Z","abstract_excerpt":"Continual learning necessitates the continual adaptation of models to newly emerging tasks while minimizing the catastrophic forgetting of old ones. This is extremely challenging for large language models (LLMs) with vanilla full-parameter tuning due to high computation costs, memory consumption, and forgetting issue. Inspired by the success of parameter-efficient tuning (PET), we propose Continual Parameter-Efficient Tuning (ConPET), a generalizable paradigm for continual task adaptation of LLMs with task-number-independent training complexity. ConPET includes two versions with different appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14763","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/2309.14763/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":"2309.14763","created_at":"2026-07-05T09:25:33.914436+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14763v1","created_at":"2026-07-05T09:25:33.914436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14763","created_at":"2026-07-05T09:25:33.914436+00:00"},{"alias_kind":"pith_short_12","alias_value":"BI3XZEWJTGNO","created_at":"2026-07-05T09:25:33.914436+00:00"},{"alias_kind":"pith_short_16","alias_value":"BI3XZEWJTGNOYNCT","created_at":"2026-07-05T09:25:33.914436+00:00"},{"alias_kind":"pith_short_8","alias_value":"BI3XZEWJ","created_at":"2026-07-05T09:25:33.914436+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.02503","citing_title":"Continual Gradient Low-Rank Projection Fine-Tuning for LLMs","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL","json":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL.json","graph_json":"https://pith.science/api/pith-number/BI3XZEWJTGNOYNCTBJIOWLLCCL/graph.json","events_json":"https://pith.science/api/pith-number/BI3XZEWJTGNOYNCTBJIOWLLCCL/events.json","paper":"https://pith.science/paper/BI3XZEWJ"},"agent_actions":{"view_html":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL","download_json":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL.json","view_paper":"https://pith.science/paper/BI3XZEWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14763&json=true","fetch_graph":"https://pith.science/api/pith-number/BI3XZEWJTGNOYNCTBJIOWLLCCL/graph.json","fetch_events":"https://pith.science/api/pith-number/BI3XZEWJTGNOYNCTBJIOWLLCCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL/action/storage_attestation","attest_author":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL/action/author_attestation","sign_citation":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL/action/citation_signature","submit_replication":"https://pith.science/pith/BI3XZEWJTGNOYNCTBJIOWLLCCL/action/replication_record"}},"created_at":"2026-07-05T09:25:33.914436+00:00","updated_at":"2026-07-05T09:25:33.914436+00:00"}