{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UEI3PAXJLHWWZIRWXBWCESCCBW","short_pith_number":"pith:UEI3PAXJ","schema_version":"1.0","canonical_sha256":"a111b782e959ed6ca236b86c2248420d875dc4b783c377d22cc8e7b77ad08bcc","source":{"kind":"arxiv","id":"2301.12314","version":1},"attestation_state":"computed","paper":{"title":"Progressive Prompts: Continual Learning for Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Amjad Almahairi, Anastasia Razdaibiedina, Madian Khabsa, Mike Lewis, Rui Hou, Yuning Mao","submitted_at":"2023-01-29T00:17:38Z","abstract_excerpt":"We introduce Progressive Prompts - a simple and efficient approach for continual learning in language models. Our method allows forward transfer and resists catastrophic forgetting, without relying on data replay or a large number of task-specific parameters. Progressive Prompts learns a new soft prompt for each task and sequentially concatenates it with the previously learned prompts, while keeping the base model frozen. Experiments on standard continual learning benchmarks show that our approach outperforms state-of-the-art methods, with an improvement >20% in average test accuracy over 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":"2301.12314","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-01-29T00:17:38Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"04e0ec2100891bb3fe080bb71c78138295209d4ef4107103600537bb280331d0","abstract_canon_sha256":"7ffc5b76251278fd0a8fb3a7c4b0a0cb1301085b88fd064b1c7f5938e5602f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:37.885305Z","signature_b64":"hWKH4qvjg3YwhAVpHjo6jm0y1Y5dSUUJRXLE7Bd9o4WVpaageUzXIKI3k7zfZnreLKUlz19nLPFIXyVCv4XYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a111b782e959ed6ca236b86c2248420d875dc4b783c377d22cc8e7b77ad08bcc","last_reissued_at":"2026-07-05T05:36:37.884816Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:37.884816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Progressive Prompts: Continual Learning for Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Amjad Almahairi, Anastasia Razdaibiedina, Madian Khabsa, Mike Lewis, Rui Hou, Yuning Mao","submitted_at":"2023-01-29T00:17:38Z","abstract_excerpt":"We introduce Progressive Prompts - a simple and efficient approach for continual learning in language models. Our method allows forward transfer and resists catastrophic forgetting, without relying on data replay or a large number of task-specific parameters. Progressive Prompts learns a new soft prompt for each task and sequentially concatenates it with the previously learned prompts, while keeping the base model frozen. Experiments on standard continual learning benchmarks show that our approach outperforms state-of-the-art methods, with an improvement >20% in average test accuracy over the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12314","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/2301.12314/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":"2301.12314","created_at":"2026-07-05T05:36:37.884876+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.12314v1","created_at":"2026-07-05T05:36:37.884876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12314","created_at":"2026-07-05T05:36:37.884876+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEI3PAXJLHWW","created_at":"2026-07-05T05:36:37.884876+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEI3PAXJLHWWZIRW","created_at":"2026-07-05T05:36:37.884876+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEI3PAXJ","created_at":"2026-07-05T05:36:37.884876+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24901","citing_title":"LLM Evolution as an Industry-Scale Ecosystem: A Lifecycle Perspective on Continual Learning","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07500","citing_title":"Sparse Subspace-to-Expert Sharing for Task-Agnostic Continual Learning","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2506.21035","citing_title":"Little by Little: Continual Learning via Incremental Mixture of Rank-1 Associative Memory Experts","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2307.06435","citing_title":"A Comprehensive Overview of Large Language Models","ref_index":252,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08949","citing_title":"Muon-OGD: Muon-based Spectral Orthogonal Gradient Projection for LLM Continual Learning","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2601.03938","citing_title":"FOREVER: Forgetting Curve-Inspired Memory Replay for Language Model Continual Learning","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08949","citing_title":"Muon-OGD: Muon-based Spectral Orthogonal Gradient Projection for LLM Continual Learning","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW","json":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW.json","graph_json":"https://pith.science/api/pith-number/UEI3PAXJLHWWZIRWXBWCESCCBW/graph.json","events_json":"https://pith.science/api/pith-number/UEI3PAXJLHWWZIRWXBWCESCCBW/events.json","paper":"https://pith.science/paper/UEI3PAXJ"},"agent_actions":{"view_html":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW","download_json":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW.json","view_paper":"https://pith.science/paper/UEI3PAXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.12314&json=true","fetch_graph":"https://pith.science/api/pith-number/UEI3PAXJLHWWZIRWXBWCESCCBW/graph.json","fetch_events":"https://pith.science/api/pith-number/UEI3PAXJLHWWZIRWXBWCESCCBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW/action/storage_attestation","attest_author":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW/action/author_attestation","sign_citation":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW/action/citation_signature","submit_replication":"https://pith.science/pith/UEI3PAXJLHWWZIRWXBWCESCCBW/action/replication_record"}},"created_at":"2026-07-05T05:36:37.884876+00:00","updated_at":"2026-07-05T05:36:37.884876+00:00"}