{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P57DIAT7JOKEVPABWCJPXMX3SM","short_pith_number":"pith:P57DIAT7","schema_version":"1.0","canonical_sha256":"7f7e34027f4b944abc01b092fbb2fb9338f02fe7d65262358fab895effa456eb","source":{"kind":"arxiv","id":"2508.02381","version":2},"attestation_state":"computed","paper":{"title":"Beyond Manually Designed Pruning Policies with Second-Level Performance Prediction: A Pruning Framework for LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Yongbin Qin, Yunhe Cui, Zuxin Ma","submitted_at":"2025-08-04T13:08:35Z","abstract_excerpt":"Non-uniform structured network pruning methods can effectively reduce Large Language Model (LLM) size by eliminating redundant channels or layers, offering lower performance degradation than uniform strategies. However, existing non-uniform methods rely heavily on manually designed pruning policies (e.g., layer importance and scaling factors), and therefore cannot efficiently adapt to scenarios with dynamic pruning ratio requirements. Additionly, a critical bottleneck -- the time-consuming evaluation of pruning policies -- further limits the feasibility of iteratively and dynamically finding o"},"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":"2508.02381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-04T13:08:35Z","cross_cats_sorted":[],"title_canon_sha256":"34e2b204c65c779361646d1cecd16aeb5ee3d40e2908c650cd4407465f8cf089","abstract_canon_sha256":"96e80ef7001d04d59b3c6dd4963b6fa16327654f517c0eb6cbc33a19f6fda9cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:12.534879Z","signature_b64":"yZIi+xFf/D8zWVYxyg2ZDA5PJfGPpXiTLqiD7tZhpFgnMx2Et27rnp2h7W2a9H20ZI20grzD35o17BNWTT5kDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f7e34027f4b944abc01b092fbb2fb9338f02fe7d65262358fab895effa456eb","last_reissued_at":"2026-07-05T11:49:12.534359Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:12.534359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Manually Designed Pruning Policies with Second-Level Performance Prediction: A Pruning Framework for LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Yongbin Qin, Yunhe Cui, Zuxin Ma","submitted_at":"2025-08-04T13:08:35Z","abstract_excerpt":"Non-uniform structured network pruning methods can effectively reduce Large Language Model (LLM) size by eliminating redundant channels or layers, offering lower performance degradation than uniform strategies. However, existing non-uniform methods rely heavily on manually designed pruning policies (e.g., layer importance and scaling factors), and therefore cannot efficiently adapt to scenarios with dynamic pruning ratio requirements. Additionly, a critical bottleneck -- the time-consuming evaluation of pruning policies -- further limits the feasibility of iteratively and dynamically finding o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02381","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/2508.02381/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":"2508.02381","created_at":"2026-07-05T11:49:12.534420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.02381v2","created_at":"2026-07-05T11:49:12.534420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02381","created_at":"2026-07-05T11:49:12.534420+00:00"},{"alias_kind":"pith_short_12","alias_value":"P57DIAT7JOKE","created_at":"2026-07-05T11:49:12.534420+00:00"},{"alias_kind":"pith_short_16","alias_value":"P57DIAT7JOKEVPAB","created_at":"2026-07-05T11:49:12.534420+00:00"},{"alias_kind":"pith_short_8","alias_value":"P57DIAT7","created_at":"2026-07-05T11:49:12.534420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM","json":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM.json","graph_json":"https://pith.science/api/pith-number/P57DIAT7JOKEVPABWCJPXMX3SM/graph.json","events_json":"https://pith.science/api/pith-number/P57DIAT7JOKEVPABWCJPXMX3SM/events.json","paper":"https://pith.science/paper/P57DIAT7"},"agent_actions":{"view_html":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM","download_json":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM.json","view_paper":"https://pith.science/paper/P57DIAT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.02381&json=true","fetch_graph":"https://pith.science/api/pith-number/P57DIAT7JOKEVPABWCJPXMX3SM/graph.json","fetch_events":"https://pith.science/api/pith-number/P57DIAT7JOKEVPABWCJPXMX3SM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM/action/storage_attestation","attest_author":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM/action/author_attestation","sign_citation":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM/action/citation_signature","submit_replication":"https://pith.science/pith/P57DIAT7JOKEVPABWCJPXMX3SM/action/replication_record"}},"created_at":"2026-07-05T11:49:12.534420+00:00","updated_at":"2026-07-05T11:49:12.534420+00:00"}