{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SH3R2EPWPHBB5JZM6REM2SMVOK","short_pith_number":"pith:SH3R2EPW","schema_version":"1.0","canonical_sha256":"91f71d11f679c21ea72cf448cd499572acb1e4f58a051afb7ced273d5371e78d","source":{"kind":"arxiv","id":"2502.02909","version":1},"attestation_state":"computed","paper":{"title":"SPARC: Subspace-Aware Prompt Adaptation for Robust Continual Learning in LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Amit Ranjan Trivedi (Intel Labs, Davide Ettori, Dinithi Jayasuriya, Oregon), Ranganath Krishnan, Sina Tayebati","submitted_at":"2025-02-05T06:11:55Z","abstract_excerpt":"We propose SPARC, a lightweight continual learning framework for large language models (LLMs) that enables efficient task adaptation through prompt tuning in a lower-dimensional space. By leveraging principal component analysis (PCA), we identify a compact subspace of the training data. Optimizing prompts in this lower-dimensional space enhances training efficiency, as it focuses updates on the most relevant features while reducing computational overhead. Furthermore, since the model's internal structure remains unaltered, the extensive knowledge gained from pretraining is fully preserved, ens"},"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":"2502.02909","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-05T06:11:55Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"fb64613f7d18d86a24fb0bf33782042e1903b9d671ca6d7c916b98bbad14d284","abstract_canon_sha256":"5ccbc4f71b77b328ff5f902f5878ce23d4f807872c5d433b411834f3c736e2ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:56.681646Z","signature_b64":"pGIJ/aWSK/KtmpbS91kVNbRmGMHYml4o9VDeUjBkxxN6eB/jPcPrplMFwNE8I17xi71tNf5Nom4e4xsTz0Y4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f71d11f679c21ea72cf448cd499572acb1e4f58a051afb7ced273d5371e78d","last_reissued_at":"2026-07-05T10:09:56.681178Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:56.681178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPARC: Subspace-Aware Prompt Adaptation for Robust Continual Learning in LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Amit Ranjan Trivedi (Intel Labs, Davide Ettori, Dinithi Jayasuriya, Oregon), Ranganath Krishnan, Sina Tayebati","submitted_at":"2025-02-05T06:11:55Z","abstract_excerpt":"We propose SPARC, a lightweight continual learning framework for large language models (LLMs) that enables efficient task adaptation through prompt tuning in a lower-dimensional space. By leveraging principal component analysis (PCA), we identify a compact subspace of the training data. Optimizing prompts in this lower-dimensional space enhances training efficiency, as it focuses updates on the most relevant features while reducing computational overhead. Furthermore, since the model's internal structure remains unaltered, the extensive knowledge gained from pretraining is fully preserved, ens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02909","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/2502.02909/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":"2502.02909","created_at":"2026-07-05T10:09:56.681231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02909v1","created_at":"2026-07-05T10:09:56.681231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02909","created_at":"2026-07-05T10:09:56.681231+00:00"},{"alias_kind":"pith_short_12","alias_value":"SH3R2EPWPHBB","created_at":"2026-07-05T10:09:56.681231+00:00"},{"alias_kind":"pith_short_16","alias_value":"SH3R2EPWPHBB5JZM","created_at":"2026-07-05T10:09:56.681231+00:00"},{"alias_kind":"pith_short_8","alias_value":"SH3R2EPW","created_at":"2026-07-05T10:09:56.681231+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05248","citing_title":"Improving Sparse Memory Finetuning","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK","json":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK.json","graph_json":"https://pith.science/api/pith-number/SH3R2EPWPHBB5JZM6REM2SMVOK/graph.json","events_json":"https://pith.science/api/pith-number/SH3R2EPWPHBB5JZM6REM2SMVOK/events.json","paper":"https://pith.science/paper/SH3R2EPW"},"agent_actions":{"view_html":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK","download_json":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK.json","view_paper":"https://pith.science/paper/SH3R2EPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02909&json=true","fetch_graph":"https://pith.science/api/pith-number/SH3R2EPWPHBB5JZM6REM2SMVOK/graph.json","fetch_events":"https://pith.science/api/pith-number/SH3R2EPWPHBB5JZM6REM2SMVOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK/action/storage_attestation","attest_author":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK/action/author_attestation","sign_citation":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK/action/citation_signature","submit_replication":"https://pith.science/pith/SH3R2EPWPHBB5JZM6REM2SMVOK/action/replication_record"}},"created_at":"2026-07-05T10:09:56.681231+00:00","updated_at":"2026-07-05T10:09:56.681231+00:00"}