{"as_of":"2026-08-17T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:27c46daa30ac5444444597c941fc85c9e8e0fca07df072277e0dd1ffe5290712","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T19:36:44.204156Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-04T19:36:43.599370Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.09196","snapshot_observed_at":"2026-08-04T19:36:43.599370Z","title":"Bulan” and A) the biased words are “Bulan","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.599370Z"},"links":{"cited_paper":"/paper/2509.09196","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:7028be1e66e77a8eec8a2ddd7620de396243490dd6baa3ce24588951fcbbc3c5","observation_id":"53d94c87-9338-45d9-9422-83350b02bd0d","resolution":{"observed_at":"2026-08-04T19:36:43.599370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.09196/citation-record","integrity":"/paper/2509.09196/integrity","json":"/paper/2509.09196/citation-record.json","paper":"/paper/2509.09196"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.09196","snapshot_observed_at":"2026-08-04T19:36:43.599370Z","title":"Bulan” and A) the biased words are “Bulan","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.599370Z"},"links":{"cited_paper":"/paper/2509.09196","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:7028be1e66e77a8eec8a2ddd7620de396243490dd6baa3ce24588951fcbbc3c5","observation_id":"53d94c87-9338-45d9-9422-83350b02bd0d","resolution":{"observed_at":"2026-08-04T19:36:43.599370Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:43.663531Z","title":"Bulan” and the biased words are “Bulan","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.663531Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:be07fb2bb0082421192c3a1d47f9492017df0240ef9eb9d95d194b4cf0dee309","observation_id":"765a53b0-c5d1-4792-8138-09af2374a2df","resolution":{"observed_at":"2026-08-04T19:36:43.663531Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:43.733656Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.733656Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:940072ad6b96fa9d2af9dbb2484ce909a438fd52695410d75c2f5b0c486ecb73","observation_id":"37b5ce3c-8c14-488c-b993-5ed51c99d50f","resolution":{"observed_at":"2026-08-04T19:36:43.733656Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:43.828090Z","title":"Initially, the model performs poorly on NSC-Part-2, with a WER of 30.85%","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.828090Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:ac0d2fd4578324cab33982e4c0251f83e4879fd34ade8185b7fb2a97ef16b347","observation_id":"e54c7734-dbd9-45eb-9d43-77442e56e6c0","resolution":{"observed_at":"2026-08-04T19:36:43.828090Z","resolver_source":null,"status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:43.897914Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.897914Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:74bf86c2a82a5226e2c44eeb0ada81a66ae9157c4c17762aaf2899cc7bb5486f","observation_id":"e56e8d82-d3a2-4f58-8815-b6c52b55cd58","resolution":{"observed_at":"2026-08-04T19:36:43.897914Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:43.967498Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.967498Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:a77d22fb5e2ea979861ee81150c411d822d0d65300d06c7b7fc413fb727b3e6a","observation_id":"ec375f83-513a-4a15-9e23-7695b0843f33","resolution":{"observed_at":"2026-08-04T19:36:43.967498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02649","last_updated":"2024-06-04T14:20:38Z","snapshot_observed_at":"2026-08-16T13:46:15.969532Z","submitted_at":"2024-06-04T14:20:38Z","title":"Keyword-Guided Adaptation of Automatic Speech Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02649","snapshot_observed_at":"2026-08-04T19:36:44.094420Z","title":"Keyword-guided adaptation of automatic speech recognition,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.094420Z"},"links":{"cited_paper":"/paper/2406.02649","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:27fa345cbe13b1d341109ae2b84038b3ca49624a2fd2e2f598b597f8451f6c90","observation_id":"95f32946-d901-4336-9e0c-67d85e59a0cd","resolution":{"observed_at":"2026-08-04T19:36:44.094420Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:43.983814Z","title":"Using synthetic audio to improve the recognition of out-of-vocabulary words in end-to-end asr systems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.983814Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:f666ce2176de596641ae0ed65a4ae61ca4a3a6f364f2c8f0935e78ffc74cfe84","observation_id":"eb0b7d09-f8b4-4041-a4cd-564780218259","resolution":{"observed_at":"2026-08-04T19:36:43.983814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.15685","last_updated":"2023-06-23T08:59:50Z","snapshot_observed_at":"2026-08-16T15:21:44.085931Z","submitted_at":"2023-06-23T08:59:50Z","title":"Implementing contextual biasing in GPU decoder for online ASR","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.15685","snapshot_observed_at":"2026-08-04T19:36:44.055869Z","title":"Imple- menting contextual biasing in gpu decoder for online asr,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.055869Z"},"links":{"cited_paper":"/paper/2306.15685","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:eee779b9bbc59372ac74836cd8399a39922313a7875604a42cdb74a474817411","observation_id":"66162f35-db9e-445b-ba28-ebc3cf477e7c","resolution":{"observed_at":"2026-08-04T19:36:44.055869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00804","last_updated":"2023-08-15T04:36:14Z","snapshot_observed_at":"2026-08-16T15:27:27.286737Z","submitted_at":"2023-06-01T15:33:30Z","title":"Adaptive Contextual Biasing for Transducer Based Streaming Speech Recognition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00804","snapshot_observed_at":"2026-08-04T19:36:44.074388Z","title":"Adaptive contextual biasing for transducer based streaming speech recognition,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.074388Z"},"links":{"cited_paper":"/paper/2306.00804","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:40388302680018dc852dcbc1eefcd15dde2fae57b0950ca1b6528c64f586874b","observation_id":"1984eac2-48d3-4256-afc2-3ea44f87b1bb","resolution":{"observed_at":"2026-08-04T19:36:44.074388Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.079197Z","title":"Selective Biasing with Trie- based Contextual Adapters for Personalised Speech Recognition using Neural Transducers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.079197Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:1de02939cc3cdc992b54197754d57e7e929be82d52f1668487b872c2c7d5d208","observation_id":"fc759b96-a297-4095-b958-274adda97bb9","resolution":{"observed_at":"2026-08-04T19:36:44.079197Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.083559Z","title":"Contextual adapters for personalized speech recognition in neural transducers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.083559Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:fe47b0fbed6d8100014055cc8b1d2963c0933b3c610117b2652b5494d633a225","observation_id":"520234a3-27df-4352-8a82-3f9d2cd26efb","resolution":{"observed_at":"2026-08-04T19:36:44.083559Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.089682Z","title":"Effective Training of Attention-based Contextual Biasing Adapters with Synthetic Audio for Personalised ASR,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.089682Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:1d47ad21c860e226f6f41479e6e40b8d1a5c242bba56d8741213bb04bd7075b0","observation_id":"7bc57431-2dc0-4c23-ac0a-9ee110640119","resolution":{"observed_at":"2026-08-04T19:36:44.089682Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.126046Z","title":"Can contextual biasing remain effective with whisper and gpt-2?","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.126046Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:3d7344d0a1fcc6cbb4dcdc87f97c6cb353ee5b17aeadfb3765f8ab02df54c76f","observation_id":"70a60c78-503c-4960-ae63-4568d1e89dc3","resolution":{"observed_at":"2026-08-04T19:36:44.126046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.07394","last_updated":"2020-05-15T07:47:33Z","snapshot_observed_at":"2026-07-06T09:20:31.791558Z","submitted_at":"2020-05-15T07:47:33Z","title":"Contextualizing ASR Lattice Rescoring with Hybrid Pointer Network Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.07394","snapshot_observed_at":"2026-08-04T19:36:44.099273Z","title":"Contextualizing asr lattice rescoring with hybrid pointer network language model,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.099273Z"},"links":{"cited_paper":"/paper/2005.07394","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:be8383a33ca2e6056c1f1bf4dc71628ccbaa7ce493a89220daee0f9941e5517a","observation_id":"b4e0d0a6-b563-40f7-b8f6-d43bbf698d62","resolution":{"observed_at":"2026-08-04T19:36:44.099273Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.103993Z","title":"Can Contex- tual Biasing Remain Effective with Whisper and GPT-2?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.103993Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:d3e9b494473b638c81680a63e79c7c0da5f3271a23d7e324bbd99a4bbf7ac65c","observation_id":"25b7910d-07ee-473b-836e-54896795305e","resolution":{"observed_at":"2026-08-04T19:36:44.103993Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.108384Z","title":"Phoneme-aware encoding for prefix-tree-based contextual asr,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.108384Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:39d9037c1ee0b234e3e29748e75ae0cf5363f1f33eb13595ebc873e27a11cff0","observation_id":"38287022-8874-45da-8736-3dce8b404109","resolution":{"observed_at":"2026-08-04T19:36:44.108384Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.112818Z","title":"G2g: Tts-driven pronunciation learning for graphemic hybrid asr,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.112818Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:72c514d84251425ce9c2ceeac6a5469e0f4d99f98e92ef1c65f00ff814d19ef5","observation_id":"127694aa-0e9b-4bc7-81ac-01deea5ef11c","resolution":{"observed_at":"2026-08-04T19:36:44.112818Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.117133Z","title":"Deep shallow fusion for rnn-t personalization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.117133Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:c769dcf2cb2a17a32b1c4b7c9900d00f6f5096afa416d2191384abd6d51cde4a","observation_id":"d9d15640-b739-4b30-b665-b5f3d469d7b1","resolution":{"observed_at":"2026-08-04T19:36:44.117133Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.121549Z","title":"Contextual biasing speech recognition in speech-enhanced large language model,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.121549Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:829a42b2824d8a3f367ec30ac0125f3df0fb4d84d44c4ea5fecf4937ce2d6102","observation_id":"c84cb015-6f73-404c-9a38-1ceebf3e2b55","resolution":{"observed_at":"2026-08-04T19:36:44.121549Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.159486Z","title":"Robust speech recognition via large-scale weak supervision,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.159486Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:2af2fb4a1c90e22ebde7b7aac6340354e3a67e72995ff955899296e0969b97bd","observation_id":"1270113a-4494-4dd0-ac63-b6570d5bc688","resolution":{"observed_at":"2026-08-04T19:36:44.159486Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.163508Z","title":"Improved alignment for score combination of rnn-t and ctc decoder for online decod- ing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.163508Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:0119b00fe5581719d0d757197dfc64a503d87ba9c1079d71061570a74221dcc7","observation_id":"4e223d6f-94ba-4c38-b102-18a520c0a1a6","resolution":{"observed_at":"2026-08-04T19:36:44.163508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03645","last_updated":"2024-09-27T05:27:45Z","snapshot_observed_at":"2026-08-16T13:37:10.672781Z","submitted_at":"2024-07-04T05:35:47Z","title":"Continual Learning Optimizations for Auto-regressive Decoder of Multilingual ASR systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03645","snapshot_observed_at":"2026-08-04T19:36:44.134376Z","title":"Continual learning op- timizations for auto-regressive decoder of multilingual asr sys- tems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.134376Z"},"links":{"cited_paper":"/paper/2407.03645","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:6c7e465aa157417f0b5ee89072128fefe314c859881819c93af2b152b8cc69c9","observation_id":"e51ee820-12a7-4078-8d82-fcf7201ec7f2","resolution":{"observed_at":"2026-08-04T19:36:44.134376Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.138879Z","title":"Continual learning with embedding layer surgery and task- wise beam search using whisper,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.138879Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:8165bf91a896233d9f9f86be335a61da1d02619d12d8415bda0273a65e5c1aac","observation_id":"6062dc86-4307-4a7d-af2f-ba40e78c92b6","resolution":{"observed_at":"2026-08-04T19:36:44.138879Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.142990Z","title":"Shallow-fusion end-to-end contextual biasing,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.142990Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:85384cf89d530e489f5961516875b851d07a52ac53b9509c7303bea0c2290455","observation_id":"8f8b341f-f160-4608-982d-668f316da529","resolution":{"observed_at":"2026-08-04T19:36:44.142990Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.147012Z","title":"Deep context: End-to-end contextual speech recognition,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.147012Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:cf2f0f1aaa1358096b07fcef336d432b1b849cac8812109eed83c67dbe573eb3","observation_id":"e09667b7-6517-4639-a5ae-bf4e10115268","resolution":{"observed_at":"2026-08-04T19:36:44.147012Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.150994Z","title":"Look-ahead techniques for fast beam search,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.150994Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:ceba9499a225e9981ac7049365fbb89ab0c3dcc655a49dc6f5c5339a02e98bbf","observation_id":"6a1e157a-24e5-444c-9337-419d5a7ab3ab","resolution":{"observed_at":"2026-08-04T19:36:44.150994Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.155045Z","title":"A new verification- based fast match approach to large vocabulary speech recogni- tion,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.155045Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:eb4163f97282228850d5a5417c85f115b63043ba2f3c46adc00e178a298eae42","observation_id":"51545148-1925-45f8-8826-d179a2267d02","resolution":{"observed_at":"2026-08-04T19:36:44.155045Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:43.804264Z","title":"We adapt whisper-small and whisper-large-v2 with vanilla fine-tuning (FT) for 2 epochs and set the train batch size to 6","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:43.804264Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:b2becf23f8b2500570421a79d30a925963152f81c0271b3c44833831da4b718e","observation_id":"93704ba2-2e11-41be-ab34-2ae6abcf0c68","resolution":{"observed_at":"2026-08-04T19:36:43.804264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-04T19:36:44.195663Z","title":"Decoupled weight decay regulariza- tion,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.195663Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:fcac5994f4f405044205b75b9dc805af81003026878e1591982fdf5eabed90ac","observation_id":"ac823fd6-fe20-4349-bc9e-467ce98d92dd","resolution":{"observed_at":"2026-08-04T19:36:44.195663Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.167505Z","title":"Building the singapore english national speech corpus,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.167505Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:61c5f99beaeb360ee747be7d945f8ab5f99d7a5230839c39199c6aac14e14886","observation_id":"c3279779-708d-48ad-87f5-50105c965c5c","resolution":{"observed_at":"2026-08-04T19:36:44.167505Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.171598Z","title":"Asr model adaptation for rare words using synthetic data generated by multiple text- to-speech systems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.171598Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:6c841b3b17a78cbec21fa1548f2169dfab856019f9de03991f3234a29eb70ec2","observation_id":"eb3e5526-76b9-4a9b-8e09-49d3ee27c891","resolution":{"observed_at":"2026-08-04T19:36:44.171598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.02882","last_updated":"2019-04-05T06:05:00Z","snapshot_observed_at":"2026-08-15T16:44:02.859541Z","submitted_at":"2019-04-05T06:05:00Z","title":"LibriTTS: A Corpus Derived from LibriSpeech for Text-to-Speech","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.02882","snapshot_observed_at":"2026-08-04T19:36:44.175636Z","title":"Libritts: A corpus derived from librispeech for text- to-speech,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.175636Z"},"links":{"cited_paper":"/paper/1904.02882","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:9ec516bbdfb7cbe0cccdf47efecc5dadcc359cfab469696c4a23d1c87ed91243","observation_id":"e75988c1-a366-42f2-91cb-e188186e3c97","resolution":{"observed_at":"2026-08-04T19:36:44.175636Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.179613Z","title":"Conditional variational autoencoder with adversarial learning for end-to-end text-to-speech,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.179613Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:1933f4abb9655ab7adadc3f73e1aec3d99027386e1eabf9106c316b8dea3fcab","observation_id":"85b2b2eb-4989-42bb-b6cb-db5e4c3224d3","resolution":{"observed_at":"2026-08-04T19:36:44.179613Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.183557Z","title":"Cstr vctk corpus: English multi-speaker corpus for cstr voice cloning toolkit (version 0.92),","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.183557Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:650515c0d87d707db727722f42afafac558fe79f2b6fb1c2fe06c972bc0961f8","observation_id":"b021883d-8cda-4174-a706-02d983b012c3","resolution":{"observed_at":"2026-08-04T19:36:44.183557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02194","last_updated":"2021-06-11T23:10:43Z","snapshot_observed_at":"2026-08-16T18:33:43.825556Z","submitted_at":"2021-04-05T23:59:43Z","title":"Contextualized Streaming End-to-End Speech Recognition with Trie-Based Deep Biasing and Shallow Fusion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.02194","snapshot_observed_at":"2026-08-04T19:36:44.187427Z","title":"Contextual- ized streaming end-to-end speech recognition with trie-based deep biasing and shallow fusion,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.187427Z"},"links":{"cited_paper":"/paper/2104.02194","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:9e589fdaf537eeb45c059e09cd92c083729fcc40262b66d57798938b40f17560","observation_id":"08ae75f8-6b1e-40fe-abe4-d84df44cc033","resolution":{"observed_at":"2026-08-04T19:36:44.187427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04624","last_updated":"2021-06-08T18:22:56Z","snapshot_observed_at":"2026-08-16T23:10:15.763755Z","submitted_at":"2021-06-08T18:22:56Z","title":"SpeechBrain: A General-Purpose Speech Toolkit","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.04624","snapshot_observed_at":"2026-08-04T19:36:44.191622Z","title":"Speechbrain: A general-purpose speech toolkit,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.191622Z"},"links":{"cited_paper":"/paper/2106.04624","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:b2d591f73e45ed7bc1c0c122e45d73d5fe74cc5f944d169ea8fed09cfaa6ce81","observation_id":"8ba76ccf-b79e-42c4-a5ee-9e40c665cd94","resolution":{"observed_at":"2026-08-04T19:36:44.191622Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.199880Z","title":"Low resource language adaptation using two-stage regularization for multilingual asr,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.199880Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:8adedd7d6a09ca25b50aef2dace0ea6df8aaefad8462a12508ac39a720461e87","observation_id":"971270f4-258e-4f52-8ed3-7a2b7d2da48b","resolution":{"observed_at":"2026-08-04T19:36:44.199880Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:36:44.204156Z","title":"Extending whisper for emotion prediction using word-level pseudo labels,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.204156Z"},"links":{"citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:326bd96f0a1b0abed3128124c1dc6c330bc3d29a9afa3c499d11d135e457d63f","observation_id":"7170f7cb-0627-4e36-893b-3654c5078482","resolution":{"observed_at":"2026-08-04T19:36:44.204156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.01942","last_updated":"2023-06-02T22:56:01Z","snapshot_observed_at":"2026-08-17T02:25:22.347231Z","submitted_at":"2023-06-02T22:56:01Z","title":"Can Contextual Biasing Remain Effective with Whisper and GPT-2?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.01942","snapshot_observed_at":"2026-08-04T19:36:44.130176Z","title":"Available: https://arxiv.org/abs/2306.01942","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T19:36:44.130176Z"},"links":{"cited_paper":"/paper/2306.01942","citing_paper":"/paper/2509.09196"},"observation_digest":"sha256:27607f0674c4cce049a697be48340b90ffab32b5088e70378e9b4c74dfd3e5b9","observation_id":"2cb56a5a-dd5d-4345-ad31-cc836b411c58","resolution":{"observed_at":"2026-08-04T19:36:44.130176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.09196","last_updated":"2025-09-11T07:11:46Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-15T16:45:03.354645Z","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":40},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 1 inbound Pith citation observation for arXiv:2509.09196."}