{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J4L6NJX376ALXBVAQLYLJHDKZO","short_pith_number":"pith:J4L6NJX3","schema_version":"1.0","canonical_sha256":"4f17e6a6fbff80bb86a082f0b49c6acbb3e8c3f9710698c6a8017305a1b5957c","source":{"kind":"arxiv","id":"2403.00812","version":2},"attestation_state":"computed","paper":{"title":"LoRA Meets Dropout under a Unified Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Boyang Xue, Chuan Wu, Jiyue Jiang, Liheng Chen, Lingpeng Kong, Sheng Wang","submitted_at":"2024-02-25T07:09:10Z","abstract_excerpt":"With the remarkable capabilities, large language models (LLMs) have emerged as essential elements in numerous NLP applications, while parameter-efficient finetuning, especially LoRA, has gained popularity as a lightweight approach for model customization. Meanwhile, various dropout methods, initially designed for full finetuning with all the parameters updated, alleviates overfitting associated with excessive parameter redundancy. Hence, a possible contradiction arises from negligible trainable parameters of LoRA and the effectiveness of previous dropout methods, which has been largely overloo"},"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.00812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-02-25T07:09:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a0f84e7cdd528abfdc730ecfe12dc7286ca767157fc9549a2dc89a24fd9720b4","abstract_canon_sha256":"0fe3f85a4e06ef076cbdba606a37aaa6a2401e21b062ed210f364335d4d610e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:19.227095Z","signature_b64":"nRvztlP6hN/j0R/OAMsJKNTkBiiwWkyu/rCTN6OH/4sN9lfcN+YsiJzK35bMm/i8JN75Ncfn/tA33D5hDiG4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f17e6a6fbff80bb86a082f0b49c6acbb3e8c3f9710698c6a8017305a1b5957c","last_reissued_at":"2026-07-05T08:23:19.226620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:19.226620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRA Meets Dropout under a Unified Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Boyang Xue, Chuan Wu, Jiyue Jiang, Liheng Chen, Lingpeng Kong, Sheng Wang","submitted_at":"2024-02-25T07:09:10Z","abstract_excerpt":"With the remarkable capabilities, large language models (LLMs) have emerged as essential elements in numerous NLP applications, while parameter-efficient finetuning, especially LoRA, has gained popularity as a lightweight approach for model customization. Meanwhile, various dropout methods, initially designed for full finetuning with all the parameters updated, alleviates overfitting associated with excessive parameter redundancy. Hence, a possible contradiction arises from negligible trainable parameters of LoRA and the effectiveness of previous dropout methods, which has been largely overloo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00812","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.00812/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.00812","created_at":"2026-07-05T08:23:19.226674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.00812v2","created_at":"2026-07-05T08:23:19.226674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00812","created_at":"2026-07-05T08:23:19.226674+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4L6NJX376AL","created_at":"2026-07-05T08:23:19.226674+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4L6NJX376ALXBVA","created_at":"2026-07-05T08:23:19.226674+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4L6NJX3","created_at":"2026-07-05T08:23:19.226674+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03934","citing_title":"SelfAug: Mitigating Catastrophic Forgetting in Retrieval-Augmented Generation via Distribution Self-Alignment","ref_index":74,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO","json":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO.json","graph_json":"https://pith.science/api/pith-number/J4L6NJX376ALXBVAQLYLJHDKZO/graph.json","events_json":"https://pith.science/api/pith-number/J4L6NJX376ALXBVAQLYLJHDKZO/events.json","paper":"https://pith.science/paper/J4L6NJX3"},"agent_actions":{"view_html":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO","download_json":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO.json","view_paper":"https://pith.science/paper/J4L6NJX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.00812&json=true","fetch_graph":"https://pith.science/api/pith-number/J4L6NJX376ALXBVAQLYLJHDKZO/graph.json","fetch_events":"https://pith.science/api/pith-number/J4L6NJX376ALXBVAQLYLJHDKZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO/action/storage_attestation","attest_author":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO/action/author_attestation","sign_citation":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO/action/citation_signature","submit_replication":"https://pith.science/pith/J4L6NJX376ALXBVAQLYLJHDKZO/action/replication_record"}},"created_at":"2026-07-05T08:23:19.226674+00:00","updated_at":"2026-07-05T08:23:19.226674+00:00"}