{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FVOBYXU4STV7UZCZEIZEOQ4OZH","short_pith_number":"pith:FVOBYXU4","schema_version":"1.0","canonical_sha256":"2d5c1c5e9c94ebfa6459223247438ec9f181291ca469c1aaa31fbe48477d7fe3","source":{"kind":"arxiv","id":"2403.11887","version":1},"attestation_state":"computed","paper":{"title":"SuperLoRA: Parameter-Efficient Unified Adaptation of Multi-Layer Attention Modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Guanghui Wang, Jing Liu, Matthew Brand, Pu Perry Wang, Toshiaki Koike-Akino, Xiangyu Chen, Ye Wang","submitted_at":"2024-03-18T15:40:36Z","abstract_excerpt":"Low-rank adaptation (LoRA) and its variants are widely employed in fine-tuning large models, including large language models for natural language processing and diffusion models for computer vision. This paper proposes a generalized framework called SuperLoRA that unifies and extends different LoRA variants, which can be realized under different hyper-parameter settings. Introducing grouping, folding, shuffling, projecting, and tensor factoring, SuperLoRA offers high flexibility compared with other LoRA variants and demonstrates superior performance for transfer learning tasks especially in th"},"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.11887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-03-18T15:40:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dd3179d5b6154742fe925360aba349e0a1bbf084f45f16864fe75e2844c7e08f","abstract_canon_sha256":"f4675458027d9585ef9adbbcd0c6020ca4a0a255439c8d2e6d4c9e999a0d96fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:33.285920Z","signature_b64":"sOm7+vxEXsJrrlA2lZUfRNpRtOANr9dimOrgQI17S0DyKbkeNuQztgkSjsYuaywhVcRqQVUfnIamgyCy+Z+MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d5c1c5e9c94ebfa6459223247438ec9f181291ca469c1aaa31fbe48477d7fe3","last_reissued_at":"2026-07-05T07:57:33.285434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:33.285434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SuperLoRA: Parameter-Efficient Unified Adaptation of Multi-Layer Attention Modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Guanghui Wang, Jing Liu, Matthew Brand, Pu Perry Wang, Toshiaki Koike-Akino, Xiangyu Chen, Ye Wang","submitted_at":"2024-03-18T15:40:36Z","abstract_excerpt":"Low-rank adaptation (LoRA) and its variants are widely employed in fine-tuning large models, including large language models for natural language processing and diffusion models for computer vision. This paper proposes a generalized framework called SuperLoRA that unifies and extends different LoRA variants, which can be realized under different hyper-parameter settings. Introducing grouping, folding, shuffling, projecting, and tensor factoring, SuperLoRA offers high flexibility compared with other LoRA variants and demonstrates superior performance for transfer learning tasks especially in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11887","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/2403.11887/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.11887","created_at":"2026-07-05T07:57:33.285491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.11887v1","created_at":"2026-07-05T07:57:33.285491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11887","created_at":"2026-07-05T07:57:33.285491+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVOBYXU4STV7","created_at":"2026-07-05T07:57:33.285491+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVOBYXU4STV7UZCZ","created_at":"2026-07-05T07:57:33.285491+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVOBYXU4","created_at":"2026-07-05T07:57:33.285491+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01947","citing_title":"Parameter-Efficient Fine-Tuning of Large Pretrained Models for Instance Segmentation Tasks","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH","json":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH.json","graph_json":"https://pith.science/api/pith-number/FVOBYXU4STV7UZCZEIZEOQ4OZH/graph.json","events_json":"https://pith.science/api/pith-number/FVOBYXU4STV7UZCZEIZEOQ4OZH/events.json","paper":"https://pith.science/paper/FVOBYXU4"},"agent_actions":{"view_html":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH","download_json":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH.json","view_paper":"https://pith.science/paper/FVOBYXU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.11887&json=true","fetch_graph":"https://pith.science/api/pith-number/FVOBYXU4STV7UZCZEIZEOQ4OZH/graph.json","fetch_events":"https://pith.science/api/pith-number/FVOBYXU4STV7UZCZEIZEOQ4OZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH/action/storage_attestation","attest_author":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH/action/author_attestation","sign_citation":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH/action/citation_signature","submit_replication":"https://pith.science/pith/FVOBYXU4STV7UZCZEIZEOQ4OZH/action/replication_record"}},"created_at":"2026-07-05T07:57:33.285491+00:00","updated_at":"2026-07-05T07:57:33.285491+00:00"}