{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4YOHUO3NOSE243ZMRGQF7MP52J","short_pith_number":"pith:4YOHUO3N","schema_version":"1.0","canonical_sha256":"e61c7a3b6d7489ae6f2c89a05fb1fdd276f8b26001849d99d76c84256a4acaf2","source":{"kind":"arxiv","id":"2405.15179","version":3},"attestation_state":"computed","paper":{"title":"VB-LoRA: Extreme Parameter Efficient Fine-Tuning with Vector Banks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Shaobo Han, Shihao Ji, Yang Li","submitted_at":"2024-05-24T03:24:34Z","abstract_excerpt":"As the adoption of large language models increases and the need for per-user or per-task model customization grows, the parameter-efficient fine-tuning (PEFT) methods, such as low-rank adaptation (LoRA) and its variants, incur substantial storage and transmission costs. To further reduce stored parameters, we introduce a \"divide-and-share\" paradigm that breaks the barriers of low-rank decomposition across matrix dimensions, modules, and layers by sharing parameters globally via a vector bank. As an instantiation of the paradigm to LoRA, our proposed VB-LoRA composites all the low-rank matrices"},"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":"2405.15179","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-24T03:24:34Z","cross_cats_sorted":[],"title_canon_sha256":"4db9b5c747ba42b10edf8347eea15d5844fb1056e73de4e8c5af77247567e82c","abstract_canon_sha256":"a62a4aafc6e8e416cb93ce182f6f707f48836fd66551bdb15c459ac0045bc1ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:22.156203Z","signature_b64":"DvXsZVofeCKT45vNPoLBLjByJHSyGm4C75uMelhMMNvAOvqDuHQVxrsCWkDE48s2GdN4Lh/SF9KoJJCi0cylAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e61c7a3b6d7489ae6f2c89a05fb1fdd276f8b26001849d99d76c84256a4acaf2","last_reissued_at":"2026-07-05T09:27:22.155761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:22.155761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VB-LoRA: Extreme Parameter Efficient Fine-Tuning with Vector Banks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Shaobo Han, Shihao Ji, Yang Li","submitted_at":"2024-05-24T03:24:34Z","abstract_excerpt":"As the adoption of large language models increases and the need for per-user or per-task model customization grows, the parameter-efficient fine-tuning (PEFT) methods, such as low-rank adaptation (LoRA) and its variants, incur substantial storage and transmission costs. To further reduce stored parameters, we introduce a \"divide-and-share\" paradigm that breaks the barriers of low-rank decomposition across matrix dimensions, modules, and layers by sharing parameters globally via a vector bank. As an instantiation of the paradigm to LoRA, our proposed VB-LoRA composites all the low-rank matrices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.15179","kind":"arxiv","version":3},"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/2405.15179/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":"2405.15179","created_at":"2026-07-05T09:27:22.155816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.15179v3","created_at":"2026-07-05T09:27:22.155816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.15179","created_at":"2026-07-05T09:27:22.155816+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YOHUO3NOSE2","created_at":"2026-07-05T09:27:22.155816+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YOHUO3NOSE243ZM","created_at":"2026-07-05T09:27:22.155816+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YOHUO3N","created_at":"2026-07-05T09:27:22.155816+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18124","citing_title":"TLoRA: Task-aware Low Rank Adaptation of Large Language Models","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J","json":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J.json","graph_json":"https://pith.science/api/pith-number/4YOHUO3NOSE243ZMRGQF7MP52J/graph.json","events_json":"https://pith.science/api/pith-number/4YOHUO3NOSE243ZMRGQF7MP52J/events.json","paper":"https://pith.science/paper/4YOHUO3N"},"agent_actions":{"view_html":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J","download_json":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J.json","view_paper":"https://pith.science/paper/4YOHUO3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.15179&json=true","fetch_graph":"https://pith.science/api/pith-number/4YOHUO3NOSE243ZMRGQF7MP52J/graph.json","fetch_events":"https://pith.science/api/pith-number/4YOHUO3NOSE243ZMRGQF7MP52J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J/action/storage_attestation","attest_author":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J/action/author_attestation","sign_citation":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J/action/citation_signature","submit_replication":"https://pith.science/pith/4YOHUO3NOSE243ZMRGQF7MP52J/action/replication_record"}},"created_at":"2026-07-05T09:27:22.155816+00:00","updated_at":"2026-07-05T09:27:22.155816+00:00"}