{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HDIRBNKBQGMO6PPIKQ7OBY4X2F","short_pith_number":"pith:HDIRBNKB","schema_version":"1.0","canonical_sha256":"38d110b5418198ef3de8543ee0e397d145acf5238034b1cc8181b1b7c2d9c1aa","source":{"kind":"arxiv","id":"2310.18356","version":2},"attestation_state":"computed","paper":{"title":"LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Badal Yadav, Ilya Zharkov, Luming Liang, Tianyi Chen, Tianyu Ding","submitted_at":"2023-10-24T00:47:26Z","abstract_excerpt":"Large Language Models (LLMs) have transformed the landscape of artificial intelligence, while their enormous size presents significant challenges in terms of computational costs. We introduce LoRAShear, a novel efficient approach to structurally prune LLMs and recover knowledge. Given general LLMs, LoRAShear at first creates the dependency graphs over LoRA modules to discover minimally removal structures and analyze the knowledge distribution. It then proceeds progressive structured pruning on LoRA adaptors and enables inherent knowledge transfer to better preserve the information in the redun"},"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":"2310.18356","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-24T00:47:26Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"80361ddb0cd5eac3dad51c054fab48b511b1bf501265af6e5eb9341384f51e09","abstract_canon_sha256":"05ff4d88db4ec9e6a4773d52c0345166e3018b55ba54574e743f336ebea4b279"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:07:18.775340Z","signature_b64":"aMWNQ+ZYIkQe/HWNMXB6+EVc+2F0bPzuGCTHZNmblgSlUCizfkwPBpKudZ8G3jiykVskvCGs97u6T1T1amwVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38d110b5418198ef3de8543ee0e397d145acf5238034b1cc8181b1b7c2d9c1aa","last_reissued_at":"2026-07-05T07:07:18.774840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:07:18.774840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Badal Yadav, Ilya Zharkov, Luming Liang, Tianyi Chen, Tianyu Ding","submitted_at":"2023-10-24T00:47:26Z","abstract_excerpt":"Large Language Models (LLMs) have transformed the landscape of artificial intelligence, while their enormous size presents significant challenges in terms of computational costs. We introduce LoRAShear, a novel efficient approach to structurally prune LLMs and recover knowledge. Given general LLMs, LoRAShear at first creates the dependency graphs over LoRA modules to discover minimally removal structures and analyze the knowledge distribution. It then proceeds progressive structured pruning on LoRA adaptors and enables inherent knowledge transfer to better preserve the information in the redun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18356","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/2310.18356/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":"2310.18356","created_at":"2026-07-05T07:07:18.774902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.18356v2","created_at":"2026-07-05T07:07:18.774902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18356","created_at":"2026-07-05T07:07:18.774902+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDIRBNKBQGMO","created_at":"2026-07-05T07:07:18.774902+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDIRBNKBQGMO6PPI","created_at":"2026-07-05T07:07:18.774902+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDIRBNKB","created_at":"2026-07-05T07:07:18.774902+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26538","citing_title":"CascadeFormer: Depth-Tapered Transformers Motivated by Gradient Fan-in Asymmetry","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2505.17138","citing_title":"RAP: Runtime Adaptive Pruning for LLM Inference","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2506.12876","citing_title":"MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMs","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2404.14294","citing_title":"A Survey on Efficient Inference for Large Language Models","ref_index":178,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F","json":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F.json","graph_json":"https://pith.science/api/pith-number/HDIRBNKBQGMO6PPIKQ7OBY4X2F/graph.json","events_json":"https://pith.science/api/pith-number/HDIRBNKBQGMO6PPIKQ7OBY4X2F/events.json","paper":"https://pith.science/paper/HDIRBNKB"},"agent_actions":{"view_html":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F","download_json":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F.json","view_paper":"https://pith.science/paper/HDIRBNKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.18356&json=true","fetch_graph":"https://pith.science/api/pith-number/HDIRBNKBQGMO6PPIKQ7OBY4X2F/graph.json","fetch_events":"https://pith.science/api/pith-number/HDIRBNKBQGMO6PPIKQ7OBY4X2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F/action/storage_attestation","attest_author":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F/action/author_attestation","sign_citation":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F/action/citation_signature","submit_replication":"https://pith.science/pith/HDIRBNKBQGMO6PPIKQ7OBY4X2F/action/replication_record"}},"created_at":"2026-07-05T07:07:18.774902+00:00","updated_at":"2026-07-05T07:07:18.774902+00:00"}