{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:33XDFVVVY75B7BOFCHBXAIR2AY","short_pith_number":"pith:33XDFVVV","schema_version":"1.0","canonical_sha256":"deee32d6b5c7fa1f85c511c370223a0606bac59a39dd832ac9d950d99e8d5d8e","source":{"kind":"arxiv","id":"2403.16187","version":2},"attestation_state":"computed","paper":{"title":"ALoRA: Allocating Low-Rank Adaptation for Fine-tuning Large Language Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jiawen Lyn, Wei Zhu, Xing Tian, Yvette Graham, Zequan Liu","submitted_at":"2024-03-24T15:09:55Z","abstract_excerpt":"Parameter-efficient fine-tuning (PEFT) is widely studied for its effectiveness and efficiency in the era of large language models. Low-rank adaptation (LoRA) has demonstrated commendable performance as a popular and representative method. However, it is implemented with a fixed intrinsic rank that might not be the ideal setting for the downstream tasks. Recognizing the need for more flexible downstream task adaptation, we extend the methodology of LoRA to an innovative approach we call allocating low-rank adaptation (ALoRA) that enables dynamic adjustments to the intrinsic rank during the adap"},"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":"2403.16187","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2024-03-24T15:09:55Z","cross_cats_sorted":[],"title_canon_sha256":"3d5c87a83c5665692d88237518aac2e0220f9983815108677261155bc983bc70","abstract_canon_sha256":"2bd14d393ebd61fb0edf8033ad8133147fd05a72909d1f402acf2ec043a41f51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:02.788877Z","signature_b64":"M9/HWPaPBRLUXRevfOqOZCkfPBQvBoY2KWKIHT2GKkQLCH1RwdSLmzqCdCnzcWrZCIv+3F/TWU3I3dWOJWIeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deee32d6b5c7fa1f85c511c370223a0606bac59a39dd832ac9d950d99e8d5d8e","last_reissued_at":"2026-07-05T08:08:02.788414Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:02.788414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ALoRA: Allocating Low-Rank Adaptation for Fine-tuning Large Language Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jiawen Lyn, Wei Zhu, Xing Tian, Yvette Graham, Zequan Liu","submitted_at":"2024-03-24T15:09:55Z","abstract_excerpt":"Parameter-efficient fine-tuning (PEFT) is widely studied for its effectiveness and efficiency in the era of large language models. Low-rank adaptation (LoRA) has demonstrated commendable performance as a popular and representative method. However, it is implemented with a fixed intrinsic rank that might not be the ideal setting for the downstream tasks. Recognizing the need for more flexible downstream task adaptation, we extend the methodology of LoRA to an innovative approach we call allocating low-rank adaptation (ALoRA) that enables dynamic adjustments to the intrinsic rank during the adap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.16187","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/2403.16187/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":"2403.16187","created_at":"2026-07-05T08:08:02.788471+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.16187v2","created_at":"2026-07-05T08:08:02.788471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.16187","created_at":"2026-07-05T08:08:02.788471+00:00"},{"alias_kind":"pith_short_12","alias_value":"33XDFVVVY75B","created_at":"2026-07-05T08:08:02.788471+00:00"},{"alias_kind":"pith_short_16","alias_value":"33XDFVVVY75B7BOF","created_at":"2026-07-05T08:08:02.788471+00:00"},{"alias_kind":"pith_short_8","alias_value":"33XDFVVV","created_at":"2026-07-05T08:08:02.788471+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.21035","citing_title":"Little by Little: Continual Learning via Incremental Mixture of Rank-1 Associative Memory Experts","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY","json":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY.json","graph_json":"https://pith.science/api/pith-number/33XDFVVVY75B7BOFCHBXAIR2AY/graph.json","events_json":"https://pith.science/api/pith-number/33XDFVVVY75B7BOFCHBXAIR2AY/events.json","paper":"https://pith.science/paper/33XDFVVV"},"agent_actions":{"view_html":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY","download_json":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY.json","view_paper":"https://pith.science/paper/33XDFVVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.16187&json=true","fetch_graph":"https://pith.science/api/pith-number/33XDFVVVY75B7BOFCHBXAIR2AY/graph.json","fetch_events":"https://pith.science/api/pith-number/33XDFVVVY75B7BOFCHBXAIR2AY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY/action/storage_attestation","attest_author":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY/action/author_attestation","sign_citation":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY/action/citation_signature","submit_replication":"https://pith.science/pith/33XDFVVVY75B7BOFCHBXAIR2AY/action/replication_record"}},"created_at":"2026-07-05T08:08:02.788471+00:00","updated_at":"2026-07-05T08:08:02.788471+00:00"}