{"as_of":"2026-08-24T00:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d80581d508c93f119913ee37a8d85a992061ca982bfa58f5dba5da94b859dbf9","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-23T06:30:58.430688+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-19T23:09:08.129185Z","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-17T14:25:41.386755Z","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:7787334916ddd71c152d0bf2c03f8d001f280edb577c6d7fe9c7f12031d2765e","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-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-19T23:09:08.129185Z","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:df6937db7ed4a2c1e25a02d2b109358d1bd6734590bbdf4970fe7feb42241634","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-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-19T23:09:08.129185Z","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-08-17T07:19:38.733584Z","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:88535d41558b232d02b4d6e978ab2d326ea2660e1cd786ae7737fa72e2b5b8df","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-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-19T23:09:08.129185Z","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-19T17:11:46.742661Z","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:d776d4cc07a43307f9f00ba70de0af740486aca9f5795cc3f0861e670f486b9e","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-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-19T23:09:08.129185Z","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-15T05:30:43.808397Z","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:6a32c179893359740bee4dd8d87efd96f8110cbefb113b867b45405dc087a933","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-19T23:09:08.129185Z","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:b43aecf70e6d25271dc155dd28589e4380bf5b9d80b26088822e2c6bec441c87","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-19T23:09:08.129185Z","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:76d922a71b22b49c4adb3de87d7d027cfce9e2255d4954e42b3a4bd4ad268096","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-19T23:09:08.129185Z","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:cdfe8d4bee4fa59231818df4ffd881e2979bdf283759ca15a4cebc3005240110","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-19T23:09:08.129185Z","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:273bbda88b2681a48b288fe94081d2492c28af63d980bcea2e8457b7277ef5c7","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-08-11T02:18:35.186995Z","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-19T23:09:08.129185Z","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:fe5279c183e86e6ede6e842f40f4019211c100958b6ea38a7ee36fd99a7f703c","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-19T23:09:08.129185Z","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:20bc7dff3f6eda4287232c45a2b70e8c45239b7f5b7f9f086ef58e1596591b9a","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-19T23:09:08.129185Z","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:9a8c273b48af0ac9f385f467f3b3f7c14b5a38bdfa9ee10882741f4342177ab5","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-19T23:09:08.129185Z","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:10cb1c09a77dd8299df1cbfdbceff6d0ea90b2a23e7eebe6be1b8a948b07ee4f","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-19T23:09:08.129185Z","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:f95d430bbacc9b2ec54fa089bc666dd897b6a06d146692ae61b0ded8919b7c40","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-19T23:09:08.129185Z","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:d3425805f230ff69e9628e419884cd90defca3b8c0d33383a3d348aa3cf569d0","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-19T23:09:08.129185Z","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:740873cb98e02b806eb9c9f0adfc8678192f9eccade1356be2a31a1ddf4d7e3f","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-19T23:09:08.129185Z","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:e9f93442a1494985accc188a9f5cb8d72b75f0a0c8e987a587f681a51107b883","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-19T23:09:08.129185Z","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:0828c1828646378bd2379081a4e3064dbfc2a357a48997148dfef94aa2621860","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-19T23:09:08.129185Z","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:bc7b56384ef5a668156d5ae256130ceee919762b4607e77e2b09b838a4469121","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-19T23:09:08.129185Z","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:7bf8ea4a5eb71c871488e3f34e2794bfeb344e0956b68230d48d6af21afa9215","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-19T23:09:08.129185Z","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:cb8ae4352f895517be02ded0bc29b8466f04dba63831adb9a4d1fb6cdc2c1a49","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-16T13:35:15.422573Z","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-19T23:09:08.129185Z","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:770c5df7c8a9d88cd00f657435cd82aa9c9944e66892dfcff8ce762a1fe44665","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-19T23:09:08.129185Z","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:00621ba4944a3d0ea3491822ebf180cb32f6cf77c077988d5d7d53aec5b90025","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-19T23:09:08.129185Z","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:a3a254bdc76bc1619a197a31f34f441456aec478f496b48538633bde77292ab3","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-19T23:09:08.129185Z","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:4bacf40e16acb210cc03799a8e8988190700636ec7496171164598c6062b897d","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-19T23:09:08.129185Z","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:a17af86564bc4c0a67d5ad86e8c0b8f020c8fb5f231b526b0ca47eefafc4cdee","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-19T23:09:08.129185Z","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:fa835c0417cac8848652221c5a5f7fcd1eaeed78344f04bc40a5bd814e8d39b6","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-08-22T04:39:31.997757Z","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-19T23:09:08.129185Z","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:c6ce83ae964f54b3f6dfb001031f151e336ea5d657133ed4718a38a7d50dcafb","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-08-20T05:54:51.765124Z","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-19T23:09:08.129185Z","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:4cdf1b0c53fe08c8c857df0f73e788ce9ba4e98c88a5859c6650d38c659fd8d3","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-19T23:09:08.129185Z","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:3b10125fff72f7711691de8e9fe47add19b72ad3262aed4997cd62f06a398987","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-19T23:09:08.129185Z","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:0b39eab7fd533528962042dcf260d49d263d58b147d69395178008b7f0cd4508","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-18T10:41:01.297571Z","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-19T23:09:08.129185Z","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:67a03ac93e85b7bc9195ef5e7cb5e4ec2f8cef6e99f07ed037550ce2248a3682","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-08-19T19:18:32.205073Z","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-19T23:09:08.129185Z","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:5b6a982704ccd947d7e88f3ec985a9beee31a668d57264d1293e6d005b479587","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-19T23:09:08.129185Z","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:e971ab9fcf4d8824435c2467f4a725ebab391bd118ac454f0670c47a1b766064","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-19T23:09:08.129185Z","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:b715d76a3d799f3654bf6825a332486395d63f1ad1296c760457140793c2ca70","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-19T23:09:08.129185Z","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:39671f919d3c0827d4916b86b98c3f29ee66e68bd6087b27ae085458d40d2253","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-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-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-19T23:09:08.129185Z","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:586a389154c4a4d550f337f8a1ecd607c49d4800ad7662402a3eacab6fe39693","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-19T23:09:08.129185Z","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:50406f232c1a91f53cc32f8ff26befa88370ccdd715f2bcb15dc3a32306cbf33","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-19T23:09:08.129185Z","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:e04e5ce450dc4b0235b7aefba5e0d71c3f5144de592917e2587438c5931d0777","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-08-16T16:15:56.566906Z","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-19T23:09:08.129185Z","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:c2f3366747092d3449acaf249c2e749d01dd7a316e8f2130107d5b3154025af0","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-19T23:09:08.129185Z","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:633e4ab569ba4f7e73af0fe7dbde71fd83cb33daf7e32c9219bdd5ed5bd1fd63","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-19T23:09:08.129185Z","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:ab55e8250b883d1e796ff821ff9a63e01e4d0658c309853eaf6ba47d4ac66a3c","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-19T23:09:08.129185Z","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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 5 inbound Pith citation observations for arXiv:2602.22647."}