{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TOBBCW3P7NZDAE447W7Q3GTZPT","short_pith_number":"pith:TOBBCW3P","schema_version":"1.0","canonical_sha256":"9b82115b6ffb7230139cfdbf0d9a797cfb47486a0d4e657546fd0abfbed58983","source":{"kind":"arxiv","id":"2311.11696","version":1},"attestation_state":"computed","paper":{"title":"Sparse Low-rank Adaptation of Pre-trained Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Bowen Zhou, Maosong Sun, Ning Ding, Qiaosen Wang, Xingtai Lv, Yulin Chen, Zhiyuan Liu","submitted_at":"2023-11-20T11:56:25Z","abstract_excerpt":"Fine-tuning pre-trained large language models in a parameter-efficient manner is widely studied for its effectiveness and efficiency. The popular method of low-rank adaptation (LoRA) offers a notable approach, hypothesizing that the adaptation process is intrinsically low-dimensional. Although LoRA has demonstrated commendable performance, it is implemented with a fixed and unalterable intrinsic rank that might not always be the ideal choice. Recognizing the need for more flexible adaptation, we extend the methodology of LoRA to an innovative approach we call sparse low-rank adaptation (SoRA) "},"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":"2311.11696","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-11-20T11:56:25Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cb5a59350deb9516bef12528183357a1cb0201b9a46f40ac3b8a1596539c45fe","abstract_canon_sha256":"48793fbaf912c77e21d347214e88faf25af7c9333392188469e5d1a3a6b3bae6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:37.871199Z","signature_b64":"5IBvBHqxHnGurfNDIZi+5upg8Pl2Q5uTTrEsBpkvCDJRcjK5WvW4CRPE5Uln+vA9Z9gbR9yhOfBtpCDakk/RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b82115b6ffb7230139cfdbf0d9a797cfb47486a0d4e657546fd0abfbed58983","last_reissued_at":"2026-07-05T07:14:37.870759Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:37.870759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Low-rank Adaptation of Pre-trained Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Bowen Zhou, Maosong Sun, Ning Ding, Qiaosen Wang, Xingtai Lv, Yulin Chen, Zhiyuan Liu","submitted_at":"2023-11-20T11:56:25Z","abstract_excerpt":"Fine-tuning pre-trained large language models in a parameter-efficient manner is widely studied for its effectiveness and efficiency. The popular method of low-rank adaptation (LoRA) offers a notable approach, hypothesizing that the adaptation process is intrinsically low-dimensional. Although LoRA has demonstrated commendable performance, it is implemented with a fixed and unalterable intrinsic rank that might not always be the ideal choice. Recognizing the need for more flexible adaptation, we extend the methodology of LoRA to an innovative approach we call sparse low-rank adaptation (SoRA) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.11696","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/2311.11696/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":"2311.11696","created_at":"2026-07-05T07:14:37.870814+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.11696v1","created_at":"2026-07-05T07:14:37.870814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.11696","created_at":"2026-07-05T07:14:37.870814+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOBBCW3P7NZD","created_at":"2026-07-05T07:14:37.870814+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOBBCW3P7NZDAE44","created_at":"2026-07-05T07:14:37.870814+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOBBCW3P","created_at":"2026-07-05T07:14:37.870814+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00162","citing_title":"FRAME: Learning the Adaptation Domain with a Mixture of Fractional-Fourier Experts","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29184","citing_title":"BaRA: Bayesian Adaptive Rank Allocation for Parameter-Efficient Fine-Tuning","ref_index":26,"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":20,"is_internal_anchor":false},{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07850","citing_title":"MatryoshkaLoRA: Learning Accurate Hierarchical Low-Rank Representations for LLM Fine-Tuning","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01048","citing_title":"Compared to What? Baselines and Metrics for Counterfactual Prompting","ref_index":100,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT","json":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT.json","graph_json":"https://pith.science/api/pith-number/TOBBCW3P7NZDAE447W7Q3GTZPT/graph.json","events_json":"https://pith.science/api/pith-number/TOBBCW3P7NZDAE447W7Q3GTZPT/events.json","paper":"https://pith.science/paper/TOBBCW3P"},"agent_actions":{"view_html":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT","download_json":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT.json","view_paper":"https://pith.science/paper/TOBBCW3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.11696&json=true","fetch_graph":"https://pith.science/api/pith-number/TOBBCW3P7NZDAE447W7Q3GTZPT/graph.json","fetch_events":"https://pith.science/api/pith-number/TOBBCW3P7NZDAE447W7Q3GTZPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT/action/storage_attestation","attest_author":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT/action/author_attestation","sign_citation":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT/action/citation_signature","submit_replication":"https://pith.science/pith/TOBBCW3P7NZDAE447W7Q3GTZPT/action/replication_record"}},"created_at":"2026-07-05T07:14:37.870814+00:00","updated_at":"2026-07-05T07:14:37.870814+00:00"}