{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GKKFWAAVBKIYWQ6QXZTKXZA7R3","short_pith_number":"pith:GKKFWAAV","schema_version":"1.0","canonical_sha256":"32945b00150a918b43d0be66abe41f8ed2a5b40982e7a4b9e580ff9b07ad684b","source":{"kind":"arxiv","id":"2509.04884","version":1},"attestation_state":"computed","paper":{"title":"L1RA: Dynamic Rank Assignment in LoRA Fine-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.CL","authors_text":"Mark James Carman, Nicolo Brunello, Raul Singh, Vincenzo Scotti","submitted_at":"2025-09-05T08:03:01Z","abstract_excerpt":"The ability of Large Language Models (LLMs) to solve complex tasks has made them crucial in the development of AI-based applications. However, the high computational requirements to fine-tune these LLMs on downstream tasks pose significant challenges, particularly when resources are limited. In response to this challenge, we introduce L1RA, a novel technique aimed at dynamically distributing the rank of low-rank adapters during fine-tuning using LoRA. Given a rank budget (i.e., total sum of adapters rank), L1RA leverages L1 regularisation to prune redundant ranks and redistribute them across a"},"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":"2509.04884","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-05T08:03:01Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"aff70c221b411a325a16414c8d8ff4039de67b87d2d1b069b19f8713270de045","abstract_canon_sha256":"02d6f370225c4ce36698fbc51bb29e979ced6edee69e398f87f55ff12a4ff437"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:31.603184Z","signature_b64":"E5H/aUWB7pKSzw0Q/6hT1I2E0MznT+uW5xAeS0FDxAh7MgiK2kllmsPKjfx2lVvVfZhLIWHKYQX/gR9xfd+7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32945b00150a918b43d0be66abe41f8ed2a5b40982e7a4b9e580ff9b07ad684b","last_reissued_at":"2026-07-05T12:05:31.602682Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:31.602682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L1RA: Dynamic Rank Assignment in LoRA Fine-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.CL","authors_text":"Mark James Carman, Nicolo Brunello, Raul Singh, Vincenzo Scotti","submitted_at":"2025-09-05T08:03:01Z","abstract_excerpt":"The ability of Large Language Models (LLMs) to solve complex tasks has made them crucial in the development of AI-based applications. However, the high computational requirements to fine-tune these LLMs on downstream tasks pose significant challenges, particularly when resources are limited. In response to this challenge, we introduce L1RA, a novel technique aimed at dynamically distributing the rank of low-rank adapters during fine-tuning using LoRA. Given a rank budget (i.e., total sum of adapters rank), L1RA leverages L1 regularisation to prune redundant ranks and redistribute them across a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04884","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/2509.04884/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":"2509.04884","created_at":"2026-07-05T12:05:31.602744+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.04884v1","created_at":"2026-07-05T12:05:31.602744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04884","created_at":"2026-07-05T12:05:31.602744+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKKFWAAVBKIY","created_at":"2026-07-05T12:05:31.602744+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKKFWAAVBKIYWQ6Q","created_at":"2026-07-05T12:05:31.602744+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKKFWAAV","created_at":"2026-07-05T12:05:31.602744+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07850","citing_title":"MatryoshkaLoRA: Learning Accurate Hierarchical Low-Rank Representations for LLM Fine-Tuning","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3","json":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3.json","graph_json":"https://pith.science/api/pith-number/GKKFWAAVBKIYWQ6QXZTKXZA7R3/graph.json","events_json":"https://pith.science/api/pith-number/GKKFWAAVBKIYWQ6QXZTKXZA7R3/events.json","paper":"https://pith.science/paper/GKKFWAAV"},"agent_actions":{"view_html":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3","download_json":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3.json","view_paper":"https://pith.science/paper/GKKFWAAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.04884&json=true","fetch_graph":"https://pith.science/api/pith-number/GKKFWAAVBKIYWQ6QXZTKXZA7R3/graph.json","fetch_events":"https://pith.science/api/pith-number/GKKFWAAVBKIYWQ6QXZTKXZA7R3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/action/storage_attestation","attest_author":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/action/author_attestation","sign_citation":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/action/citation_signature","submit_replication":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/action/replication_record"}},"created_at":"2026-07-05T12:05:31.602744+00:00","updated_at":"2026-07-05T12:05:31.602744+00:00"}