{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2PF36WLILAXGLVQWLAQ2XOS3GL","short_pith_number":"pith:2PF36WLI","schema_version":"1.0","canonical_sha256":"d3cbbf5968582e65d6165821abba5b32c1641b72cf802141f2cd0f23aa061bc0","source":{"kind":"arxiv","id":"2509.25606","version":3},"attestation_state":"computed","paper":{"title":"Effective Model Pruning: Measure The Redundancy of Model Components","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan P. Guralnik, Saiedeh Akbari, Warren E. Dixon, Yixuan Wang","submitted_at":"2025-09-30T00:01:22Z","abstract_excerpt":"This article initiates the study of a basic question about model pruning. Given a vector $s$ of importance scores assigned to model components, how many of the scored components could be discarded without sacrificing performance? We propose Effective Model Pruning (EMP), which derives the desired sparsity directly from the score distribution using the notion of effective sample size from particle filtering, also known as the inverse Simpson index.\n  Rather than prescribe a pruning criterion, EMP supplies a universal adaptive threshold derived from the distribution of the score $s$ over the mod"},"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":"2509.25606","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T00:01:22Z","cross_cats_sorted":[],"title_canon_sha256":"07bc20d1e77b64f5d695f26b7215deb37254da0267ae03875935a4a8db4e350c","abstract_canon_sha256":"8573739445ae199837e27c014f897a2d8bdc59718e7588b390da12f834ea59aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:09.930179Z","signature_b64":"/MLm4WhIBMSyYpHHBE2Jkyckofg89W1fiFTxfc+R2lR2dETykYb0QnA6WEGtmLcztZ73R6rBWjEVbypGFYpBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3cbbf5968582e65d6165821abba5b32c1641b72cf802141f2cd0f23aa061bc0","last_reissued_at":"2026-05-21T01:05:09.928876Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:09.928876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Model Pruning: Measure The Redundancy of Model Components","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan P. Guralnik, Saiedeh Akbari, Warren E. Dixon, Yixuan Wang","submitted_at":"2025-09-30T00:01:22Z","abstract_excerpt":"This article initiates the study of a basic question about model pruning. Given a vector $s$ of importance scores assigned to model components, how many of the scored components could be discarded without sacrificing performance? We propose Effective Model Pruning (EMP), which derives the desired sparsity directly from the score distribution using the notion of effective sample size from particle filtering, also known as the inverse Simpson index.\n  Rather than prescribe a pruning criterion, EMP supplies a universal adaptive threshold derived from the distribution of the score $s$ over the mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.25606","kind":"arxiv","version":3},"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/2509.25606/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":"2509.25606","created_at":"2026-05-21T01:05:09.929026+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.25606v3","created_at":"2026-05-21T01:05:09.929026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.25606","created_at":"2026-05-21T01:05:09.929026+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PF36WLILAXG","created_at":"2026-05-21T01:05:09.929026+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PF36WLILAXGLVQW","created_at":"2026-05-21T01:05:09.929026+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PF36WLI","created_at":"2026-05-21T01:05:09.929026+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2512.09269","citing_title":"Goal inference with Rao-Blackwellized Particle Filters","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06630","citing_title":"Quantifying Trade-Offs Between Stability and Goal-Obfuscation","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL","json":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL.json","graph_json":"https://pith.science/api/pith-number/2PF36WLILAXGLVQWLAQ2XOS3GL/graph.json","events_json":"https://pith.science/api/pith-number/2PF36WLILAXGLVQWLAQ2XOS3GL/events.json","paper":"https://pith.science/paper/2PF36WLI"},"agent_actions":{"view_html":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL","download_json":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL.json","view_paper":"https://pith.science/paper/2PF36WLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.25606&json=true","fetch_graph":"https://pith.science/api/pith-number/2PF36WLILAXGLVQWLAQ2XOS3GL/graph.json","fetch_events":"https://pith.science/api/pith-number/2PF36WLILAXGLVQWLAQ2XOS3GL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL/action/storage_attestation","attest_author":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL/action/author_attestation","sign_citation":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL/action/citation_signature","submit_replication":"https://pith.science/pith/2PF36WLILAXGLVQWLAQ2XOS3GL/action/replication_record"}},"created_at":"2026-05-21T01:05:09.929026+00:00","updated_at":"2026-05-21T01:05:09.929026+00:00"}