{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6SOXBQCWATYEH4SOKZBRL6MGAI","short_pith_number":"pith:6SOXBQCW","schema_version":"1.0","canonical_sha256":"f49d70c05604f043f24e564315f986021f16b75933c1e7d02be5fd23eb5fbbf1","source":{"kind":"arxiv","id":"2505.22689","version":1},"attestation_state":"computed","paper":{"title":"SlimLLM: Accurate Structured Pruning for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jialong Guo, Xinghao Chen, Yehui Tang, Yunhe Wang","submitted_at":"2025-05-28T03:01:28Z","abstract_excerpt":"Large language models(LLMs) have garnered significant attention and demonstrated impressive capabilities in a wide range of applications. However, due to their enormous computational costs, the deployment and application of LLMs are often severely limited. To address this issue, structured pruning is an effective solution to compress the parameters of LLMs. Determining the importance of each sub-module in LLMs and minimizing performance loss are critical issues that need to be carefully addressed in structured pruning. In this paper, we propose an effective and fast structured pruning method n"},"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":"2505.22689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-28T03:01:28Z","cross_cats_sorted":[],"title_canon_sha256":"c9abdf07e7e7a1a497f7c6417f34281b01e8734f04b894a8942927f35c9209df","abstract_canon_sha256":"c89717e23bc50f78bcc107db786180387648c00ecc296b770c0a675292336657"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:48.624124Z","signature_b64":"1xauM6nJ01hkttSCldQb+nmkpCAbZj+U6SQoAVTrVDRbRssDK71xCxhERpxBBgr9hg2cjKWpkaQDQXcy4YhnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f49d70c05604f043f24e564315f986021f16b75933c1e7d02be5fd23eb5fbbf1","last_reissued_at":"2026-07-05T11:11:48.623625Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:48.623625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SlimLLM: Accurate Structured Pruning for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jialong Guo, Xinghao Chen, Yehui Tang, Yunhe Wang","submitted_at":"2025-05-28T03:01:28Z","abstract_excerpt":"Large language models(LLMs) have garnered significant attention and demonstrated impressive capabilities in a wide range of applications. However, due to their enormous computational costs, the deployment and application of LLMs are often severely limited. To address this issue, structured pruning is an effective solution to compress the parameters of LLMs. Determining the importance of each sub-module in LLMs and minimizing performance loss are critical issues that need to be carefully addressed in structured pruning. In this paper, we propose an effective and fast structured pruning method n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22689","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/2505.22689/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":"2505.22689","created_at":"2026-07-05T11:11:48.623685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22689v1","created_at":"2026-07-05T11:11:48.623685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22689","created_at":"2026-07-05T11:11:48.623685+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SOXBQCWATYE","created_at":"2026-07-05T11:11:48.623685+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SOXBQCWATYEH4SO","created_at":"2026-07-05T11:11:48.623685+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SOXBQCW","created_at":"2026-07-05T11:11:48.623685+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08568","citing_title":"Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compression","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI","json":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI.json","graph_json":"https://pith.science/api/pith-number/6SOXBQCWATYEH4SOKZBRL6MGAI/graph.json","events_json":"https://pith.science/api/pith-number/6SOXBQCWATYEH4SOKZBRL6MGAI/events.json","paper":"https://pith.science/paper/6SOXBQCW"},"agent_actions":{"view_html":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI","download_json":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI.json","view_paper":"https://pith.science/paper/6SOXBQCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22689&json=true","fetch_graph":"https://pith.science/api/pith-number/6SOXBQCWATYEH4SOKZBRL6MGAI/graph.json","fetch_events":"https://pith.science/api/pith-number/6SOXBQCWATYEH4SOKZBRL6MGAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI/action/storage_attestation","attest_author":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI/action/author_attestation","sign_citation":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI/action/citation_signature","submit_replication":"https://pith.science/pith/6SOXBQCWATYEH4SOKZBRL6MGAI/action/replication_record"}},"created_at":"2026-07-05T11:11:48.623685+00:00","updated_at":"2026-07-05T11:11:48.623685+00:00"}