{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WFEVC5ABPBZ53ASSZSLSTYWYRV","short_pith_number":"pith:WFEVC5AB","schema_version":"1.0","canonical_sha256":"b1495174017873dd8252cc9729e2d88d7401173f7833bbb27add232640a96e3f","source":{"kind":"arxiv","id":"2502.00987","version":2},"attestation_state":"computed","paper":{"title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.CL","authors_text":"Anton van den Hengel, Cristian Rodriguez-Opazo, Ehsan Abbasnejad, Frederic Z. Zhang, Hemanth Saratchandran, Paul Albert","submitted_at":"2025-02-03T01:59:45Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) and its variants have shown impressive results in reducing the number of trainable parameters and memory requirements of large transformer networks while maintaining fine-tuning performance. The low-rank nature of the weight update inherently limits the representation power of fine-tuned models, however, thus potentially compromising performance on complex tasks. This raises a critical question: when a performance gap between LoRA and standard fine-tuning is observed, is it due to the reduced number of trainable parameters or the rank deficiency? This paper aims to 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":"2502.00987","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-03T01:59:45Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"604f07459f879a5926f0731ac6acc6a88ba09b52df7e48f5ef4d2ed0b4f01239","abstract_canon_sha256":"cc16cd44b24013408c10504a52b3c7bfb1e647e8bde5f8b3d419e2103b2c37ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:33.531770Z","signature_b64":"g3HvR5zQDToHqnjp5vqlRio1CezMkee38LdWqdELEA2XdPf0Rbl5m7ypZ+XWkeozMGrARVzWBt3M3JZPlUWUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1495174017873dd8252cc9729e2d88d7401173f7833bbb27add232640a96e3f","last_reissued_at":"2026-07-05T10:29:33.530608Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:33.530608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.CL","authors_text":"Anton van den Hengel, Cristian Rodriguez-Opazo, Ehsan Abbasnejad, Frederic Z. Zhang, Hemanth Saratchandran, Paul Albert","submitted_at":"2025-02-03T01:59:45Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) and its variants have shown impressive results in reducing the number of trainable parameters and memory requirements of large transformer networks while maintaining fine-tuning performance. The low-rank nature of the weight update inherently limits the representation power of fine-tuned models, however, thus potentially compromising performance on complex tasks. This raises a critical question: when a performance gap between LoRA and standard fine-tuning is observed, is it due to the reduced number of trainable parameters or the rank deficiency? This paper aims to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00987","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/2502.00987/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":"2502.00987","created_at":"2026-07-05T10:29:33.530756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.00987v2","created_at":"2026-07-05T10:29:33.530756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00987","created_at":"2026-07-05T10:29:33.530756+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFEVC5ABPBZ5","created_at":"2026-07-05T10:29:33.530756+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFEVC5ABPBZ53ASS","created_at":"2026-07-05T10:29:33.530756+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFEVC5AB","created_at":"2026-07-05T10:29:33.530756+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21935","citing_title":"CoRDE: Concept-Prior Routed Diffusion Experts for Structural Generalization in Robot Manipulation","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29498","citing_title":"Mask the Target: A Plug-and-Play Regularizer Against LoRA Forgetting","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2509.21637","citing_title":"BoHA: Blockwise Hadamard Product Adaptation for Parameter-Efficient Fine-Tuning","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04440","citing_title":"Training Transformers in Cosine Coefficient Space","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV","json":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV.json","graph_json":"https://pith.science/api/pith-number/WFEVC5ABPBZ53ASSZSLSTYWYRV/graph.json","events_json":"https://pith.science/api/pith-number/WFEVC5ABPBZ53ASSZSLSTYWYRV/events.json","paper":"https://pith.science/paper/WFEVC5AB"},"agent_actions":{"view_html":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV","download_json":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV.json","view_paper":"https://pith.science/paper/WFEVC5AB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.00987&json=true","fetch_graph":"https://pith.science/api/pith-number/WFEVC5ABPBZ53ASSZSLSTYWYRV/graph.json","fetch_events":"https://pith.science/api/pith-number/WFEVC5ABPBZ53ASSZSLSTYWYRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV/action/storage_attestation","attest_author":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV/action/author_attestation","sign_citation":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV/action/citation_signature","submit_replication":"https://pith.science/pith/WFEVC5ABPBZ53ASSZSLSTYWYRV/action/replication_record"}},"created_at":"2026-07-05T10:29:33.530756+00:00","updated_at":"2026-07-05T10:29:33.530756+00:00"}