{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LJUL5RUZSZOYKRHPGPL3GCZPED","short_pith_number":"pith:LJUL5RUZ","schema_version":"1.0","canonical_sha256":"5a68bec699965d8544ef33d7b30b2f20d5656875d66ebbfbe2d65d2b55f6bb7b","source":{"kind":"arxiv","id":"2305.19549","version":1},"attestation_state":"computed","paper":{"title":"Accurate and Structured Pruning for Efficient Automatic Speech Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Huiqiang Jiang, Jinyu Li, Lili Qiu, Li Lyna Zhang, Mao Yang, Shijie Cao, Ting Cao, Yuang Li, Yuqing Yang, Yu Wu","submitted_at":"2023-05-31T04:31:16Z","abstract_excerpt":"Automatic Speech Recognition (ASR) has seen remarkable advancements with deep neural networks, such as Transformer and Conformer. However, these models typically have large model sizes and high inference costs, posing a challenge to deploy on resource-limited devices. In this paper, we propose a novel compression strategy that leverages structured pruning and knowledge distillation to reduce the model size and inference cost of the Conformer model while preserving high recognition performance. Our approach utilizes a set of binary masks to indicate whether to retain or prune each Conformer 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":"2305.19549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-31T04:31:16Z","cross_cats_sorted":[],"title_canon_sha256":"5ed077eefbd03cb0c2a8f7e74e3532b5f00cc2198b935da8370fcbb90a7eaf41","abstract_canon_sha256":"fc0a12b786e4ae1ea960b583fbdfa0c36742e57e7be7f7be511ef690fa2eb164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:15:51.740336Z","signature_b64":"8ekbC4xQnMmWC/S2GzGonxMR53wD+npF5ehkwDVcrM6AN/kYqMoONsDXlzFjAzGjs4xeuzVWuPcb+kFw9ukGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a68bec699965d8544ef33d7b30b2f20d5656875d66ebbfbe2d65d2b55f6bb7b","last_reissued_at":"2026-07-05T06:15:51.739814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:15:51.739814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accurate and Structured Pruning for Efficient Automatic Speech Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Huiqiang Jiang, Jinyu Li, Lili Qiu, Li Lyna Zhang, Mao Yang, Shijie Cao, Ting Cao, Yuang Li, Yuqing Yang, Yu Wu","submitted_at":"2023-05-31T04:31:16Z","abstract_excerpt":"Automatic Speech Recognition (ASR) has seen remarkable advancements with deep neural networks, such as Transformer and Conformer. However, these models typically have large model sizes and high inference costs, posing a challenge to deploy on resource-limited devices. In this paper, we propose a novel compression strategy that leverages structured pruning and knowledge distillation to reduce the model size and inference cost of the Conformer model while preserving high recognition performance. Our approach utilizes a set of binary masks to indicate whether to retain or prune each Conformer mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.19549","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/2305.19549/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":"2305.19549","created_at":"2026-07-05T06:15:51.739874+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.19549v1","created_at":"2026-07-05T06:15:51.739874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.19549","created_at":"2026-07-05T06:15:51.739874+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJUL5RUZSZOY","created_at":"2026-07-05T06:15:51.739874+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJUL5RUZSZOYKRHP","created_at":"2026-07-05T06:15:51.739874+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJUL5RUZ","created_at":"2026-07-05T06:15:51.739874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01135","citing_title":"Spiking and Event-driven Neuromorphic Mamba Models for Efficient Speech Recognition","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED","json":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED.json","graph_json":"https://pith.science/api/pith-number/LJUL5RUZSZOYKRHPGPL3GCZPED/graph.json","events_json":"https://pith.science/api/pith-number/LJUL5RUZSZOYKRHPGPL3GCZPED/events.json","paper":"https://pith.science/paper/LJUL5RUZ"},"agent_actions":{"view_html":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED","download_json":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED.json","view_paper":"https://pith.science/paper/LJUL5RUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.19549&json=true","fetch_graph":"https://pith.science/api/pith-number/LJUL5RUZSZOYKRHPGPL3GCZPED/graph.json","fetch_events":"https://pith.science/api/pith-number/LJUL5RUZSZOYKRHPGPL3GCZPED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED/action/storage_attestation","attest_author":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED/action/author_attestation","sign_citation":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED/action/citation_signature","submit_replication":"https://pith.science/pith/LJUL5RUZSZOYKRHPGPL3GCZPED/action/replication_record"}},"created_at":"2026-07-05T06:15:51.739874+00:00","updated_at":"2026-07-05T06:15:51.739874+00:00"}