{"as_of":"2026-08-20T15:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b2fadb56df4204f6213ea62d58ee3ab81eaf1dde907bff53383751124b1ed247","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:11:33.291450Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2608.12574/citation-record","integrity":"/paper/2608.12574/integrity","json":"/paper/2608.12574/citation-record.json","paper":"/paper/2608.12574"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:11:33.097933Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.097933Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:8dc42a88fd7f07650dcfe99c3d3cfef8b037cd6bed1bb872533456d658035810","observation_id":"df94fc50-ed9a-4470-98dc-cd401ce51fb9","resolution":{"observed_at":"2026-08-16T00:11:33.097933Z","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-16T00:11:33.953314Z","title":"Gonzalez and Clark Barrett and Ying Sheng , booktitle=","venue":null,"work_id":"5f39e9b7-fbc9-4928-bffe-ca245d5eefc3","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.103559Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:e6627b606c80955e4ab818bed35e875b386dc61c6304bb6a431dd69c1bc3bfe6","observation_id":"34a9422e-1b8c-418d-8237-17baa0a12c58","resolution":{"observed_at":"2026-08-16T00:11:33.957449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.942683Z","title":"NeurIPS , year=","venue":null,"work_id":"6abe2e6a-f91e-429b-a7af-7ce7b774a3f4","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.106974Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:a32fe142551925ceabfad779bff3795b036165e2a3fee4f158a1a0b24069dd3b","observation_id":"88a1f6bc-3046-4154-a573-f606114df919","resolution":{"observed_at":"2026-08-16T00:11:33.946961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.933526Z","title":"EMNLP Industry Track , year=","venue":null,"work_id":"1ad37583-7f5c-4480-a8eb-92c548303265","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.110534Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:2bd8c8028b3f7655faeb968dee6c589b39f31f42070cef6ddd6741691237d9c2","observation_id":"cad0f3b2-58d3-4d5e-ac14-2611bbd04a69","resolution":{"observed_at":"2026-08-16T00:11:33.936550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.923430Z","title":"Grammar-Constrained Decoding for Structured","venue":null,"work_id":"c0ad1228-2225-495d-ad62-0f5b1747fc42","year":2023},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.113967Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:906c35cab15c20212701d12d2a2d5dd51bfec008163615faa08721e363cb84c4","observation_id":"85b6296e-2ae5-4b17-9867-c6c36abd71cb","resolution":{"observed_at":"2026-08-16T00:11:33.926971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.913424Z","title":"Ruan and Yaxing Cai and Ruihang Lai and Ziyi Xu and Yilong Zhao and Tianqi Chen , journal=","venue":null,"work_id":"afbae692-0e75-457b-be70-0809f7f76682","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.118088Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:a227f5d272ad573021c02a996ff0ddd4fd6523b4ea42c1dd62cb7defb15eb35e","observation_id":"b62ef258-4dee-4522-9fad-f58aba8bd529","resolution":{"observed_at":"2026-08-16T00:11:33.916911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.903181Z","title":"ICML , year=","venue":null,"work_id":"5f129563-b666-4bf2-95b5-ba381ba4ddf2","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.121800Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:ef8daaa734853cb020c2935cb808e9f0607e0325f0964282bd03561111ea9cef","observation_id":"cd83a051-08b3-4533-af8e-9cb75c2c6265","resolution":{"observed_at":"2026-08-16T00:11:33.906338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.893409Z","title":null,"venue":null,"work_id":"0da66f1d-f370-407f-bbe2-5b123c060be9","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.124996Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:edd3beed73045ee85e062af9a315603f0a8889fb9ed4369bb3d8e23bee153019","observation_id":"80fa68e4-a844-4ceb-b0e7-c1ec8ce8f13c","resolution":{"observed_at":"2026-08-16T00:11:33.896651Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.883598Z","title":null,"venue":null,"work_id":"62d289f6-74ff-4851-bbc1-03ebf4243dc0","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.128390Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:3aa3e9270f1d83961d56c5e92a0022378482d25eb4f18b6210c63c6e06d99e32","observation_id":"73c55d32-6a9e-4491-af9b-bb8697ed9591","resolution":{"observed_at":"2026-08-16T00:11:33.887234Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.873626Z","title":"NeurIPS , year=","venue":null,"work_id":"7f2a632d-43de-4d2c-8712-afc619745aef","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.131511Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:619210bbcf719a681256a72d8a08280d2d0b18733c0c3f2d35a32eb5e7ab82b5","observation_id":"6801d611-4fa1-4013-8f49-e7a4e9872cc3","resolution":{"observed_at":"2026-08-16T00:11:33.877262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.134736Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.134736Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:e8a5cebebf4bf53e65ac509ea97e4927562c1d2e242976e96ebd5a4db75ffa64","observation_id":"fe3eb3da-09c4-4430-a772-70c64a0b2d8c","resolution":{"observed_at":"2026-08-16T00:11:33.134736Z","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-16T00:11:33.862001Z","title":"NAACL , year=","venue":null,"work_id":"d658ae0a-24cb-4879-a1d2-6b28fbeee8b3","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.138003Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:9f629177559f03f2d38a430d2b1f937768bde6d3220f33a9e6d5f359b293ae97","observation_id":"ca3a5e07-1745-4bf6-8ccd-6483e3986426","resolution":{"observed_at":"2026-08-16T00:11:33.866267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.16768","last_updated":"2025-07-22T17:13:47Z","snapshot_observed_at":"2026-08-17T10:15:42.904906Z","submitted_at":"2025-07-22T17:13:47Z","title":"WGRAMMAR: Leverage Prior Knowledge to Accelerate Structured Decoding","version":1},"cited_work":{"arxiv_id":"2507.16768","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.16768","snapshot_observed_at":"2026-08-16T00:11:33.489422Z","title":"WGRAMMAR: Leverage Prior Knowledge to Accelerate Structured Decoding","venue":"cs.AI","work_id":"b4014c85-3f96-4ed1-a0e2-998e3dcdf47e","year":2025},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.141824Z"},"links":{"cited_paper":"/paper/2507.16768","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:8e13ede960fe7ae0f49eeffa71e5253302947c950e50ee31759f765a8b04af89","observation_id":"cfb66851-69a6-4d4f-9363-32ae0b6c81b7","resolution":{"observed_at":"2026-08-16T00:11:33.493542Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.850884Z","title":"2007 , note=","venue":null,"work_id":"495f493c-0910-438c-a57e-a136dade9deb","year":2007},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.145573Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:f09dbf250d066f21e3b411f02731be661c1fe5389146e118b6550721ba33deeb","observation_id":"919a43c9-e735-4150-a818-e76b83562fca","resolution":{"observed_at":"2026-08-16T00:11:33.854452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12849","last_updated":"2024-07-06T06:58:51Z","snapshot_observed_at":"2026-08-16T13:36:36.482565Z","submitted_at":"2024-07-06T06:58:51Z","title":"Large language models are good medical coders, if provided with tools","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12849","snapshot_observed_at":"2026-08-16T00:11:33.149129Z","title":"arXiv preprint arXiv:2407.12849 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.149129Z"},"links":{"cited_paper":"/paper/2407.12849","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:cb39efa19f3435f2b0136f96b4c3cb04d3e9c7f7511aa1c7edeef0fc4fbb29d0","observation_id":"e9507910-90e2-44a8-aa02-f331dc419bc2","resolution":{"observed_at":"2026-08-16T00:11:33.149129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.13998","last_updated":"2023-04-27T07:36:14Z","snapshot_observed_at":"2026-08-20T10:40:25.164543Z","submitted_at":"2023-04-27T07:36:14Z","title":"Mimic-IV-ICD: A new benchmark for eXtreme MultiLabel Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.13998","snapshot_observed_at":"2026-08-16T00:11:33.153596Z","title":"arXiv preprint arXiv:2304.13998 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.153596Z"},"links":{"cited_paper":"/paper/2304.13998","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:97f26d573fe595b01002e0483ceb1d64b980d868b1624b3927a146ba25c04c04","observation_id":"fb907f54-4b3c-4fae-8bce-defe39213732","resolution":{"observed_at":"2026-08-16T00:11:33.153596Z","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-16T00:11:33.839803Z","title":"2025 , howpublished=","venue":null,"work_id":"3aee10c6-22bb-4fe3-8e95-e95e8c8a10c2","year":2026},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.157258Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:48c2ea699fce313b6d40f101df8f9261b9000cbd3329dd255db26bf65c19dd0e","observation_id":"1bf78bc5-f1f9-477e-9b8a-1bca2beeddbe","resolution":{"observed_at":"2026-08-16T00:11:33.843474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.828711Z","title":null,"venue":null,"work_id":"953641f6-43a5-456d-b166-a74a3c0fd6a3","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.161583Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:065fc0b7713387817ce92894e2a08e23715be9754330de396f553717aadc69e1","observation_id":"3b9f2674-eba8-4c44-b3e0-424bb428acdc","resolution":{"observed_at":"2026-08-16T00:11:33.832355Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.818238Z","title":"ICML , year=","venue":null,"work_id":"148dd9f4-8ce6-4f40-b07b-3b7b0fc83112","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.165017Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:b0c8142589083f895f9942c1ada0ab63dc941c534241838121413938fcafbed1","observation_id":"e5e003ff-c94c-45ed-bbc6-6542b20c61e8","resolution":{"observed_at":"2026-08-16T00:11:33.821817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.806680Z","title":"ICML , year=","venue":null,"work_id":"53bba760-ac22-4215-937b-383a9b675be2","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.168107Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:02f9260fe13584efbc21ba7dc2df3b072fd5ef5e8b56a4d868fc84a4b64f3a82","observation_id":"d0d4133d-05ba-464f-87f5-053b9ace4231","resolution":{"observed_at":"2026-08-16T00:11:33.810994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.171273Z","title":"NeurIPS , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.171273Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:1de3b75be001cca07b21f66233ebbdf0ec22f0749897851e4ceb935b960f9868","observation_id":"0924253a-2c4e-4dd1-a7c3-025370fd9005","resolution":{"observed_at":"2026-08-16T00:11:33.171273Z","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-16T00:11:33.788899Z","title":"NeurIPS , year=","venue":null,"work_id":"317a957c-8ac7-42ed-8685-36a9e57eea17","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.174432Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:139bd9209b3f9604e66632e11c6899e247c80380d1fc88dff78d7487e08af894","observation_id":"243e20a5-c58c-45a6-8bbe-e18a331bb5b0","resolution":{"observed_at":"2026-08-16T00:11:33.793004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.778993Z","title":"2021 , note=","venue":null,"work_id":"4b8a0424-09d6-4fa9-a611-9005ebdc2d6c","year":2021},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.177642Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:aaf18fbcb03ba850c597a842c315b21f101fc67bc800d3ba10c4ecf368a3a34c","observation_id":"d5c478ad-a088-4197-abb4-a10a22d5347e","resolution":{"observed_at":"2026-08-16T00:11:33.782526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.768751Z","title":"NAACL , year=","venue":null,"work_id":"2dc1100c-67db-4f6b-a09d-8aec86d0058a","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.181863Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:010d0fa4745e265b5ee65fecc2e0e020283d3fadc7224d1aca76790684975158","observation_id":"caf9742e-a0e2-4981-8252-6f94761101fe","resolution":{"observed_at":"2026-08-16T00:11:33.772620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.758913Z","title":"EMNLP , year=","venue":null,"work_id":"21668c21-4cb7-446e-afe0-7a6392651368","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.185180Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:212406c0e03df218591a1060b1b15b0bf9ae8a9d3a8838a389833989110e5b0d","observation_id":"7f1fb359-2c37-4d0d-87f7-9e421affa327","resolution":{"observed_at":"2026-08-16T00:11:33.762088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.749824Z","title":"NAACL , year=","venue":null,"work_id":"39bcfe60-254f-48f9-a3d3-fbe76ad47366","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.188615Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:fdc743a241a48498e027d35e02b658cf2b6a9937dcad100f864a20b3ebeb1e08","observation_id":"4349dbf5-f8ef-40c3-9ab6-e0e3c4675fcf","resolution":{"observed_at":"2026-08-16T00:11:33.752840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.740219Z","title":"ICML , year=","venue":null,"work_id":"6ed0a632-ee94-440a-853c-ee63c5f2008f","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.191716Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:07def6e1523432ce89c3393a636ab5ce4d3a2325bf5103b07c3e3e5d3de4ac7a","observation_id":"564f74a2-1463-42ad-a572-ebba0c4a20ca","resolution":{"observed_at":"2026-08-16T00:11:33.743432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.729724Z","title":"EMNLP , year=","venue":null,"work_id":"5e512772-ca09-4b67-b32e-144b1ca3b5c4","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.194910Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:2351a6b89702080389269c84160e147ec2906d5901e2a812a10ff561cf6f750f","observation_id":"301b730c-a0e1-4986-90f5-73e6fcf5ad2e","resolution":{"observed_at":"2026-08-16T00:11:33.733927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.720153Z","title":"NeurIPS , year=","venue":null,"work_id":"84213a0a-f2ea-4a77-8a38-7f9d44920004","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.198197Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:1d89e8e25b2f0c48d0090188b371a1dd509106f35e1b64335355052e93bfdecd","observation_id":"c0d89495-786c-40ea-a9f9-da78001a7ccd","resolution":{"observed_at":"2026-08-16T00:11:33.723470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-19T00:47:30.094349Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-08-16T00:11:33.201175Z","title":"arXiv preprint arXiv:2502.09061 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.201175Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:d6d6d353fb1ba1279320d9bf4a829dbcf7daeedfd60ac44ff65079634288f3bf","observation_id":"51ae8625-c751-4ccd-88b5-2f539eb6f865","resolution":{"observed_at":"2026-08-16T00:11:33.201175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14969","last_updated":"2025-08-01T03:52:27Z","snapshot_observed_at":"2026-08-16T12:56:33.035488Z","submitted_at":"2025-02-20T19:06:18Z","title":"Lost in Space: Finding the Right Tokens for Structured Output","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14969","snapshot_observed_at":"2026-08-16T00:11:33.204817Z","title":"arXiv preprint arXiv:2502.14969 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.204817Z"},"links":{"cited_paper":"/paper/2502.14969","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:5d1b98e2f69997a46bf966d5ff814754145fd3e31b5662dc4058989a1a406baa","observation_id":"20718b53-ffbc-4276-94b3-9de3de02aacd","resolution":{"observed_at":"2026-08-16T00:11:33.204817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04016","last_updated":"2025-05-06T23:29:43Z","snapshot_observed_at":"2026-08-19T09:55:51.953537Z","submitted_at":"2025-05-06T23:29:43Z","title":"SLOT: Structuring the Output of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04016","snapshot_observed_at":"2026-08-16T00:11:33.208234Z","title":"arXiv preprint arXiv:2505.04016 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.208234Z"},"links":{"cited_paper":"/paper/2505.04016","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:82738656de566d9eb0b99e07e87d59e89be2bc6e28ede6517b3d4d702160ccc9","observation_id":"aeffbc93-8434-4e85-a229-c99bc0ee0e6d","resolution":{"observed_at":"2026-08-16T00:11:33.208234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.03718","last_updated":"2018-06-08T11:39:04Z","snapshot_observed_at":"2026-08-14T21:07:04.501108Z","submitted_at":"2017-04-12T12:09:40Z","title":"Deep Extreme Multi-label Learning","version":4},"cited_work":{"arxiv_id":"1704.03718","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.03718","snapshot_observed_at":"2026-08-16T00:11:33.421672Z","title":"Deep Extreme Multi-label Learning","venue":"cs.LG","work_id":"d041ffed-7b0e-4225-aa56-65b8a1e8e5d0","year":2017},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.211752Z"},"links":{"cited_paper":"/paper/1704.03718","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:a826516f3b2823c55abed9ba4947ef143a9f02759fccf549b13ada42382a3f64","observation_id":"739b27a7-83d5-411e-8425-ec22c257b7fe","resolution":{"observed_at":"2026-08-16T00:11:33.427408Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.709573Z","title":"NeurIPS , year=","venue":null,"work_id":"8186e928-68fe-45f1-aafb-9ce4f1aa3702","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.215277Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:48bdb096b779460b80f9d90aaba199302545ce977006a7940b42bf74114b2443","observation_id":"e7d145a1-3168-4b4f-a368-56a9d09177ed","resolution":{"observed_at":"2026-08-16T00:11:33.713227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.700397Z","title":"Communications of the ACM , volume=","venue":null,"work_id":"0cd859e2-8685-4a37-bda1-11881401e80a","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.218420Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:4093fbcf2d5d517e09509fb1579d07bfc76d56327621d0294a6bcce7b5a8f57f","observation_id":"e9e8277b-b157-4fe6-900b-9d479089a929","resolution":{"observed_at":"2026-08-16T00:11:33.703592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.690784Z","title":"EMNLP , year=","venue":null,"work_id":"7f303977-2b78-4252-ae9c-194324c12223","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.221752Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:2618cbeab7376c5a50196ec181b01d0221eae9f2fe9bf8a9c00cc0b3ecc54c9e","observation_id":"6c18ce75-ce9d-4c3b-968b-1b0700f05db0","resolution":{"observed_at":"2026-08-16T00:11:33.694280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.680931Z","title":"ICLR , year=","venue":null,"work_id":"94dffe6d-8583-4f77-9eca-c241a763a0b5","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.225118Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:b12053ac6605237bff64513e22e95fee7e667b8121d6e09eebbf325a53f2c250","observation_id":"9710e3f9-e35c-4bc2-be74-d73e4c9e58c9","resolution":{"observed_at":"2026-08-16T00:11:33.684270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.670394Z","title":"2024 , note=","venue":null,"work_id":"ca204849-b069-4462-8e51-59f9d8c13a82","year":2024},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.228355Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:6fc3375cec38a2b98a74a9c1a8ca6b56b458797fa46f3bf4855c0aad664218fd","observation_id":"302a3d18-e119-4454-867c-ab1824141a2a","resolution":{"observed_at":"2026-08-16T00:11:33.674542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.659726Z","title":null,"venue":null,"work_id":"f1b97f57-6ffa-4bca-9cff-1c86d8d13647","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.231654Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:5ecfbe8e63d5ae3fd13ee64877d919df5529bf5b61e8e46e5077b6c8beb0e3a5","observation_id":"102f9002-25a4-46f7-a2de-8113d1dbf5af","resolution":{"observed_at":"2026-08-16T00:11:33.663065Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.09135","last_updated":"2025-04-12T08:49:21Z","snapshot_observed_at":"2026-08-19T23:26:02.288038Z","submitted_at":"2025-04-12T08:49:21Z","title":"Efficient and Asymptotically Unbiased Constrained Decoding for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.09135","snapshot_observed_at":"2026-08-16T00:11:33.234899Z","title":"arXiv preprint arXiv:2504.09135 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.234899Z"},"links":{"cited_paper":"/paper/2504.09135","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:7ac8e36c70528c835e973fe4d6fd11b90548efac261ef6f95d42c2b0e9fbb011","observation_id":"4cfeabbd-18a1-47bf-ba1c-426aa3eae787","resolution":{"observed_at":"2026-08-16T00:11:33.234899Z","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-16T00:11:33.648234Z","title":"Transactions of the ACL , year=","venue":null,"work_id":"58afd07a-9ab2-4754-bf8d-6abb6704cc37","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.239376Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:4626c76e234ac4808f5be22ce1ac0bd841d74c933a3d38e44486b2d646b55530","observation_id":"d2776c18-70aa-4a62-bd0a-f0c4a7784e52","resolution":{"observed_at":"2026-08-16T00:11:33.652510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.242854Z","title":"arXiv preprint arXiv:2509.20386 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.242854Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:45021590b4860779cb01184df5b1cce3dd9604fea893638731754ead9497f83e","observation_id":"2170249e-34b7-40ee-bcb7-a314d0210bed","resolution":{"observed_at":"2026-08-16T00:11:33.242854Z","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-16T00:11:33.637989Z","title":"Communications of the ACM , volume=","venue":null,"work_id":"5f0c6574-98cb-4bde-bc12-3b8956aa10fe","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.246047Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:151941aa179d33ae69b07cb71adc9f4a7d3ccfb2fef94d704914b2e3961422f7","observation_id":"12cbfe74-02ff-4b62-a2e3-d2f41af145a7","resolution":{"observed_at":"2026-08-16T00:11:33.641940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.627637Z","title":"Communications of the ACM , volume=","venue":null,"work_id":"f539be19-d046-48be-a523-badfef01fcd5","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.250239Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:c4f518e6777b2f0ee4970d52ca2b6fb190a1e543373219745cca8b1859011036","observation_id":"786ef5d8-095d-4f4f-b357-13a95d3c3a7d","resolution":{"observed_at":"2026-08-16T00:11:33.631311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.617651Z","title":"Theory of Machines and Computations , pages=","venue":null,"work_id":"9acfdabd-317e-47fe-9a6a-523f6e5d816e","year":1971},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.253567Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:019c1f0da6eeed507bc0842e4424be4953ee1595a3f263eb414da1b59e6820d3","observation_id":"911d4bb4-9111-40bd-af13-18896e1d9198","resolution":{"observed_at":"2026-08-16T00:11:33.621268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.257037Z","title":"2024 , howpublished=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.257037Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:61297657b0782af5c56dae2737188b344f1b84448a6f8e71c119f8881c43d064","observation_id":"bd45abfa-1e2c-4e75-9e8a-d0cd415af213","resolution":{"observed_at":"2026-08-16T00:11:33.257037Z","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-16T00:11:33.600552Z","title":"2024 , howpublished=","venue":null,"work_id":"cad4cc8e-89ea-46cd-a183-1f8a132ca0aa","year":2024},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.260449Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:92ab0844458b3edcb29b980f81554b18d2ecf0c0886a0b9ad366e47c35626ed1","observation_id":"d37ce313-280b-42b4-9d92-ff1869843377","resolution":{"observed_at":"2026-08-16T00:11:33.604642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.590863Z","title":"2025 , howpublished=","venue":null,"work_id":"0f7cbff0-4834-4d09-8b7b-8564032a0b41","year":2025},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.264064Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:860abc24634903d8b50c1995eb08773b2c71596981e756fcb26e3ac461781aae","observation_id":"7414cb1d-8beb-49b4-a0f9-8a38cc1bc7ca","resolution":{"observed_at":"2026-08-16T00:11:33.594224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.581421Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for","venue":null,"work_id":"be5cb924-d10a-41ba-861b-cef86c6a5e40","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.267304Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:dfcdce727f5af45b5389592305e3db2b0f7633bc3d6b1df921fe143d3d11a59e","observation_id":"5fc07595-36cb-40fc-99a9-75699f4fd4dc","resolution":{"observed_at":"2026-08-16T00:11:33.584899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.571781Z","title":"COLING , year=","venue":null,"work_id":"f450c9a2-347f-4950-9a85-318a7ed52a45","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.271388Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:19d35ff66817bdbba2193783cb5159e85966b83b78b36ee9eceb90440ae959ff","observation_id":"64fd6c50-6b84-4b0f-90eb-209241cb9552","resolution":{"observed_at":"2026-08-16T00:11:33.575004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.562015Z","title":null,"venue":null,"work_id":"d26f0436-052f-487f-804a-7afc44489bd5","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.274827Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:4a36134e3f5dc5253817559f28cd2d65355f3712ad4fd56a23cfb0a3c92cee58","observation_id":"0019f4f3-6e2b-4a24-9e16-4fc9c9aa3917","resolution":{"observed_at":"2026-08-16T00:11:33.565585Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.548172Z","title":"Proceedings of the 2nd Workshop on Natural Language Processing for Conversational AI (NLP4ConvAI), ACL , year=","venue":null,"work_id":"047632c1-99c3-47b5-9524-9aac218af3cf","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.277926Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:d424c09766951e89af29b8f9c9e31ccd7a6130f92d7b196272a787d6da62c023","observation_id":"037d6e9c-5f48-4945-bbd7-a9cae3a4cc55","resolution":{"observed_at":"2026-08-16T00:11:33.553688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.536289Z","title":"EMNLP-IJCNLP , year=","venue":null,"work_id":"3aa7000d-f426-4279-a9fb-61947c2fa910","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.281335Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:f5c8f3f1517589b698f7f4bd5019c6cd132141ec00b4d511c8e589456beb6d99","observation_id":"51feb219-949c-4f4d-b39b-0228432842b8","resolution":{"observed_at":"2026-08-16T00:11:33.539886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.524763Z","title":"EMNLP , year=","venue":null,"work_id":"61c1eb78-d42c-40d4-8045-e562655996c0","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.284900Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:794707f8ffca8a2ed9ccd19d4dfaf5afca5b63549f20a68b82858d692507ecc0","observation_id":"9f04f996-c71e-4144-9909-d7cb47465f7c","resolution":{"observed_at":"2026-08-16T00:11:33.528509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.513061Z","title":"Computational Linguistics , volume=","venue":null,"work_id":"59ff208b-d559-4139-b3f8-90d89129f8e0","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.288069Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:026fb9fcc1b586fe0a40b37775d900ad051fa22af71ae544cea902effc454b86","observation_id":"e122773b-d78d-4ce1-a669-5687adf06d4f","resolution":{"observed_at":"2026-08-16T00:11:33.516660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T00:11:33.500985Z","title":"APSIPA ASC , year=","venue":null,"work_id":"92bbc48a-934f-4c14-bdcc-7d178d6c6011","year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.291450Z"},"links":{"citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:12d1ed1b4bfb7d91604eca54e245a4607c2c3f0c27f660ae989acc46ee49014a","observation_id":"8a53f982-d184-4152-b829-88e41107695e","resolution":{"observed_at":"2026-08-16T00:11:33.505469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-20T02:27:59.850102Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":38},"total_outbound_references":56},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2608.12574."}