{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6VBI2BZ47ZFBCPDHMBZHHEMUT5","short_pith_number":"pith:6VBI2BZ4","canonical_record":{"source":{"id":"2509.09196","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-11T07:11:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1aa18e6d1672ccc49b3897072cef4fc7108728cda4374494c91a07ca17f14e89","abstract_canon_sha256":"b3a5ab5939896113450f7771eaefbbfc696d72075b97203f862ecbd1a0d65424"},"schema_version":"1.0"},"canonical_sha256":"f5428d073cfe4a113c6760727391949f4b640ad71f01897e7bb0389922f0f30f","source":{"kind":"arxiv","id":"2509.09196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09196","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09196v1","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09196","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"6VBI2BZ47ZFB","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"pith_short_16","alias_value":"6VBI2BZ47ZFBCPDH","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"pith_short_8","alias_value":"6VBI2BZ4","created_at":"2026-07-05T12:09:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6VBI2BZ47ZFBCPDHMBZHHEMUT5","target":"record","payload":{"canonical_record":{"source":{"id":"2509.09196","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-11T07:11:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1aa18e6d1672ccc49b3897072cef4fc7108728cda4374494c91a07ca17f14e89","abstract_canon_sha256":"b3a5ab5939896113450f7771eaefbbfc696d72075b97203f862ecbd1a0d65424"},"schema_version":"1.0"},"canonical_sha256":"f5428d073cfe4a113c6760727391949f4b640ad71f01897e7bb0389922f0f30f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:31.432712Z","signature_b64":"uUk+VHxhaYmqNZsKCaJ5Ft+7N11sLVsVpoZSDbdma2BZxnV0RApMAam8LArWFxMTrX5RydVg/jMja1KzvMixDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5428d073cfe4a113c6760727391949f4b640ad71f01897e7bb0389922f0f30f","last_reissued_at":"2026-07-05T12:09:31.432136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:31.432136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.09196","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjqW4e0Ww0xWvn9RgHmMzhp5+Lwqvkm7ndCCKDj20rGTcoaTrfztEBif5JhCE0eFtsMQUDfldgJgD+ZWlkkTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T10:04:30.160430Z"},"content_sha256":"3312aed39013b7d72c57b7dd527cf72216c0381c4aa8fdd0009bbbbca6978e16","schema_version":"1.0","event_id":"sha256:3312aed39013b7d72c57b7dd527cf72216c0381c4aa8fdd0009bbbbca6978e16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6VBI2BZ47ZFBCPDHMBZHHEMUT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chin Yuen Kwok, Jia Qi Yip","submitted_at":"2025-09-11T07:11:46Z","abstract_excerpt":"Contextual biasing improves rare word recognition of ASR models by prioritizing the output of rare words during decoding. A common approach is Trie-based biasing, which gives \"bonus scores\" to partial hypothesis (e.g. \"Bon\") that may lead to the generation of the rare word (e.g. \"Bonham\"). If the full word (\"Bonham\") isn't ultimately recognized, the system revokes those earlier bonuses. This revocation is limited to beam search and is computationally expensive, particularly for models with large decoders. To overcome these limitations, we propose adapting ASR models to look ahead and predict m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09196","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.09196/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgDxtv9X7Xolvy2AofnggsoEc82qdtIetDJpJfKhTirSkSQBD9GdAnD3T/7wFYLHNlO8+bdPP40CjhMh4MaNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T10:04:30.160811Z"},"content_sha256":"455e3d99c3f3acf48389455751a8144bb0644c272da30916f59b5538f3a19546","schema_version":"1.0","event_id":"sha256:455e3d99c3f3acf48389455751a8144bb0644c272da30916f59b5538f3a19546"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VBI2BZ47ZFBCPDHMBZHHEMUT5/bundle.json","state_url":"https://pith.science/pith/6VBI2BZ47ZFBCPDHMBZHHEMUT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VBI2BZ47ZFBCPDHMBZHHEMUT5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-17T10:04:30Z","links":{"resolver":"https://pith.science/pith/6VBI2BZ47ZFBCPDHMBZHHEMUT5","bundle":"https://pith.science/pith/6VBI2BZ47ZFBCPDHMBZHHEMUT5/bundle.json","state":"https://pith.science/pith/6VBI2BZ47ZFBCPDHMBZHHEMUT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VBI2BZ47ZFBCPDHMBZHHEMUT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6VBI2BZ47ZFBCPDHMBZHHEMUT5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b3a5ab5939896113450f7771eaefbbfc696d72075b97203f862ecbd1a0d65424","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-11T07:11:46Z","title_canon_sha256":"1aa18e6d1672ccc49b3897072cef4fc7108728cda4374494c91a07ca17f14e89"},"schema_version":"1.0","source":{"id":"2509.09196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09196","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09196v1","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09196","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"6VBI2BZ47ZFB","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"pith_short_16","alias_value":"6VBI2BZ47ZFBCPDH","created_at":"2026-07-05T12:09:31Z"},{"alias_kind":"pith_short_8","alias_value":"6VBI2BZ4","created_at":"2026-07-05T12:09:31Z"}],"graph_snapshots":[{"event_id":"sha256:455e3d99c3f3acf48389455751a8144bb0644c272da30916f59b5538f3a19546","target":"graph","created_at":"2026-07-05T12:09:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.09196/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Contextual biasing improves rare word recognition of ASR models by prioritizing the output of rare words during decoding. A common approach is Trie-based biasing, which gives \"bonus scores\" to partial hypothesis (e.g. \"Bon\") that may lead to the generation of the rare word (e.g. \"Bonham\"). If the full word (\"Bonham\") isn't ultimately recognized, the system revokes those earlier bonuses. This revocation is limited to beam search and is computationally expensive, particularly for models with large decoders. To overcome these limitations, we propose adapting ASR models to look ahead and predict m","authors_text":"Chin Yuen Kwok, Jia Qi Yip","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-11T07:11:46Z","title":"Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09196","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3312aed39013b7d72c57b7dd527cf72216c0381c4aa8fdd0009bbbbca6978e16","target":"record","created_at":"2026-07-05T12:09:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b3a5ab5939896113450f7771eaefbbfc696d72075b97203f862ecbd1a0d65424","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-11T07:11:46Z","title_canon_sha256":"1aa18e6d1672ccc49b3897072cef4fc7108728cda4374494c91a07ca17f14e89"},"schema_version":"1.0","source":{"id":"2509.09196","kind":"arxiv","version":1}},"canonical_sha256":"f5428d073cfe4a113c6760727391949f4b640ad71f01897e7bb0389922f0f30f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5428d073cfe4a113c6760727391949f4b640ad71f01897e7bb0389922f0f30f","first_computed_at":"2026-07-05T12:09:31.432136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:09:31.432136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uUk+VHxhaYmqNZsKCaJ5Ft+7N11sLVsVpoZSDbdma2BZxnV0RApMAam8LArWFxMTrX5RydVg/jMja1KzvMixDw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:09:31.432712Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.09196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3312aed39013b7d72c57b7dd527cf72216c0381c4aa8fdd0009bbbbca6978e16","sha256:455e3d99c3f3acf48389455751a8144bb0644c272da30916f59b5538f3a19546"],"state_sha256":"4fb90299227fb489988617d63f788ba4d151a280d8a966a9be9a83b097d895e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOgbUbqKGbyUdEcPvVCsIvlKqhzNmQQ6nrymkpmzXoJvj8VfMnlzaO/a/EPLH29KiwNKQUr6lhXMIyARhpYFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T10:04:30.163054Z","bundle_sha256":"d1f463cfbde845f643786308d84082d903e12895ccb34dbf237a481624f6047e"}}