{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NDQO6UZB2YRD4AMS5M5JC7SMVP","short_pith_number":"pith:NDQO6UZB","schema_version":"1.0","canonical_sha256":"68e0ef5321d6223e0192eb3a917e4cabf4ea72a422b52f0d30ba9b65abc268a8","source":{"kind":"arxiv","id":"2402.07721","version":2},"attestation_state":"computed","paper":{"title":"LoRA-drop: Efficient LoRA Parameter Pruning based on Output Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Conghui Zhu, Hongyun Zhou, Muyun Yang, Tiejun Zhao, Wang Xu, Xiangyu Lu","submitted_at":"2024-02-12T15:34:56Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) is currently the most commonly used Parameter-efficient fine-tuning (PEFT) method, it introduces auxiliary parameters for each layer to fine-tune the pre-trained model under limited computing resources. However, it still faces resource consumption challenges during training when scaling up to larger models. Most previous studies have tackled this issue by using pruning techniques, which involve removing LoRA parameters deemed unimportant. Nonetheless, these efforts only analyze LoRA parameter features to evaluate their importance, such as parameter count, size, and g"},"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":"2402.07721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T15:34:56Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"4a08ebc35cb39d7ce0cf4b128953f286ae2e3c3acd78e8c7ccde8f0aa84b8f6f","abstract_canon_sha256":"fd70a8f66b7e35802bb447420db6009257caa4671101ee8ce8eac2961597ac54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:35.573907Z","signature_b64":"L9KL9pWbFX4znsQ4+HBaSHlmlFonLCWnqUrG/sVrlR2f/VfIlF+17JtyEKoTwQFfS1xazkbIxeB7DQJCM9ZFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e0ef5321d6223e0192eb3a917e4cabf4ea72a422b52f0d30ba9b65abc268a8","last_reissued_at":"2026-07-05T08:33:35.573420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:35.573420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRA-drop: Efficient LoRA Parameter Pruning based on Output Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Conghui Zhu, Hongyun Zhou, Muyun Yang, Tiejun Zhao, Wang Xu, Xiangyu Lu","submitted_at":"2024-02-12T15:34:56Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) is currently the most commonly used Parameter-efficient fine-tuning (PEFT) method, it introduces auxiliary parameters for each layer to fine-tune the pre-trained model under limited computing resources. However, it still faces resource consumption challenges during training when scaling up to larger models. Most previous studies have tackled this issue by using pruning techniques, which involve removing LoRA parameters deemed unimportant. Nonetheless, these efforts only analyze LoRA parameter features to evaluate their importance, such as parameter count, size, and g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07721","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/2402.07721/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":"2402.07721","created_at":"2026-07-05T08:33:35.573477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07721v2","created_at":"2026-07-05T08:33:35.573477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07721","created_at":"2026-07-05T08:33:35.573477+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDQO6UZB2YRD","created_at":"2026-07-05T08:33:35.573477+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDQO6UZB2YRD4AMS","created_at":"2026-07-05T08:33:35.573477+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDQO6UZB","created_at":"2026-07-05T08:33:35.573477+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29317","citing_title":"FoRA: Fisher-orthogonal Rank Adaptation for Parameter-Efficient Fine-Tuning","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2511.11051","citing_title":"NP-LoRA: Null Space Projection for Subject-Style LoRA Fusion","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2507.00029","citing_title":"LoRA-Mixer: Coordinate Modular LoRA Experts Through Serial Attention Routing","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP","json":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP.json","graph_json":"https://pith.science/api/pith-number/NDQO6UZB2YRD4AMS5M5JC7SMVP/graph.json","events_json":"https://pith.science/api/pith-number/NDQO6UZB2YRD4AMS5M5JC7SMVP/events.json","paper":"https://pith.science/paper/NDQO6UZB"},"agent_actions":{"view_html":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP","download_json":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP.json","view_paper":"https://pith.science/paper/NDQO6UZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07721&json=true","fetch_graph":"https://pith.science/api/pith-number/NDQO6UZB2YRD4AMS5M5JC7SMVP/graph.json","fetch_events":"https://pith.science/api/pith-number/NDQO6UZB2YRD4AMS5M5JC7SMVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP/action/storage_attestation","attest_author":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP/action/author_attestation","sign_citation":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP/action/citation_signature","submit_replication":"https://pith.science/pith/NDQO6UZB2YRD4AMS5M5JC7SMVP/action/replication_record"}},"created_at":"2026-07-05T08:33:35.573477+00:00","updated_at":"2026-07-05T08:33:35.573477+00:00"}