{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4JYV5KLWGUS2KDU5BVDCTGZXRU","short_pith_number":"pith:4JYV5KLW","schema_version":"1.0","canonical_sha256":"e2715ea9763525a50e9d0d46299b378d133036158394ca1661df397ed9f8ded6","source":{"kind":"arxiv","id":"2505.22934","version":2},"attestation_state":"computed","paper":{"title":"Unraveling LoRA Interference: Orthogonal Subspaces for Robust Model Merging","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Haobo Zhang, Jiayu Zhou","submitted_at":"2025-05-28T23:28:12Z","abstract_excerpt":"Fine-tuning large language models (LMs) for individual tasks yields strong performance but is expensive for deployment and storage. Recent works explore model merging to combine multiple task-specific models into a single multi-task model without additional training. However, existing merging methods often fail for models fine-tuned with low-rank adaptation (LoRA), due to significant performance degradation. In this paper, we show that this issue arises from a previously overlooked interplay between model parameters and data distributions. We propose Orthogonal Subspaces for Robust model Mergi"},"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":"2505.22934","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-28T23:28:12Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"52bfb6c9bd04d47d5ae06633487096c9ae9d085634f088502edb180e17791b96","abstract_canon_sha256":"d354a442edecdd7561df567139d2f35b0ada6de9e6b6d5fd7d4d934b3682f76a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:16.312861Z","signature_b64":"v6iFPY77NKryOPz3Dhdd1Kc9s3VWOB83my2iFGldOYrdBZ16nI4nVgmmrfbMMyVAPuL0VCuuAh1jagPcUDp5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2715ea9763525a50e9d0d46299b378d133036158394ca1661df397ed9f8ded6","last_reissued_at":"2026-06-01T01:02:16.311711Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:16.311711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unraveling LoRA Interference: Orthogonal Subspaces for Robust Model Merging","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Haobo Zhang, Jiayu Zhou","submitted_at":"2025-05-28T23:28:12Z","abstract_excerpt":"Fine-tuning large language models (LMs) for individual tasks yields strong performance but is expensive for deployment and storage. Recent works explore model merging to combine multiple task-specific models into a single multi-task model without additional training. However, existing merging methods often fail for models fine-tuned with low-rank adaptation (LoRA), due to significant performance degradation. In this paper, we show that this issue arises from a previously overlooked interplay between model parameters and data distributions. We propose Orthogonal Subspaces for Robust model Mergi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22934","kind":"arxiv","version":2},"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/2505.22934/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":"2505.22934","created_at":"2026-06-01T01:02:16.311880+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22934v2","created_at":"2026-06-01T01:02:16.311880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22934","created_at":"2026-06-01T01:02:16.311880+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JYV5KLWGUS2","created_at":"2026-06-01T01:02:16.311880+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JYV5KLWGUS2KDU5","created_at":"2026-06-01T01:02:16.311880+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JYV5KLW","created_at":"2026-06-01T01:02:16.311880+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2408.07666","citing_title":"Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunities","ref_index":288,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU","json":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU.json","graph_json":"https://pith.science/api/pith-number/4JYV5KLWGUS2KDU5BVDCTGZXRU/graph.json","events_json":"https://pith.science/api/pith-number/4JYV5KLWGUS2KDU5BVDCTGZXRU/events.json","paper":"https://pith.science/paper/4JYV5KLW"},"agent_actions":{"view_html":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU","download_json":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU.json","view_paper":"https://pith.science/paper/4JYV5KLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22934&json=true","fetch_graph":"https://pith.science/api/pith-number/4JYV5KLWGUS2KDU5BVDCTGZXRU/graph.json","fetch_events":"https://pith.science/api/pith-number/4JYV5KLWGUS2KDU5BVDCTGZXRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU/action/storage_attestation","attest_author":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU/action/author_attestation","sign_citation":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU/action/citation_signature","submit_replication":"https://pith.science/pith/4JYV5KLWGUS2KDU5BVDCTGZXRU/action/replication_record"}},"created_at":"2026-06-01T01:02:16.311880+00:00","updated_at":"2026-06-01T01:02:16.311880+00:00"}