{"as_of":"2026-08-08T00:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec2bf26b20de01d7092c5b29342692c07928447f6f4192d6f79caf4cf75bffd6","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:07:47.252902Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:07:42.436192Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T13:07:47.409372Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"cited_work":{"arxiv_id":"2505.22608","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.22608","snapshot_observed_at":"2026-08-07T13:07:47.409372Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","venue":"cs.SD","work_id":"845c2d39-52aa-457a-b416-1b6e1020ddec","year":2025},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.436192Z"},"links":{"cited_paper":"/paper/2505.22608","citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:f271b61bef26636e72f098b688402cc25e3074e781d2b7ab5b3329c88fd5fb69","observation_id":"4c8ef2a8-301f-46f6-bd1e-938fe3666ffc","resolution":{"observed_at":"2026-08-07T13:07:47.487116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.22608/citation-record","integrity":"/paper/2505.22608/integrity","json":"/paper/2505.22608/citation-record.json","paper":"/paper/2505.22608"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:56.164057Z","title":"structured","venue":null,"work_id":"cbd6ea12-2a08-4f31-8114-3c2421f0652d","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.386830Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:4a7b4730082f96e16f0d9f7405353c2a6ff1d6f416660de005dc3d8c543800db","observation_id":"220e7b34-9490-466d-a854-a3c6cf564dc4","resolution":{"observed_at":"2026-08-07T13:07:56.274196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"cited_work":{"arxiv_id":"2505.22608","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.22608","snapshot_observed_at":"2026-08-07T13:07:47.409372Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","venue":"cs.SD","work_id":"845c2d39-52aa-457a-b416-1b6e1020ddec","year":2025},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.436192Z"},"links":{"cited_paper":"/paper/2505.22608","citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:f271b61bef26636e72f098b688402cc25e3074e781d2b7ab5b3329c88fd5fb69","observation_id":"4c8ef2a8-301f-46f6-bd1e-938fe3666ffc","resolution":{"observed_at":"2026-08-07T13:07:47.487116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:55.986927Z","title":"In contrast, previous fine-grained ap- proach [21] performed pruning and fine-tuning separately","venue":null,"work_id":"051ee49d-e380-494a-aff5-6b5e6ee5789b","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.525978Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:35bd9f4678d50c06519dce5dffd197f3f845021ef67b673bfe3cdeb0c8359589","observation_id":"90052f7e-1e21-49b5-9d6e-f9392bc11563","resolution":{"observed_at":"2026-08-07T13:07:56.090123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:55.802476Z","title":null,"venue":null,"work_id":"54866f1d-a89a-4a1d-aafe-57acd5057d5f","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.576107Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:5c19ebb095dec9f8a5f1a43ea8cadb651b7a62fc1e37abb557a550dfb2007f1a","observation_id":"2bc9efce-cb7d-481a-ad6b-6074cb017404","resolution":{"observed_at":"2026-08-07T13:07:55.908943Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:55.629214Z","title":null,"venue":null,"work_id":"19f1e91b-ad4e-465b-ad65-e3609b733385","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.691426Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:ba488ea36c0737a081d233cbce69f792256b1715848b277fd14ab9212efa84d8","observation_id":"5a53e0d1-0890-45b3-85d6-5f866af29204","resolution":{"observed_at":"2026-08-07T13:07:55.706648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:55.453150Z","title":"For example, HuBERT consists of a CNN encoder, a Transformer encoder, a projection layer and a code embedding layer","venue":null,"work_id":"f3acb173-0de9-4e05-a670-d025e21df59f","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.766140Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:f9acdaa3069150192757cc4858c0ee5a128e4a8ec530ac7c14c2f74646e894a9","observation_id":"ec4b7207-93c5-4afb-9bf6-bfa4d91ad4ae","resolution":{"observed_at":"2026-08-07T13:07:55.525413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:55.312754Z","title":null,"venue":null,"work_id":"d55cd14d-fd29-4319-935e-b4b91eb69ba0","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.820949Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:35c4fea968bfcfb172ad6efff3ffcff811db78ea8d2011f3674b474ae1bad6e0","observation_id":"8f8b737c-8665-4b01-b829-5cf37f99aa62","resolution":{"observed_at":"2026-08-07T13:07:55.379435Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:55.151594Z","title":null,"venue":null,"work_id":"ebeeff60-5600-463a-b034-561239ab5471","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.917430Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:e1a9a0dea6fa7dcb5190198b062b36d9ff9f5c267e6c5bf249e23734f750043b","observation_id":"2b85ed7d-6511-4bed-b615-7e30310c8769","resolution":{"observed_at":"2026-08-07T13:07:55.242426Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:55.003535Z","title":"The training loss is given by: L = Lctc + η X l ∥M l ∥0, (7) where η is a constant coefficient to control the overall sparsity","venue":null,"work_id":"dbf4a187-a5f4-482d-ae7a-70bd8ae624a1","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:42.986579Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:c268e7debc0b123f33a30e2b5f12927f393b5b8ffbd40bd2650e540f3334e129","observation_id":"131230ee-6705-4625-8500-92cb4b93422a","resolution":{"observed_at":"2026-08-07T13:07:55.074890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:54.802284Z","title":"(” and “)","venue":null,"work_id":"84910482-3e22-463c-80be-d4adc67b8446","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.085283Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:8fa21e87aeca329a94695951a7aa6dd14f0d46b101681bf562a42dc438227013","observation_id":"9a6798f2-3a40-4725-9f41-2cfb2a34a5c5","resolution":{"observed_at":"2026-08-07T13:07:54.886768Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:54.611764Z","title":"Our method shows superior performance under the same model-size constraint while reduc- ing the fine-tuning time compared to the previous works","venue":null,"work_id":"b054c3a3-ad11-4bef-b944-0a01171f03a2","year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.178567Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:90c1bd7a066240874a830a38cbbd8cdf0cf075130c61fa5a290c52c3a2f9398a","observation_id":"8b2da167-59c3-409b-857f-357ad7487955","resolution":{"observed_at":"2026-08-07T13:07:54.688022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:43.265151Z","title":"14200220, 14200021, 14200324 and Innovation Technology Fund grant No","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.265151Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:ccf8b6feca0363276e2d1a9237275b828cea4d2395ea969cdc9f049e95ce1bf1","observation_id":"ae931572-fc99-48b4-80b8-30cdeafaf3bb","resolution":{"observed_at":"2026-08-07T13:07:43.265151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:54.369236Z","title":"wav2vec 2.0: A frame- work for self-supervised learning of speech representations,","venue":null,"work_id":"1d8632a4-9847-49c0-b3ff-07e1d5fa27a3","year":2020},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.374141Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:e7e7eec72cf24c0a41c5d9774cdc13647576ee1a0197e01c0c56dd95ebd093c3","observation_id":"6c1fc36b-380d-4055-8f52-ccaab9f4e9ee","resolution":{"observed_at":"2026-08-07T13:07:54.489177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:54.187820Z","title":"HuBERT: Self- supervised speech representation learning by masked prediction of hidden units,","venue":null,"work_id":"09e3d3f1-252a-4f51-8ca4-e41f0d1824be","year":2021},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.460511Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:8d9843ec6426127e174ee0de0774163cf35f4b17f20bd5b5080732e28becba1a","observation_id":"2d9f54bd-1719-420a-bbb9-edfb806218f7","resolution":{"observed_at":"2026-08-07T13:07:54.246773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:53.998645Z","title":"WavLM: Large-scale self- supervised pre-training for full stack speech processing,","venue":null,"work_id":"b39ca3be-9441-4f5a-b5cf-4800994dea56","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.569985Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:a9ed086f12cd2c07e77d25b9e0be8fd1df3b4e6dbdc6eae585b90a263cadfb25","observation_id":"4a302ebd-f273-4078-abb1-f65c915dc3f1","resolution":{"observed_at":"2026-08-07T13:07:54.089478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:53.765751Z","title":"2-bit conformer quantization for automatic speech recognition,","venue":null,"work_id":"d04ab01d-76d0-456a-9ca4-7aef2b217a5f","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.670687Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:9b3de5459e4a2f2d74a15c07d9178ac3f24a026a0a6c6e63fa7b3c447e93db38","observation_id":"68474099-6091-4039-a308-028f7dc83bb5","resolution":{"observed_at":"2026-08-07T13:07:53.872627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:53.532710Z","title":"4-bit conformer with na- tive quantization aware training for speech recognition,","venue":null,"work_id":"3e3e14ac-b5ed-4a90-a391-fbaf9ee1fc22","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.755654Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:e0c3b3d4e9cecaabfcf5da79eb96d61f484ca7023bddd1d68a517001c0071224","observation_id":"2d6b3d29-dc99-4693-9e9b-525a6212fe22","resolution":{"observed_at":"2026-08-07T13:07:53.659506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:53.275798Z","title":"I-bert: Integer-only bert quantization,","venue":null,"work_id":"1415433d-d9b4-487e-a264-e62f0b272b1b","year":2021},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.827438Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:9a1fe0e9abddbc07eeecb5f8278edf4e3e5047e1417c5c96fb1b8b26c099b080","observation_id":"19e7bd96-22ab-4617-b639-8da638ab1515","resolution":{"observed_at":"2026-08-07T13:07:53.395361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03643","last_updated":"2025-01-11T06:24:11Z","snapshot_observed_at":"2026-07-06T20:17:33.819458Z","submitted_at":"2025-01-07T09:21:52Z","title":"Effective and Efficient Mixed Precision Quantization of Speech Foundation Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.03643","snapshot_observed_at":"2026-08-07T13:07:43.930104Z","title":"Effective and efficient mixed preci- sion quantization of speech foundation models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.930104Z"},"links":{"cited_paper":"/paper/2501.03643","citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:ff936c37e0d89a75930d3264f9cafdb068af0f8483421e243d4b6f5ab8972fbe","observation_id":"fd737b77-4776-45d5-aadc-8b32298875a9","resolution":{"observed_at":"2026-08-07T13:07:43.930104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:53.028288Z","title":"A model for every user and budget: Label-free and personalized mixed-precision quantiza- tion,","venue":null,"work_id":"ae1a094e-4ad4-4309-ac85-8db575a9ce9d","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.013986Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:979b5840e5b299565e47b61b4329829634196dc70965109d370f191f82505916","observation_id":"d395416c-e69f-4ac1-9220-faa053cf7776","resolution":{"observed_at":"2026-08-07T13:07:53.179626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:52.784949Z","title":"Efficient conformer-based speech recognition with linear attention,","venue":null,"work_id":"c9f8e631-9f17-4a31-b28b-bb3d5eecbccf","year":2021},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.115713Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:50519c059e921550ad520f12900286fa2265eff467f8ae5a603fa010449e67a0","observation_id":"b7c3f0c7-f0ac-4848-9a48-bcdb6d8c54b7","resolution":{"observed_at":"2026-08-07T13:07:52.875857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:52.686777Z","title":"Lossless 4-bit quantization of architecture compressed conformer asr systems on the 300-hr switchboard corpus,","venue":null,"work_id":"74e6e15a-4fb8-4c20-ad55-8c255471ad98","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.196856Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:0921a3c6aab8c4116376dac9f61bb9e3a35f38a14d7916ea836f88bc86c6033a","observation_id":"7c629c2d-ea39-4781-8adf-c5d21003e429","resolution":{"observed_at":"2026-08-07T13:07:52.735004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:52.509987Z","title":"Unstructured pruning and low rank factorisation of self-supervised pre-trained speech models,","venue":null,"work_id":"9bf9ec05-cced-4e7b-ad59-eecfdbefb303","year":2024},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.308242Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:db88569369131b0748104d83a64d91c04640450f10a434f311f5028a2ca85cc4","observation_id":"3635c027-2878-45df-89d9-17e54d45f331","resolution":{"observed_at":"2026-08-07T13:07:52.619325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:52.305699Z","title":"Multi-stage progres- sive compression of conformer transducer for on-device speech recognition,","venue":null,"work_id":"7f2bc53a-6890-4673-9671-a079c563c3c5","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.374250Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:11ad6bb1e29b7e5ffdd523ac99a4aab18b780f75fd563b97fd18fb0c6c9aee4e","observation_id":"4495ae43-81f9-435f-8fac-5fceb99060a2","resolution":{"observed_at":"2026-08-07T13:07:52.418180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:52.130682Z","title":"Conformer-based on-device stream- ing speech recognition with KD compression and two-pass archi- tecture,","venue":null,"work_id":"543656f1-7cc0-47eb-bd90-36ac1740fcb1","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.467162Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:dd11a9b755cf654824c836d7e580fc8542a290e36d5753a3ae92f3a0b4d0ff9c","observation_id":"3f9c0ab4-a4df-44ac-8f78-d885327405fd","resolution":{"observed_at":"2026-08-07T13:07:52.206246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.09278","last_updated":"2023-03-16T12:59:17Z","snapshot_observed_at":"2026-08-04T00:20:40.261026Z","submitted_at":"2023-03-16T12:59:17Z","title":"DistillW2V2: A Small and Streaming Wav2vec 2.0 Based ASR Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.09278","snapshot_observed_at":"2026-08-07T13:07:44.557979Z","title":"DistillW2V2: A small and streaming wav2vec 2.0 based asr model,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.557979Z"},"links":{"cited_paper":"/paper/2303.09278","citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:f624903cb8365a5330d445b4d3be6e32e22668c93cc427aaede8e87519a3aaf9","observation_id":"57f51ee2-a27d-4168-af7c-c55781caa3f9","resolution":{"observed_at":"2026-08-07T13:07:44.557979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:51.900389Z","title":"DistilHuBERT: Speech representation learning by layer-wise distillation of hidden-unit bert,","venue":null,"work_id":"6272ffa8-2e8b-4d96-bc76-3f78926961d1","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.630286Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:9ff9c247f502c51ad7d3e4a0f121d8dfb4af5ab04a91b663fc849ec293515bd9","observation_id":"e4a906b9-d675-4fd8-b654-f02d4d5e66d9","resolution":{"observed_at":"2026-08-07T13:07:52.016317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:51.735273Z","title":"LightHuBERT: Lightweight and configurable speech representation learning with once-for-all hidden-unit bert,","venue":null,"work_id":"1502c852-471f-4160-931b-a26a249d0da8","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.699244Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:5dc09742e4c7e72e099a1946cb195276e476400850f0b287c84d42c1b188fb63","observation_id":"a8e23fd6-3d1e-40d5-9ccd-8a8fbd029f67","resolution":{"observed_at":"2026-08-07T13:07:51.813622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:51.499522Z","title":"Deep versus wide: An analysis of student architectures for task-agnostic knowledge dis- tillation of self-supervised speech models,","venue":null,"work_id":"7bc01952-0ca5-4860-b1c0-345a5696f21d","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.800338Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:41144a4ae7d1f24c645390af02a4ff06139c7b4727f7977b6d3cacc9402e9c2e","observation_id":"07983b3b-b1c8-4ff5-984e-74f2022f849d","resolution":{"observed_at":"2026-08-07T13:07:51.618942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:51.327783Z","title":"FitHuBERT: Going thinner and deeper for knowledge distillation of speech self-supervised learn- ing,","venue":null,"work_id":"0fddd575-918c-40c9-bdcd-edcf9a25e9d4","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.861937Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:f2be64e10df80262b922ba33ab3c6b272335f91f83806486bc13882d519ab528","observation_id":"a3896745-de06-4fa4-984f-8f1a2bb1eae6","resolution":{"observed_at":"2026-08-07T13:07:51.388201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:51.141617Z","title":"Dynamic sparsity neural net- works for automatic speech recognition,","venue":null,"work_id":"ecac31c1-83ca-47ea-a9e0-e160a103b9d4","year":2021},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.946994Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:b7cc3d1de4e3b96e45709baf6622c5eff2e525305547d4573f5f503fc6681235","observation_id":"436b4a62-1f55-4b27-a73e-d7343e6e3487","resolution":{"observed_at":"2026-08-07T13:07:51.207154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:50.838934Z","title":"Layer pruning on demand with intermediate ctc,","venue":null,"work_id":"c5836655-cecb-4abb-a64a-56c34aca21cc","year":2021},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.037977Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:53fca04669c1722a14fff3535eebb576deac8d3d7cb94f727033d850cddcd198","observation_id":"fda58d33-294c-4e94-bb6e-9f6e1601861f","resolution":{"observed_at":"2026-08-07T13:07:51.023211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:50.703319Z","title":"Sparsewav: Fast and accurate one- shot unstructured pruning for large speech foundation models,","venue":null,"work_id":"4d63f12e-d56d-4c61-b4d6-dbe2e528270b","year":2024},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.134016Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:8f69d5f9a37abfac35da7508fca72819e9178a55281ce27152086e0381d7e63b","observation_id":"44fa1aa1-a747-4645-8313-6c1086722d9c","resolution":{"observed_at":"2026-08-07T13:07:50.779492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:50.596638Z","title":"Task-agnostic structured pruning of speech representation models,","venue":null,"work_id":"1b22daa6-9f45-4a98-8c3a-5c5df38196da","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.231180Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:e2a8982baaaca4e8c51e55666f31a3f638917298b39c83b8b3e6c4757a66f403","observation_id":"c12b43bb-7af1-4fdc-a9c4-337d3690e5f9","resolution":{"observed_at":"2026-08-07T13:07:50.644894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:50.471692Z","title":"Accurate and structured prun- ing for efficient automatic speech recognition,","venue":null,"work_id":"953d35db-0fa1-456e-9029-65a3621ebdfe","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.289923Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:478eb1030fdccd7900c11e700314be77b315abb721deed16bf51caab4fa6b334","observation_id":"a5464502-6262-40f0-a7e8-081e62e28647","resolution":{"observed_at":"2026-08-07T13:07:50.505619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:50.352845Z","title":"PADA: Pruning assisted domain adaptation for self-supervised speech representations,","venue":null,"work_id":"a0dc5c05-6f22-4fe5-a286-e3f07d90bea0","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.395284Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:ac19ac1394b8aded9ff928987bfdadb67471a6dc8f117fbf2183c3610d535c37","observation_id":"d80de02e-022e-4856-8874-ece3dc39f595","resolution":{"observed_at":"2026-08-07T13:07:50.418610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:50.254125Z","title":"Structured pruning of self- supervised pre-trained models for speech recognition and under- standing,","venue":null,"work_id":"07acda96-4d64-4c47-8efc-f9491631c598","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.493189Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:6bfa3be26e35240ef3cbb82ac1ef9eb29cfc688bde34042385a21e23f2f1a0c1","observation_id":"726515f2-f2dc-467d-8113-6a40a72c321f","resolution":{"observed_at":"2026-08-07T13:07:50.292961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:50.092528Z","title":"One-pass multiple conformer and foundation speech systems compression and quantization using an all-in-one neural model,","venue":null,"work_id":"7df0a954-b09c-4761-85cb-d80c6ea0af7d","year":2024},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.573230Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:a2080f2c92f1c23f36ffe2802102aaeb91cc8702d6f0cb769deb8cbf154be38b","observation_id":"5c3e081d-30d8-4611-b313-d3fb067f7fde","resolution":{"observed_at":"2026-08-07T13:07:50.194985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:49.941063Z","title":"Deep compres- sion of pre-trained transformer models,","venue":null,"work_id":"c65d0e81-7e16-490f-bf99-503248a60eef","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.645129Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:8eb8f4a795bb0119ee5e1b42ffa03a8a9e35b0da6d91286f6b3cf3a64e65d66b","observation_id":"aabd67fa-7cf3-498e-be55-0c77628b1634","resolution":{"observed_at":"2026-08-07T13:07:50.024685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:49.795833Z","title":"USM-Lite: Quantization and sparsity aware fine-tuning for speech recognition with universal speech models,","venue":null,"work_id":"b5376ffa-7b23-4615-98ce-8d59d24222cb","year":2024},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.746673Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:872642456f9117f16cbbd98c9f57d18cb613d260deea73653f23d46b4fd70a9d","observation_id":"799ec405-81e1-4709-a4a8-b41222e58107","resolution":{"observed_at":"2026-08-07T13:07:49.887440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:49.628538Z","title":"DPHuBERT: Joint dis- tillation and pruning of self-supervised speech models,","venue":null,"work_id":"d6e1762b-0798-4901-b319-ad793da1162e","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.870900Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:cc11fa408a730c315bb4ccf2c95f15b177ea7aed17e7c6b1b62d22b5ea72e398","observation_id":"ee849262-73fa-42e6-a42f-86fd34607ffa","resolution":{"observed_at":"2026-08-07T13:07:49.718337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:49.442953Z","title":"Skill: Similarity- aware knowledge distillation for speech self-supervised learning,","venue":null,"work_id":"1551438a-e989-416f-ad1e-5e23a50e7e96","year":2024},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.009237Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:80604f5faf8476c88910ed977f80c8a24178a1c9f76de76b8eda291d685f2556","observation_id":"ec6f616c-5af9-46e0-b51f-44ec33e4e860","resolution":{"observed_at":"2026-08-07T13:07:49.538003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:49.258517Z","title":"Some statistical issues in the comparison of speech recognition algorithms,","venue":null,"work_id":"514095d9-2cb8-4472-b80a-4882c7298da8","year":1989},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.109801Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:07f71535c452a5a09a1050f2edbf9a4ad3ad2364c896a9e10d72a228d61d3ec7","observation_id":"1950e51b-e240-4c81-95fc-9342a96e1e8d","resolution":{"observed_at":"2026-08-07T13:07:49.355489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:49.136919Z","title":"Parp: Prune, adjust and re- prune for self-supervised speech recognition,","venue":null,"work_id":"af8d295b-eeae-49a2-949d-f95b8f49aec7","year":2021},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.205096Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:90ccd17b11b1d1d49459104f00609c18e8567f3ec41ef993bffd8b0d58ca64f5","observation_id":"73f309c5-6a13-4841-8b7a-f0eca1a23dab","resolution":{"observed_at":"2026-08-07T13:07:49.210449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:49.011103Z","title":"Learning asr pathways: A sparse multilingual asr model,","venue":null,"work_id":"a08d10cc-56f4-4d02-88c5-2ec063b7efa8","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.344001Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:e7fa7290442552ce0c376c391d4ce815a176738fc221c462fd9e4c563f01691a","observation_id":"a3e4a70c-a3df-4c71-ae68-32ed0316a147","resolution":{"observed_at":"2026-08-07T13:07:49.075383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:48.871448Z","title":"Learnable sparsity structured pruning for acoustic pre-trained models,","venue":null,"work_id":"d74257c4-0caf-41b3-90ee-17aca788c1fc","year":2023},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.413479Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:82698907457f269fdcca7625041fc24105d0d7b8b4b491853eebd1c37959d9bb","observation_id":"7614c5de-c66c-484f-8806-0ada0f472378","resolution":{"observed_at":"2026-08-07T13:07:48.942490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:48.737544Z","title":"Losses can be blessings: Routing self-supervised speech representations towards efficient multilin- gual and multitask speech processing,","venue":null,"work_id":"0c102d97-000a-4826-9adf-f2aba8d2ca89","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.547944Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:a7fee83d2a51c82efbfb8d93cc81f51569a25a1794391728ac40640620e6ebd4","observation_id":"db2da0c5-c291-4292-a238-e1e121694e0f","resolution":{"observed_at":"2026-08-07T13:07:48.798261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:48.559271Z","title":"Darts: Differentiable archi- tecture search,","venue":null,"work_id":"cf366744-a65a-4c82-bb86-c0d83fce0eef","year":2018},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.648046Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:eed63c83fcbdd5b4518f64aed0b4c4608c4799281fdf83a2603b4c0132070517","observation_id":"b6ae83e2-a4b6-4338-b44c-bb201a8b40e4","resolution":{"observed_at":"2026-08-07T13:07:48.683077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:48.263412Z","title":"The concrete distri- bution: A continuous relaxation of discrete random variables,","venue":null,"work_id":"1bf8b8fb-7d66-496d-a828-8a873c8cc298","year":2022},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.751890Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:3d7504cf44f76c9c162ffd6a20e80584deb6580abb40f0c1fca71bb4a91019ee","observation_id":"5279adb7-d191-46b9-9f5f-a7c7435b4b89","resolution":{"observed_at":"2026-08-07T13:07:48.389237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1308.3432","last_updated":"2013-08-15T15:19:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-08-15T15:19:34Z","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.3432","snapshot_observed_at":"2026-08-07T13:07:46.881176Z","title":"Estimating or propa- gating gradients through stochastic neurons for conditional com- putation,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.881176Z"},"links":{"cited_paper":"/paper/1308.3432","citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:edb11c9725d04112a95b5eba4084933b5e4077dcab3d72bd5953829ee4761eed","observation_id":"100f789c-f437-4ce4-989e-f6295119c85b","resolution":{"observed_at":"2026-08-07T13:07:46.881176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:48.026212Z","title":"LibriSpeech: an asr cor- pus based on public domain audio books,","venue":null,"work_id":"a92ba152-c705-410e-8139-3bb6a7ad0f94","year":2015},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:46.982942Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:70e01ba7b64a799cb0bd8ac1daa8cea5a6e35c332c59b2268f10025650ff4c70","observation_id":"cb341084-5a82-40b2-a925-89159b24f8bf","resolution":{"observed_at":"2026-08-07T13:07:48.172041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:47.814494Z","title":"Superb: Speech pro- cessing universal performance benchmark,","venue":null,"work_id":"ec66215d-310c-443b-91eb-b97ff78de06b","year":2021},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:47.129096Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:cf4b76cbd62759cb0a15a7831345dac3f319a56808dc85e682cea6fc0b0fc72f","observation_id":"d21190ff-b2dd-42cd-863c-0ae87033d2d3","resolution":{"observed_at":"2026-08-07T13:07:47.898512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:47.614811Z","title":"Distilling HuBERT with LSTMs via decoupled knowledge distillation,","venue":null,"work_id":"6d956b61-6f07-4e2b-954a-0950a800e72d","year":2024},"citing_paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:47.252902Z"},"links":{"citing_paper":"/paper/2505.22608"},"observation_digest":"sha256:4130ba0c1169d3e2a19f8f9510453156c63aaee0d9f587a8c893bb450f074451","observation_id":"a5b21bcf-35e8-4e00-9456-8acc187a9b46","resolution":{"observed_at":"2026-08-07T13:07:47.722547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.22608","last_updated":"2025-05-28T17:24:21Z","latest_version":1,"primary_category":"cs.SD","snapshot_observed_at":"2026-08-07T13:00:55.732432Z","submitted_at":"2025-05-28T17:24:21Z","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":43},"total_outbound_references":53},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2505.22608."}