{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZDKAUXKPHAGFTXOVBWYNNRTW7L","short_pith_number":"pith:ZDKAUXKP","schema_version":"1.0","canonical_sha256":"c8d40a5d4f380c59ddd50db0d6c676fadc0f3e535d991916e46aeca91b862579","source":{"kind":"arxiv","id":"2505.22608","version":1},"attestation_state":"computed","paper":{"title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","eess.AS"],"primary_cat":"cs.SD","authors_text":"Chengxi Deng, Guinan Li, Haoning Xu, Huimeng Wang, Mengzhe Geng, Xunying Liu, Youjun Chen, Zhaoqing Li","submitted_at":"2025-05-28T17:24:21Z","abstract_excerpt":"This paper presents a novel approach for speech foundation models compression that tightly integrates model pruning and parameter update into a single stage. Highly compact layer-level tied self-pinching gates each containing only a single learnable threshold are jointly trained with uncompressed models and used in fine-grained neuron level pruning. Experiments conducted on the LibriSpeech-100hr corpus suggest that our approach reduces the number of parameters of wav2vec2.0-base and HuBERT-large models by 65% and 60% respectively, while incurring no statistically significant word error rate (W"},"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.22608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2025-05-28T17:24:21Z","cross_cats_sorted":["cs.AI","eess.AS"],"title_canon_sha256":"41175a099105040738ba25cd6085cc7ea862fa983a249d3a57dbe77dc1e7b9a9","abstract_canon_sha256":"4ae734af159d3d0cc34ff26726f234f385fdbac4a3dbb89d21420a13ed049850"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:27.681479Z","signature_b64":"wXEDUgepuenRc93APo7yjJFqwwlDoZUsCXVIuxuflxxRvhnhNXSI6jtJLUrfD8P+/Jlih/Hr179WFGPJGGWPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8d40a5d4f380c59ddd50db0d6c676fadc0f3e535d991916e46aeca91b862579","last_reissued_at":"2026-07-05T11:11:27.680957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:27.680957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","eess.AS"],"primary_cat":"cs.SD","authors_text":"Chengxi Deng, Guinan Li, Haoning Xu, Huimeng Wang, Mengzhe Geng, Xunying Liu, Youjun Chen, Zhaoqing Li","submitted_at":"2025-05-28T17:24:21Z","abstract_excerpt":"This paper presents a novel approach for speech foundation models compression that tightly integrates model pruning and parameter update into a single stage. Highly compact layer-level tied self-pinching gates each containing only a single learnable threshold are jointly trained with uncompressed models and used in fine-grained neuron level pruning. Experiments conducted on the LibriSpeech-100hr corpus suggest that our approach reduces the number of parameters of wav2vec2.0-base and HuBERT-large models by 65% and 60% respectively, while incurring no statistically significant word error rate (W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22608","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.22608/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.22608","created_at":"2026-07-05T11:11:27.681023+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22608v1","created_at":"2026-07-05T11:11:27.681023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22608","created_at":"2026-07-05T11:11:27.681023+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDKAUXKPHAGF","created_at":"2026-07-05T11:11:27.681023+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDKAUXKPHAGFTXOV","created_at":"2026-07-05T11:11:27.681023+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDKAUXKP","created_at":"2026-07-05T11:11:27.681023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22608","citing_title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L","json":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L.json","graph_json":"https://pith.science/api/pith-number/ZDKAUXKPHAGFTXOVBWYNNRTW7L/graph.json","events_json":"https://pith.science/api/pith-number/ZDKAUXKPHAGFTXOVBWYNNRTW7L/events.json","paper":"https://pith.science/paper/ZDKAUXKP"},"agent_actions":{"view_html":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L","download_json":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L.json","view_paper":"https://pith.science/paper/ZDKAUXKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22608&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDKAUXKPHAGFTXOVBWYNNRTW7L/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDKAUXKPHAGFTXOVBWYNNRTW7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L/action/storage_attestation","attest_author":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L/action/author_attestation","sign_citation":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L/action/citation_signature","submit_replication":"https://pith.science/pith/ZDKAUXKPHAGFTXOVBWYNNRTW7L/action/replication_record"}},"created_at":"2026-07-05T11:11:27.681023+00:00","updated_at":"2026-07-05T11:11:27.681023+00:00"}