{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZC3GBRZQJIDIWHK3X3IGCDLOKD","short_pith_number":"pith:ZC3GBRZQ","schema_version":"1.0","canonical_sha256":"c8b660c7304a068b1d5bbed0610d6e50ea13d3e83ee7671ab0aa5c26741c9c93","source":{"kind":"arxiv","id":"2503.10617","version":3},"attestation_state":"computed","paper":{"title":"Compositional Subspace Representation Fine-tuning for Adaptive Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Andy Zhou","submitted_at":"2025-03-13T17:57:04Z","abstract_excerpt":"Adapting large language models to multiple tasks can cause cross-skill interference, where improvements for one skill degrade another. While methods such as LoRA impose orthogonality constraints at the weight level, they do not fully address interference in hidden-state representations. We propose Compositional Subspace Representation Fine-tuning (CS-ReFT), a novel representation-based approach that learns multiple orthonormal subspace transformations, each specializing in a distinct skill, and composes them via a lightweight router. By isolating these subspace edits in the hidden state, rathe"},"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":"2503.10617","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-03-13T17:57:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fbc6b284198b02328191ffcb7f5a1cc0f8b8258e2868b4a4d873dcd97d1338cf","abstract_canon_sha256":"f00e8c514d5c4bb9423e5756f55e0bd0ae692c0ec9cb780fa9bb5828a4f406d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:15.638854Z","signature_b64":"JK2By5JacAyVr9IxigyH+1+npXhpjzAc7L7JPD1qAtVDpAoK4cOw5SmTG3Fck8clA3A0m+XrJkY1hfa97UsuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b660c7304a068b1d5bbed0610d6e50ea13d3e83ee7671ab0aa5c26741c9c93","last_reissued_at":"2026-07-05T10:54:15.638300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:15.638300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositional Subspace Representation Fine-tuning for Adaptive Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Andy Zhou","submitted_at":"2025-03-13T17:57:04Z","abstract_excerpt":"Adapting large language models to multiple tasks can cause cross-skill interference, where improvements for one skill degrade another. While methods such as LoRA impose orthogonality constraints at the weight level, they do not fully address interference in hidden-state representations. We propose Compositional Subspace Representation Fine-tuning (CS-ReFT), a novel representation-based approach that learns multiple orthonormal subspace transformations, each specializing in a distinct skill, and composes them via a lightweight router. By isolating these subspace edits in the hidden state, rathe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10617","kind":"arxiv","version":3},"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/2503.10617/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":"2503.10617","created_at":"2026-07-05T10:54:15.638381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10617v3","created_at":"2026-07-05T10:54:15.638381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10617","created_at":"2026-07-05T10:54:15.638381+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZC3GBRZQJIDI","created_at":"2026-07-05T10:54:15.638381+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZC3GBRZQJIDIWHK3","created_at":"2026-07-05T10:54:15.638381+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZC3GBRZQ","created_at":"2026-07-05T10:54:15.638381+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08702","citing_title":"Gate-and-Merge: Zero-shot Compositional Personalization of Vision Language Models","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD","json":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD.json","graph_json":"https://pith.science/api/pith-number/ZC3GBRZQJIDIWHK3X3IGCDLOKD/graph.json","events_json":"https://pith.science/api/pith-number/ZC3GBRZQJIDIWHK3X3IGCDLOKD/events.json","paper":"https://pith.science/paper/ZC3GBRZQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD","download_json":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD.json","view_paper":"https://pith.science/paper/ZC3GBRZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10617&json=true","fetch_graph":"https://pith.science/api/pith-number/ZC3GBRZQJIDIWHK3X3IGCDLOKD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZC3GBRZQJIDIWHK3X3IGCDLOKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD/action/storage_attestation","attest_author":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD/action/author_attestation","sign_citation":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD/action/citation_signature","submit_replication":"https://pith.science/pith/ZC3GBRZQJIDIWHK3X3IGCDLOKD/action/replication_record"}},"created_at":"2026-07-05T10:54:15.638381+00:00","updated_at":"2026-07-05T10:54:15.638381+00:00"}