{"as_of":"2026-08-19T23:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:159331319fdbf6da97b58ab22f0d7e2c2ee605e6fc1191c59e8abe22f0b35a5c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:11:33.234899Z","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-05-10T11:15:10.154966Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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-07-13T12:48:03.396039Z","title":"Efficient and asymptotically unbiased constrained decoding for large language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.03616","last_updated":"2026-04-04T07:16:28Z","snapshot_observed_at":"2026-08-14T19:57:37.924240Z","submitted_at":"2026-04-04T07:16:28Z","title":"The Format Tax","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-13T12:48:03.396039Z"},"links":{"cited_paper":"/paper/2504.09135","citing_paper":"/paper/2604.03616"},"observation_digest":"sha256:30bd7890a23c798825d8acfb2124e8ac0116ba231e3b04c0a0f70ee6064bb6a8","observation_id":"33cd19a7-2567-49ff-a6a8-6f570a5b89c8","resolution":{"observed_at":"2026-07-13T12:48:03.396039Z","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":"2504.09135","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.09135","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c4d181ee-283d-4963-ade6-bff8d5e8a282","year":2025},"citing_paper":{"arxiv_id":"2604.14862","last_updated":"2026-04-28T09:45:16Z","snapshot_observed_at":"2026-08-14T02:16:07.929364Z","submitted_at":"2026-04-16T10:52:50Z","title":"Schema Key Wording as an Instruction Channel in Structured Generation under Constrained Decoding","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-10T11:14:29.764233Z"},"links":{"cited_paper":"/paper/2504.09135","citing_paper":"/paper/2604.14862"},"observation_digest":"sha256:f2a3fe7ca030d4b26a2ce730c350c8006fee54ef67b1168879d8178d154c7b52","observation_id":"f7f4741c-5d46-48c2-8789-a590bcd5b527","resolution":{"observed_at":"2026-05-10T11:15:10.157707Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.09135","last_updated":"2025-04-12T08:49:21Z","snapshot_observed_at":"2026-08-19T23:26:02.288038Z","submitted_at":"2025-04-12T08:49:21Z","title":"Efficient and Asymptotically Unbiased Constrained Decoding for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.09135","snapshot_observed_at":"2026-08-16T00:11:33.234899Z","title":"arXiv preprint arXiv:2504.09135 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12574","last_updated":"2026-08-12T20:38:51Z","snapshot_observed_at":"2026-08-19T12:27:59.394357Z","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T00:11:33.234899Z"},"links":{"cited_paper":"/paper/2504.09135","citing_paper":"/paper/2608.12574"},"observation_digest":"sha256:4fe39ff3f1462a97cfd4da92879b16091d8634f98ffe8303865338609ab86813","observation_id":"4cfeabbd-18a1-47bf-ba1c-426aa3eae787","resolution":{"observed_at":"2026-08-16T00:11:33.234899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.09135/citation-record","integrity":"/paper/2504.09135/integrity","json":"/paper/2504.09135/citation-record.json","paper":"/paper/2504.09135"},"outbound":[],"paper":{"arxiv_id":"2504.09135","last_updated":"2025-04-12T08:49:21Z","latest_version":1,"primary_category":"cs.CL","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2504.09135."}