{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WK2R4PQTKOWYCBXE7ZX7BLOAPG","short_pith_number":"pith:WK2R4PQT","canonical_record":{"source":{"id":"2605.13162","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"e03bc4a3a5bb330f2af76e8f58554e665b0a5bd5ca227b50a1fe3ab801eca6b5","abstract_canon_sha256":"4da11ee8ea1144d415a32efb840f40a16c2ba64462d3c68bef8cbd5c4b31b6ff"},"schema_version":"1.0"},"canonical_sha256":"b2b51e3e1353ad8106e4fe6ff0adc079b849695cd66ae99f2e92d65d245fca78","source":{"kind":"arxiv","id":"2605.13162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13162","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13162v1","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13162","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"pith_short_12","alias_value":"WK2R4PQTKOWY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WK2R4PQTKOWYCBXE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WK2R4PQT","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WK2R4PQTKOWYCBXE7ZX7BLOAPG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13162","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"e03bc4a3a5bb330f2af76e8f58554e665b0a5bd5ca227b50a1fe3ab801eca6b5","abstract_canon_sha256":"4da11ee8ea1144d415a32efb840f40a16c2ba64462d3c68bef8cbd5c4b31b6ff"},"schema_version":"1.0"},"canonical_sha256":"b2b51e3e1353ad8106e4fe6ff0adc079b849695cd66ae99f2e92d65d245fca78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:56.835638Z","signature_b64":"YrD3JLJ6CCq4r3+gEEmjVLQaldbPWiUqWOqhtExjFs3NawoEQ3/oJgYvgUQk6EjbXTEUux65sR0nBBFRowdTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2b51e3e1353ad8106e4fe6ff0adc079b849695cd66ae99f2e92d65d245fca78","last_reissued_at":"2026-05-18T03:08:56.834900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:56.834900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13162","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lia7ZqpWVVI3PD7frRhlKhLiHnd8GxaGedP51RR5IBAVtU/+NQRSV+L55XGQvJ95Xs5X0JMIsqPYtde2VNYsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:49:53.101917Z"},"content_sha256":"15e31ca2122da30067f636598e94407ae65709ebf911eccf18463d74030c3a05","schema_version":"1.0","event_id":"sha256:15e31ca2122da30067f636598e94407ae65709ebf911eccf18463d74030c3a05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WK2R4PQTKOWYCBXE7ZX7BLOAPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continual Fine-Tuning of Large Language Models via Program Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Organizing LoRA adapters into input-retrieved program memory slots improves retention and reduces catastrophic forgetting during sequential fine-tuning of large language models.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hung Le, Svetha Venkatesh","submitted_at":"2026-05-13T08:26:37Z","abstract_excerpt":"Parameter-Efficient Fine-Tuning (PEFT), particularly Low-Rank Adaptation (LoRA), has become a standard approach for adapting Large Language Models (LLMs) under limited compute. However, in continual settings where models are updated sequentially with small datasets, conventional LoRA updates struggle to balance rapid adaptation and knowledge retention. Existing methods typically treat the low-rank space as a homogeneous update region, lacking mechanisms to regulate how short-term updates are consolidated over time. We propose a continual LoRA framework with \\textbf{Pro}gram memory, inspired by"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments on diverse benchmarks demonstrate improved retention and reduced catastrophic forgetting over other continual LoRA strategies.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That input-conditioned attention can reliably retrieve and consolidate short-term LoRA updates into a stable distributed representation while preserving unused capacity for future tasks, without introducing hidden costs or interference.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ProCL organizes LoRA adapters into input-conditioned program memory slots that combine with a distributed adapter to improve retention and reduce forgetting in continual LLM fine-tuning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Organizing LoRA adapters into input-retrieved program memory slots improves retention and reduces catastrophic forgetting during sequential fine-tuning of large language models.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4f5a257abe12891e34906b9e5090cc34d2d77b9f87080d42acf0ba3122c0239b"},"source":{"id":"2605.13162","kind":"arxiv","version":1},"verdict":{"id":"793d3998-1fc5-48cf-9263-102556aade5a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:11:45.150254Z","strongest_claim":"Experiments on diverse benchmarks demonstrate improved retention and reduced catastrophic forgetting over other continual LoRA strategies.","one_line_summary":"ProCL organizes LoRA adapters into input-conditioned program memory slots that combine with a distributed adapter to improve retention and reduce forgetting in continual LLM fine-tuning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That input-conditioned attention can reliably retrieve and consolidate short-term LoRA updates into a stable distributed representation while preserving unused capacity for future tasks, without introducing hidden costs or interference.","pith_extraction_headline":"Organizing LoRA adapters into input-retrieved program memory slots improves retention and reduces catastrophic forgetting during sequential fine-tuning of large language models."},"references":{"count":35,"sample":[{"doi":"","year":2025,"title":"Superrag: Beyond rag with layout-aware graph modeling , author=. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Langu","work_id":"e3ed5d6e-6215-4ae4-8b47-a96d5c03eca8","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Transactions on Machine Learning Research , year=","work_id":"4c91853a-382d-4c30-ba88-1f34cdc0566b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining , pages=","work_id":"6c19f685-60bd-46d3-8083-2706287d2fd4","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","work_id":"8332db0d-53f5-4952-8dd2-fd5dbadbe02d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The Thirteenth International Conference on Learning Representations , year=","work_id":"41dc8281-bdf1-4b95-a842-5fbd416af48c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":35,"snapshot_sha256":"1d6b4201299f6bbac32ecab15f7ee094bd92f2271640b3dbdbd7444c9edbbbba","internal_anchors":3},"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"},"verdict_id":"793d3998-1fc5-48cf-9263-102556aade5a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tU15ulQ4C/kVcBb/0GBcZ24dAR0SyYGDIj4GEd54AumL19a2BgK6/w0cjaKf0FNiihVH+LTso1WP61897MneAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:49:53.102442Z"},"content_sha256":"8166e6c93fb0e3ec394503f4baeec8e2d36f1cbd590b9cbb31a2b0c18414d878","schema_version":"1.0","event_id":"sha256:8166e6c93fb0e3ec394503f4baeec8e2d36f1cbd590b9cbb31a2b0c18414d878"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WK2R4PQTKOWYCBXE7ZX7BLOAPG/bundle.json","state_url":"https://pith.science/pith/WK2R4PQTKOWYCBXE7ZX7BLOAPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WK2R4PQTKOWYCBXE7ZX7BLOAPG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T11:49:53Z","links":{"resolver":"https://pith.science/pith/WK2R4PQTKOWYCBXE7ZX7BLOAPG","bundle":"https://pith.science/pith/WK2R4PQTKOWYCBXE7ZX7BLOAPG/bundle.json","state":"https://pith.science/pith/WK2R4PQTKOWYCBXE7ZX7BLOAPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WK2R4PQTKOWYCBXE7ZX7BLOAPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WK2R4PQTKOWYCBXE7ZX7BLOAPG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4da11ee8ea1144d415a32efb840f40a16c2ba64462d3c68bef8cbd5c4b31b6ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:26:37Z","title_canon_sha256":"e03bc4a3a5bb330f2af76e8f58554e665b0a5bd5ca227b50a1fe3ab801eca6b5"},"schema_version":"1.0","source":{"id":"2605.13162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13162","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13162v1","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13162","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"pith_short_12","alias_value":"WK2R4PQTKOWY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WK2R4PQTKOWYCBXE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WK2R4PQT","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:8166e6c93fb0e3ec394503f4baeec8e2d36f1cbd590b9cbb31a2b0c18414d878","target":"graph","created_at":"2026-05-18T03:08:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Experiments on diverse benchmarks demonstrate improved retention and reduced catastrophic forgetting over other continual LoRA strategies."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That input-conditioned attention can reliably retrieve and consolidate short-term LoRA updates into a stable distributed representation while preserving unused capacity for future tasks, without introducing hidden costs or interference."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ProCL organizes LoRA adapters into input-conditioned program memory slots that combine with a distributed adapter to improve retention and reduce forgetting in continual LLM fine-tuning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Organizing LoRA adapters into input-retrieved program memory slots improves retention and reduces catastrophic forgetting during sequential fine-tuning of large language models."}],"snapshot_sha256":"4f5a257abe12891e34906b9e5090cc34d2d77b9f87080d42acf0ba3122c0239b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Parameter-Efficient Fine-Tuning (PEFT), particularly Low-Rank Adaptation (LoRA), has become a standard approach for adapting Large Language Models (LLMs) under limited compute. However, in continual settings where models are updated sequentially with small datasets, conventional LoRA updates struggle to balance rapid adaptation and knowledge retention. Existing methods typically treat the low-rank space as a homogeneous update region, lacking mechanisms to regulate how short-term updates are consolidated over time. We propose a continual LoRA framework with \\textbf{Pro}gram memory, inspired by","authors_text":"Hung Le, Svetha Venkatesh","cross_cats":[],"headline":"Organizing LoRA adapters into input-retrieved program memory slots improves retention and reduces catastrophic forgetting during sequential fine-tuning of large language models.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:26:37Z","title":"Continual Fine-Tuning of Large Language Models via Program Memory"},"references":{"count":35,"internal_anchors":3,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Superrag: Beyond rag with layout-aware graph modeling , author=. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Langu","work_id":"e3ed5d6e-6215-4ae4-8b47-a96d5c03eca8","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Transactions on Machine Learning Research , year=","work_id":"4c91853a-382d-4c30-ba88-1f34cdc0566b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining , pages=","work_id":"6c19f685-60bd-46d3-8083-2706287d2fd4","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","work_id":"8332db0d-53f5-4952-8dd2-fd5dbadbe02d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The Thirteenth International Conference on Learning Representations , year=","work_id":"41dc8281-bdf1-4b95-a842-5fbd416af48c","year":null}],"snapshot_sha256":"1d6b4201299f6bbac32ecab15f7ee094bd92f2271640b3dbdbd7444c9edbbbba"},"source":{"id":"2605.13162","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:11:45.150254Z","id":"793d3998-1fc5-48cf-9263-102556aade5a","model_set":{"reader":"grok-4.3"},"one_line_summary":"ProCL organizes LoRA adapters into input-conditioned program memory slots that combine with a distributed adapter to improve retention and reduce forgetting in continual LLM fine-tuning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Organizing LoRA adapters into input-retrieved program memory slots improves retention and reduces catastrophic forgetting during sequential fine-tuning of large language models.","strongest_claim":"Experiments on diverse benchmarks demonstrate improved retention and reduced catastrophic forgetting over other continual LoRA strategies.","weakest_assumption":"That input-conditioned attention can reliably retrieve and consolidate short-term LoRA updates into a stable distributed representation while preserving unused capacity for future tasks, without introducing hidden costs or interference."}},"verdict_id":"793d3998-1fc5-48cf-9263-102556aade5a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:15e31ca2122da30067f636598e94407ae65709ebf911eccf18463d74030c3a05","target":"record","created_at":"2026-05-18T03:08:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4da11ee8ea1144d415a32efb840f40a16c2ba64462d3c68bef8cbd5c4b31b6ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:26:37Z","title_canon_sha256":"e03bc4a3a5bb330f2af76e8f58554e665b0a5bd5ca227b50a1fe3ab801eca6b5"},"schema_version":"1.0","source":{"id":"2605.13162","kind":"arxiv","version":1}},"canonical_sha256":"b2b51e3e1353ad8106e4fe6ff0adc079b849695cd66ae99f2e92d65d245fca78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2b51e3e1353ad8106e4fe6ff0adc079b849695cd66ae99f2e92d65d245fca78","first_computed_at":"2026-05-18T03:08:56.834900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:56.834900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YrD3JLJ6CCq4r3+gEEmjVLQaldbPWiUqWOqhtExjFs3NawoEQ3/oJgYvgUQk6EjbXTEUux65sR0nBBFRowdTCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:56.835638Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15e31ca2122da30067f636598e94407ae65709ebf911eccf18463d74030c3a05","sha256:8166e6c93fb0e3ec394503f4baeec8e2d36f1cbd590b9cbb31a2b0c18414d878"],"state_sha256":"4450314dd64794ac2fd9668d408d5473ec2fc42135a8280ffd3df60540b5a93f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+HVXMYSYDEncDOlVYfdrMTMXaxT2HkmGqjxhMcneEFnML8Bpn80oS1xGJj5G7f9/F3Z7NXMGXBKphu9g1k0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T11:49:53.104857Z","bundle_sha256":"be8232df66b2274571f260b83bde1023b6fa226596756201d0cb1d5cc5e3cbd9"}}