{"as_of":"2026-08-06T18:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19556a7ba7cb35a80cbf75159f99ca3eda2cb8e1cf960dbab43b90207f7a75ea","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T20:42:44.668233Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T20:27:57.569744Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-05T04:00:39.587320Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"cited_work":{"arxiv_id":"2602.22647","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.22647","snapshot_observed_at":"2026-07-22T01:22:20.900011Z","title":"Vectorizing the trie: Efficient constrained decoding for llm-based generative retrieval on accelerators","venue":null,"work_id":"2ba46a38-d8cc-4cd9-ae7b-ece76a5ce147","year":2026},"citing_paper":{"arxiv_id":"2605.05096","last_updated":"2026-05-06T16:33:13Z","snapshot_observed_at":"2026-08-01T14:30:19.540929Z","submitted_at":"2026-05-06T16:33:13Z","title":"CapsID: Soft-Routed Variable-Length Semantic IDs for Generative Recommendation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-08T15:54:53.821143Z"},"links":{"cited_paper":"/paper/2602.22647","citing_paper":"/paper/2605.05096"},"observation_digest":"sha256:c6d70e28eb95f2bafce5eb20bd379a40edfdc4b7af951facb837587fa2ccc370","observation_id":"052de851-b058-4f09-89e7-f14359352609","resolution":{"observed_at":"2026-07-22T01:22:20.900011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"cited_work":{"arxiv_id":"2602.22647","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.22647","snapshot_observed_at":"2026-07-22T01:22:20.900011Z","title":"Vectorizing the trie: Efficient constrained decoding for llm-based generative retrieval on accelerators","venue":null,"work_id":"2ba46a38-d8cc-4cd9-ae7b-ece76a5ce147","year":2026},"citing_paper":{"arxiv_id":"2606.00324","last_updated":"2026-05-29T20:01:06Z","snapshot_observed_at":"2026-07-06T23:41:01.066075Z","submitted_at":"2026-05-29T20:01:06Z","title":"LLMs Need Encoders for Semantic IDs Too","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T20:32:36.937027Z"},"links":{"cited_paper":"/paper/2602.22647","citing_paper":"/paper/2606.00324"},"observation_digest":"sha256:bcb6f54224868a769f24a9c7290c1e1d8805b1d61a3491a9ba9d0b4d917e5e6d","observation_id":"f702e618-053d-4e16-b03f-1798ca96847d","resolution":{"observed_at":"2026-07-22T01:22:20.900011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"cited_work":{"arxiv_id":"2602.22647","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.22647","snapshot_observed_at":"2026-07-22T01:22:20.900011Z","title":"Vectorizing the trie: Efficient constrained decoding for llm-based generative retrieval on accelerators","venue":null,"work_id":"2ba46a38-d8cc-4cd9-ae7b-ece76a5ce147","year":2026},"citing_paper":{"arxiv_id":"2606.00422","last_updated":"2026-05-29T23:17:34Z","snapshot_observed_at":"2026-07-06T23:41:05.637982Z","submitted_at":"2026-05-29T23:17:34Z","title":"UniPinRec: Unifying Generative Retrieval and Ranking at Pinterest Scale","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T20:30:25.473281Z"},"links":{"cited_paper":"/paper/2602.22647","citing_paper":"/paper/2606.00422"},"observation_digest":"sha256:c1e371ea72d2f52eda73b409c3f04416bf49694c466debd5634755e46e2ababb","observation_id":"8b814ea0-49fd-44f6-aaa6-6f6947a1668f","resolution":{"observed_at":"2026-07-22T01:22:20.900011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"cited_work":{"arxiv_id":"2602.22647","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.22647","snapshot_observed_at":"2026-07-22T01:22:20.900011Z","title":"Vectorizing the trie: Efficient constrained decoding for llm-based generative retrieval on accelerators","venue":null,"work_id":"2ba46a38-d8cc-4cd9-ae7b-ece76a5ce147","year":2026},"citing_paper":{"arxiv_id":"2606.11203","last_updated":"2026-04-22T09:24:25Z","snapshot_observed_at":"2026-08-02T10:53:08.619551Z","submitted_at":"2026-04-22T09:24:25Z","title":"LatticeBridge: Rare-Event Sequential Inference for Faithful Structured Sequence Synthesis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-05T03:58:47.125099Z"},"links":{"cited_paper":"/paper/2602.22647","citing_paper":"/paper/2606.11203"},"observation_digest":"sha256:279afc21b85174f9920239e70584c7ef7ba9061d035e4743fec4c67096ee6611","observation_id":"23901eda-0c74-46c8-a28f-4d3ef4473dda","resolution":{"observed_at":"2026-07-22T01:22:20.900011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.22647","snapshot_observed_at":"2026-08-01T20:27:57.569744Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16633","last_updated":"2026-07-18T04:31:02Z","snapshot_observed_at":"2026-08-05T23:59:37.812563Z","submitted_at":"2026-07-18T04:31:02Z","title":"Beyond Fixed Depths and Widths: Optimizing Textual Decoding Tries in LLM-based Generative Recommendation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T20:27:57.569744Z"},"links":{"cited_paper":"/paper/2602.22647","citing_paper":"/paper/2607.16633"},"observation_digest":"sha256:aeb8fb79d2beeb09e03d62184ed1d77c2373d9f26b9d038f90db955651d52bd7","observation_id":"9594d763-b246-403e-8708-24bb2bb772c8","resolution":{"observed_at":"2026-08-01T20:27:57.569744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2602.22647/citation-record","integrity":"/paper/2602.22647/integrity","json":"/paper/2602.22647/citation-record.json","paper":"/paper/2602.22647"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T20:42:39.211802Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:39.211802Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:47e885978b2b6e68667c915c461867e46bbfa681cc9cd388d9562df05a481db5","observation_id":"bc5b190e-b8e7-436c-9b1c-bb6b34c5fd80","resolution":{"observed_at":"2026-08-02T20:42:39.211802Z","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-02T20:42:39.315595Z","title":"2018.JAX: composable transformations of Python+NumPy programs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:39.315595Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:b56db554e61dcfdbb439f546a24aae0ab02463b5552b851b3a568d579f0bf82d","observation_id":"5914b857-63f6-4988-9362-4a18cf7b715f","resolution":{"observed_at":"2026-08-02T20:42:39.315595Z","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-02T20:42:39.516267Z","title":"Adams, and Emre Sargin","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:39.516267Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:4fc9487f9769d5ad985728d2fc1aa5e2e141bf4d704b2612901b784786746da2","observation_id":"4bc7c4ff-520d-433e-83c7-f65bfb472673","resolution":{"observed_at":"2026-08-02T20:42:39.516267Z","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-02T20:42:39.725059Z","title":"Fu, Stefano Ermon, Atri Rudra, and Christopher Ré","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:39.725059Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:6e992c4cbf05f7e1fddc7ec8b8587b1b2318d72e2c67f245119e4586df27e89c","observation_id":"6e2644e2-bf44-4706-8c2e-b463fede8343","resolution":{"observed_at":"2026-08-02T20:42:39.725059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18965","last_updated":"2025-02-26T09:25:10Z","snapshot_observed_at":"2026-07-06T20:42:55.911327Z","submitted_at":"2025-02-26T09:25:10Z","title":"OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18965","snapshot_observed_at":"2026-08-02T20:42:40.053155Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:40.053155Z"},"links":{"cited_paper":"/paper/2502.18965","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:1a71ade0f2519228afaa7f32b777f69ab72be5b0751e3ee9b833ac68ec5133a4","observation_id":"fdc54eda-666b-4e78-8ce8-677cdee3f862","resolution":{"observed_at":"2026-08-02T20:42:40.053155Z","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-02T20:42:40.220428Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:40.220428Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:3a3ee8742c457ecfb9b7757e1841afbdd015201b5325d83f23a64bbe0aa67350","observation_id":"c858ea26-273f-402a-b46a-1ccac3d240c7","resolution":{"observed_at":"2026-08-02T20:42:40.220428Z","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-02T20:42:40.424662Z","title":"Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:40.424662Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:841453a8964205b9545d5046986a9e4e0f3e92da2cde81a0edf166a73b81cb41","observation_id":"67109333-b2d8-45ea-82ac-bfd8d3ac9a40","resolution":{"observed_at":"2026-08-02T20:42:40.424662Z","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-02T20:42:40.641210Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:40.641210Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:a2bd488a93a5302b876243724093f38fd04429f305f653b02840cd7c796818fc","observation_id":"e2528011-db16-4030-9475-80f7a625b85b","resolution":{"observed_at":"2026-08-02T20:42:40.641210Z","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-02T20:42:40.843519Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:40.843519Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:7256bbb43be6f1894a6284b85c8ee171925df22dc88e731f147cff551554c60a","observation_id":"29e97188-57f7-4636-81a3-feda13ef8cb4","resolution":{"observed_at":"2026-08-02T20:42:40.843519Z","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-02T20:42:40.990738Z","title":"2024.Flax: A neural network library and ecosystem for JAX","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:40.990738Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:22c24c5ab1d09a96e1545ea7d3ea0e1b8460f76e864c5e1524ccac3116067700","observation_id":"9a3722f3-e874-4dbe-b2c8-ddf22a9ddf7f","resolution":{"observed_at":"2026-08-02T20:42:40.990738Z","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-02T20:42:41.096660Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:41.096660Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:9e547d6b57e40ab2b22172e0afe399af2b7cfec0d550afba6bfc0f1dee8acf0f","observation_id":"725ee176-52fe-492b-9dc5-7c42120d4366","resolution":{"observed_at":"2026-08-02T20:42:41.096660Z","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-02T20:42:41.194057Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:41.194057Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:6246c4ef46a027f4afc78a33583f16c986d3b2608b9331b960a88d278c5f914d","observation_id":"69e37131-477c-42aa-82a3-7016f6e12bd4","resolution":{"observed_at":"2026-08-02T20:42:41.194057Z","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-02T20:42:41.435141Z","title":"Jouppi, Cliff Young, Nishant Patil, David A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:41.435141Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:42e6183132e150d58bf0c3e3162eb4915488f2c5d5c267454e8a32c2f6c330ac","observation_id":"831e7cb9-0d91-40fd-8481-11c6638a2fdf","resolution":{"observed_at":"2026-08-02T20:42:41.435141Z","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-02T20:42:41.539211Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:41.539211Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:a5f4574e7cbf54355be680417a47600bc5015b8b52754e75ac96c631eb35fbf8","observation_id":"720de114-1376-4bb3-a635-eddef72737c5","resolution":{"observed_at":"2026-08-02T20:42:41.539211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19786","last_updated":"2025-03-25T15:52:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-25T15:52:34Z","title":"Gemma 3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19786","snapshot_observed_at":"2026-08-02T20:42:41.661732Z","title":"Su et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:41.661732Z"},"links":{"cited_paper":"/paper/2503.19786","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:30f72406adf3606c64ca9d94bdf091b9b5dc76de30f8495163386d24b4e365d9","observation_id":"5e0606e2-6c9d-4cb2-8211-bf2cab7a0411","resolution":{"observed_at":"2026-08-02T20:42:41.661732Z","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-02T20:42:41.748200Z","title":"Bader, Aydın Buluç, Franz Franchetti, John R","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:41.748200Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:85beb2ab1940b6d958888d99ec028745b3e7766dadca6c9eaaad94a90cbccfca","observation_id":"ebc460a8-87ee-4063-aeb9-7132e8b816bc","resolution":{"observed_at":"2026-08-02T20:42:41.748200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08103","last_updated":"2024-08-05T13:08:31Z","snapshot_observed_at":"2026-08-06T03:10:01.904292Z","submitted_at":"2024-07-11T00:25:01Z","title":"Automata-based constraints for language model decoding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08103","snapshot_observed_at":"2026-08-02T20:42:41.830446Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:41.830446Z"},"links":{"cited_paper":"/paper/2407.08103","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:4e34adc42ebdbb347dbab82b972f7a03d0f75c320c0609a66806b5041ba2b6c5","observation_id":"3b04f637-935d-495b-8def-d54c7d462afc","resolution":{"observed_at":"2026-08-02T20:42:41.830446Z","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-02T20:42:41.985027Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:41.985027Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:0ad2c55cca321ee187f1f135cfba0d243f58f79eb4dc7791c46e4edbdea851cd","observation_id":"704f64d2-a12c-4a9a-af32-ac48fb54a7a0","resolution":{"observed_at":"2026-08-02T20:42:41.985027Z","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-02T20:42:42.136699Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:42.136699Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:9693de496643e2646e79f9d645babb9e722877bc0d2663b1c0092079a8636453","observation_id":"4e9e8ead-58a9-4097-a793-9b25079a6492","resolution":{"observed_at":"2026-08-02T20:42:42.136699Z","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-02T20:42:42.238178Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:42.238178Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:7934364ae73267521e7cbe4ca70efcae7561c70a66c7316c72d22e9542b0e2ee","observation_id":"f091c745-2c56-454a-883e-d2b3947bff0d","resolution":{"observed_at":"2026-08-02T20:42:42.238178Z","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-02T20:42:42.343978Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:42.343978Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:4bd79f0b7960f4041ba504d824bbdb25668888b5b96630dab396da2a17444eab","observation_id":"0acb63dd-3b87-460b-9561-0f68ba8a2230","resolution":{"observed_at":"2026-08-02T20:42:42.343978Z","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-02T20:42:42.504717Z","title":"Smith, and Yejin Choi","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:42.504717Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:d2a1a21d153f9d9192093fc5b0879cb0dfa6f2b664d1a04bafc417fa0669d50d","observation_id":"2593908b-17f0-4f2f-b53d-c1eadd72d94d","resolution":{"observed_at":"2026-08-02T20:42:42.504717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11227","last_updated":"2022-01-26T22:57:44Z","snapshot_observed_at":"2026-07-06T12:31:37.941737Z","submitted_at":"2022-01-26T22:57:44Z","title":"Synchromesh: Reliable code generation from pre-trained language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.11227","snapshot_observed_at":"2026-08-02T20:42:42.678596Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:42.678596Z"},"links":{"cited_paper":"/paper/2201.11227","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:2826a5792cae85437d2d902d958f3f7fe8b39c9fb83b3a1954eff8d7d240f5cc","observation_id":"230ed146-f51b-4271-ad5e-70417386a0ac","resolution":{"observed_at":"2026-08-02T20:42:42.678596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05065","last_updated":"2023-11-03T18:02:56Z","snapshot_observed_at":"2026-07-06T15:24:49.798924Z","submitted_at":"2023-05-08T21:48:17Z","title":"Recommender Systems with Generative Retrieval","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05065","snapshot_observed_at":"2026-08-02T20:42:42.844104Z","title":"Keshavan, Trung Hieu Vu, Lukasz Heldt, Lichan Hong, Yi Tay, Vinh Q","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:42.844104Z"},"links":{"cited_paper":"/paper/2305.05065","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:73ec3cf96cbfd4d175c1ef8fe76ab4d0a3dd05e6b3b02ae303c545a32c5ff65a","observation_id":"29616544-2490-4612-9a12-a5e7ea4ec85c","resolution":{"observed_at":"2026-08-02T20:42:42.844104Z","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-02T20:42:43.024242Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:43.024242Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:bbeafc982620bbea281c6ce9d56bbae86ff41571c14f52354268b0c7eb5d981d","observation_id":"a83dd41f-215e-4a61-86dc-ebdba787cca5","resolution":{"observed_at":"2026-08-02T20:42:43.024242Z","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-02T20:42:43.219118Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:43.219118Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:97cdce8b025b6c470a2206d7eafdc58c7b0047760fecb178671eadbd8b664cb4","observation_id":"5ef08b99-004a-4332-9f8e-523ce0d6dd37","resolution":{"observed_at":"2026-08-02T20:42:43.219118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00774","last_updated":"2024-03-31T19:09:09Z","snapshot_observed_at":"2026-08-05T23:17:26.160347Z","submitted_at":"2024-03-31T19:09:09Z","title":"SOAR: Improved Indexing for Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00774","snapshot_observed_at":"2026-08-02T20:42:43.375846Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:43.375846Z"},"links":{"cited_paper":"/paper/2404.00774","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:a1abec847d304baeff4a339df5fe1ff2217b958a2060eb32256cb10c5b661fe5","observation_id":"b61cd463-c645-4ea9-9478-d14f0d5f3f72","resolution":{"observed_at":"2026-08-02T20:42:43.375846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06991","last_updated":"2022-10-21T16:03:37Z","snapshot_observed_at":"2026-07-06T12:37:43.513161Z","submitted_at":"2022-02-14T19:12:43Z","title":"Transformer Memory as a Differentiable Search Index","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.06991","snapshot_observed_at":"2026-08-02T20:42:43.482084Z","title":"Tran, Mostafa Dehghani, Jianmo Ni, Dara Bahri, Harsh Mehta, Zhen Qin, Kai Hui, Zhe Zhao, Jai Gupta, Tal Schuster, William W","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:43.482084Z"},"links":{"cited_paper":"/paper/2202.06991","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:81c78d99bce1bff8dad1f50836eb93f7e8737d5c019350794b26846ef418256d","observation_id":"7940073a-67da-4a0b-83c7-27cdc3a2cb1d","resolution":{"observed_at":"2026-08-02T20:42:43.482084Z","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-02T20:42:43.640905Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:43.640905Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:df5677f7e504e200995e832751c648294ce5d529665916a76d1a410c42ed429d","observation_id":"e18d8979-cf8b-4d70-a356-d5cfdc9ae137","resolution":{"observed_at":"2026-08-02T20:42:43.640905Z","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-02T20:42:43.819222Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:43.819222Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:1c436bbcdbf6843f018b6d00710d506eaf63b5ed89bf9e0c74534e1a62463d41","observation_id":"ac00d3e5-6349-451c-aac4-9ec86a2cc9d9","resolution":{"observed_at":"2026-08-02T20:42:43.819222Z","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-02T20:42:43.994307Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:43.994307Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:015bef68b49acdbb1cd29d19fbf56cd3d2aae06675c16247010fa7fbc9f666b1","observation_id":"ca182872-3609-4f6f-b789-78b9777295b4","resolution":{"observed_at":"2026-08-02T20:42:43.994307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.09135","last_updated":"2025-04-12T08:49:21Z","snapshot_observed_at":"2026-08-05T07:55:32.582984Z","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-02T20:42:44.117497Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:44.117497Z"},"links":{"cited_paper":"/paper/2504.09135","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:2f424a54133cfdd21325708e6a08feab907f55851c5d2b061d73fd8f0c353478","observation_id":"f7849806-ecc5-4b6a-9d47-a8d6639e53b3","resolution":{"observed_at":"2026-08-02T20:42:44.117497Z","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-02T20:42:44.272778Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:44.272778Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:47c26884b26f5f07d9e1faed18acdb998c59affcee10edc3c4d93d55b3eba480","observation_id":"84db747b-c40b-41f5-8e03-1902279b709e","resolution":{"observed_at":"2026-08-02T20:42:44.272778Z","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-02T20:42:44.412116Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:44.412116Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:18f25624645f1e469251465e7a86b6b7cf438a72103d144eb03c72843bb40da6","observation_id":"a635377d-ee4b-4614-8763-781391683c5c","resolution":{"observed_at":"2026-08-02T20:42:44.412116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.20900","last_updated":"2025-10-28T09:32:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-08-28T15:29:51Z","title":"OneRec-V2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.20900","snapshot_observed_at":"2026-08-02T20:42:44.513735Z","title":"ConcretizationTypeError","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:44.513735Z"},"links":{"cited_paper":"/paper/2508.20900","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:97d8b192b2a05fac02466dad38ff0986c83ea7354e49fe5aa2b9c81c501ef790","observation_id":"876dfa7c-61f6-4a87-8d3a-3db53cb24f3d","resolution":{"observed_at":"2026-08-02T20:42:44.513735Z","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-02T20:42:44.668233Z","title":"\"\"Implementation of Hardware-Accelerated Constrained Decoding algorithms","venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:44.668233Z"},"links":{"citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:309e674ee7f09787c437ce8820950e2e149a601dddd7358b9fe4efd875d04429","observation_id":"d19b1876-6be0-438e-a05a-3716b4877246","resolution":{"observed_at":"2026-08-02T20:42:44.668233Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14135","last_updated":"2022-06-23T17:53:32Z","snapshot_observed_at":"2026-07-06T13:14:48.753329Z","submitted_at":"2022-05-27T17:53:09Z","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14135","snapshot_observed_at":"2026-08-02T20:42:39.854459Z","title":"https://api.semanticscholar.org/ CorpusID:249151871","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:39.854459Z"},"links":{"cited_paper":"/paper/2205.14135","citing_paper":"/paper/2602.22647"},"observation_digest":"sha256:a29321dc94cc818e5ca4678863a3901f5ca850c2c8c56089d2460dfe284a7d1a","observation_id":"c6d2a398-7827-449a-9c8d-d3ca0b736dea","resolution":{"observed_at":"2026-08-02T20:42:39.854459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.22647","last_updated":"2026-07-20T21:24:06Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-06T16:49:21.485554Z","submitted_at":"2026-02-26T06:00:56Z","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 5 inbound Pith citation observations for arXiv:2602.22647."}