{"as_of":"2026-08-09T17:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04ef0ade0562854fea08a6bee6b5da41c98c5ac4ead3a72736ef3af054b0db45","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:19:02.636657Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T12:54:11.083809Z","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-01T23:26:22.261385Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-08-04T12:54:11.083809Z","title":"Flexible and efficient grammar-constrained decoding, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.01902","last_updated":"2026-06-02T22:25:04Z","snapshot_observed_at":"2026-08-06T07:27:34.470295Z","submitted_at":"2025-10-02T11:17:26Z","title":"Constrained Adaptive Rejection Sampling","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T12:54:11.083809Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2510.01902"},"observation_digest":"sha256:d17a5267bc68df0c16e86535267e790b610ef0e4195d181b4445f4a003c93e5a","observation_id":"c718e42a-93be-4261-81c1-93f52321a0d6","resolution":{"observed_at":"2026-08-04T12:54:11.083809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":"2502.05111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-07-01T23:26:22.261385Z","title":"Flexible and efficient grammar-constrained decoding","venue":null,"work_id":"77002bbb-fb88-4df7-824c-9211395c9877","year":2025},"citing_paper":{"arxiv_id":"2510.14703","last_updated":"2026-04-28T18:17:43Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-16T14:06:03Z","title":"ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-18T06:30:39.858246Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2510.14703"},"observation_digest":"sha256:186730e98a76320ec23b89b3cc1f81261dbc2a9cf92f73d3adfc6702c544e569","observation_id":"620a79d0-3782-4070-8660-1611bd50fb8f","resolution":{"observed_at":"2026-05-18T06:30:59.630686Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-08-02T23:53:40.966468Z","title":"Parys, P., Vaidya, S., Berg-Kirkpatrick, T., and D’Antoni, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12468","last_updated":"2026-05-27T11:13:24Z","snapshot_observed_at":"2026-08-06T18:29:14.202638Z","submitted_at":"2026-02-12T22:55:05Z","title":"Continuous Diffusion Models Can Obey Formal Syntax","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T23:53:40.966468Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2602.12468"},"observation_digest":"sha256:e31e2c40629010f57688bcf88886c29d0b0398712a98728c9486be75d717f715","observation_id":"ab117f3b-9595-421d-ba66-e5672ccea6d9","resolution":{"observed_at":"2026-08-02T23:53:40.966468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-08-03T03:32:47.667665Z","title":"Accessed: 2024-08-24","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.03305","last_updated":"2026-06-27T21:00:11Z","snapshot_observed_at":"2026-08-06T02:48:55.646473Z","submitted_at":"2026-02-08T03:52:24Z","title":"The Hidden Cost of Structured Generation in LLMs: Draft-Conditioned Constrained Decoding","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T03:32:47.667665Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2603.03305"},"observation_digest":"sha256:4aa59884b0038b051c65b096bd9538a7797335f386de23b69e67dae8000fe1f0","observation_id":"7b39e6a1-9572-4221-81bd-c837bc0f82ba","resolution":{"observed_at":"2026-08-03T03:32:47.667665Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-07-13T12:48:03.396039Z","title":"Flexible and efficient grammar-constrained decoding, 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-06T04:43:40.860475Z","submitted_at":"2026-04-04T07:16:28Z","title":"The Format Tax","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-13T12:48:03.396039Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2604.03616"},"observation_digest":"sha256:5827010b862726edf8a10fae3a8e1d216c6c338834b18ab8fe75b1d4dc855903","observation_id":"cac14163-839b-491d-b7f9-f24997b543e4","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":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-07-13T10:39:48.868810Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.04233","last_updated":"2026-04-05T19:30:54Z","snapshot_observed_at":"2026-08-08T05:22:45.302098Z","submitted_at":"2026-04-05T19:30:54Z","title":"Precise Robot Command Understanding Using Grammar-Constrained Large Language Models","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-13T10:39:48.868810Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2604.04233"},"observation_digest":"sha256:ae2539fa2f2f260869decb860c451b18f47e61a376d7d821829f17e04b0950db","observation_id":"157dc8d6-5cb7-4b0a-a04f-04ca2fc658d6","resolution":{"observed_at":"2026-07-13T10:39:48.868810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":"2502.05111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-07-01T23:26:22.261385Z","title":"Flexible and efficient grammar-constrained decoding","venue":null,"work_id":"77002bbb-fb88-4df7-824c-9211395c9877","year":2025},"citing_paper":{"arxiv_id":"2604.14862","last_updated":"2026-04-28T09:45:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","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":13,"source":"arxiv_source","source_observed_at":"2026-05-10T11:14:29.764233Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2604.14862"},"observation_digest":"sha256:41f4c04ea2b3adca9d60f2a4efb00c29c9d729d3137e2d1972cc4c539a405bdc","observation_id":"0cfaee25-be1f-4c8c-9e6b-c16da6200953","resolution":{"observed_at":"2026-05-10T11:15:10.105781Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":"2502.05111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-07-01T23:26:22.261385Z","title":"Flexible and efficient grammar-constrained decoding","venue":null,"work_id":"77002bbb-fb88-4df7-824c-9211395c9877","year":2025},"citing_paper":{"arxiv_id":"2605.10065","last_updated":"2026-05-11T06:43:42Z","snapshot_observed_at":"2026-08-02T14:40:23.904242Z","submitted_at":"2026-05-11T06:43:42Z","title":"NCO: A Versatile Plug-in for Handling Negative Constraints in Decoding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-12T05:08:07.862797Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2605.10065"},"observation_digest":"sha256:97c537f6010d419f28100bdeacaf238523f96c576cb3a0da002be2db23cfe071","observation_id":"c06bb22d-c89d-4b58-800e-ed37235b49bf","resolution":{"observed_at":"2026-05-12T05:36:25.901939Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":"2502.05111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-07-01T23:26:22.261385Z","title":"Flexible and efficient grammar-constrained decoding","venue":null,"work_id":"77002bbb-fb88-4df7-824c-9211395c9877","year":2025},"citing_paper":{"arxiv_id":"2606.01926","last_updated":"2026-06-01T08:58:18Z","snapshot_observed_at":"2026-07-06T23:42:26.018647Z","submitted_at":"2026-06-01T08:58:18Z","title":"Mitigating Bias in Locally Constrained Decoding via Tractable Proposals","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-28T14:24:26.463636Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2606.01926"},"observation_digest":"sha256:1d3fc5012162e2c751a8b5fd950700a9a8fc7f105673cf1ef35a91c5f0bd5cf1","observation_id":"915b224d-ba85-456a-866f-f6a1973d0fc8","resolution":{"observed_at":"2026-07-01T23:26:22.263862Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":"2502.05111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-07-01T23:26:22.261385Z","title":"Flexible and efficient grammar-constrained decoding","venue":null,"work_id":"77002bbb-fb88-4df7-824c-9211395c9877","year":2025},"citing_paper":{"arxiv_id":"2606.31808","last_updated":"2026-06-30T15:25:10Z","snapshot_observed_at":"2026-07-07T00:05:27.130060Z","submitted_at":"2026-06-30T15:25:10Z","title":"Large Databases Need Small, Open-Weight Language Models","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-01T05:29:08.391011Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2606.31808"},"observation_digest":"sha256:30f1abc4afa4139a44e967c27e18db20b30f6d38a2a6be6ff8f1375e5fa08a9d","observation_id":"eb92e6e9-7b3c-4637-9d86-678896d84d58","resolution":{"observed_at":"2026-07-01T10:25:42.228263Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-07-31T22:03:24.575090Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T22:03:24.575090Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:756c06cb6ebe599c15296c81ec898dea46a81191be83fcc10e58e64482180c7f","observation_id":"8c0f0c7b-612c-4fcb-a1e5-0730086dcf4a","resolution":{"observed_at":"2026-07-31T22:03:24.575090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-08-04T03:23:27.871067Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.871067Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:e39e506dd8a81ef070a83d537ff88288cf999c0bc33307426dce2937a23067cd","observation_id":"470aa6df-73d9-4478-9ce1-bd98a0ce08b9","resolution":{"observed_at":"2026-08-04T03:23:27.871067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05111/citation-record","integrity":"/paper/2502.05111/integrity","json":"/paper/2502.05111/citation-record.json","paper":"/paper/2502.05111"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.520046Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.520046Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:96400d35aa7fcb7704174a7955ebc5ceff526a37d693110d1ea30c24c0806cc1","observation_id":"46f0908c-b87f-4a51-bf33-66be1f9bcafb","resolution":{"observed_at":"2026-08-08T20:19:02.520046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:03.085634Z","title":"and Riley, M","venue":null,"work_id":"8e7f13b0-9e0f-4af2-a7db-e49c2ad4e37a","year":2012},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.526475Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:ef421564d153dc21f07d8670eec1f6133cd8dd886d2dd0bae0a32dd8949c6f1c","observation_id":"c15ec3e3-29a2-40f2-bc18-0450f8c4a910","resolution":{"observed_at":"2026-08-08T20:19:03.090349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:03.070223Z","title":"Sygus-comp 2018: Results and analysis, 2019","venue":null,"work_id":"832db3c8-453c-4566-9347-c16d44a21f0a","year":2018},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.531497Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:937110ed475e1d5107287102cf0a526fc1232becd5ff8567a2d6849d7c39ecfd","observation_id":"bf3da5fe-f577-4c2a-8aa5-4896809a6450","resolution":{"observed_at":"2026-08-08T20:19:03.075020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-08-08T20:19:02.536453Z","title":"Crane: Reasoning with constrained llm generation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.536453Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:5acb30b42af0a093cd3e6d99245aabbb4697d51d19ccd38ca8014000f26a715d","observation_id":"822a441b-a668-4088-b8e8-436f1fab345f","resolution":{"observed_at":"2026-08-08T20:19:02.536453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:03.054924Z","title":"Guiding llms the right way: fast, non-invasive constrained generation","venue":null,"work_id":"7582f109-c81d-40e5-bc25-3cc64fa9e6de","year":2024},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.542249Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:d1b49f034690ab621f6e35f2a12dfeee8f151a7ba4ab29e52785b9b06df7a9b6","observation_id":"97681121-c1af-451e-8fb7-0e61ff706f8d","resolution":{"observed_at":"2026-08-08T20:19:03.060027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.547164Z","title":"A general-purpose algorithm for constrained sequential inference","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.547164Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:1ed8c149464f86cc59fa58dc523d07f007341f30e13076f4c19e90c7c8994a57","observation_id":"8a5d2f99-8727-47f4-bf03-a3e6b511d544","resolution":{"observed_at":"2026-08-08T20:19:02.547164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15100","last_updated":"2025-05-12T08:20:08Z","snapshot_observed_at":"2026-08-09T13:29:46.793020Z","submitted_at":"2024-11-22T18:01:37Z","title":"XGrammar: Flexible and Efficient Structured Generation Engine for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15100","snapshot_observed_at":"2026-08-08T20:19:02.551893Z","title":"F., Cai, Y., Lai, R., Xu, Z., Zhao, Y., and Chen, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.551893Z"},"links":{"cited_paper":"/paper/2411.15100","citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:44603baa00f634e3ac338fa903a9ea44562067a9a8a1c1c3aee64504184de1a9","observation_id":"14002fbe-a86c-417c-9b29-99dff46cd2d9","resolution":{"observed_at":"2026-08-08T20:19:02.551893Z","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-08T20:19:02.557505Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.557505Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:6f75828e861cd1cd313c4f8a33c649abd139afd584e2fb570cca8edcb96c4015","observation_id":"1a85179f-5ab7-466d-8c46-66353417d28a","resolution":{"observed_at":"2026-08-08T20:19:02.557505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:03.029601Z","title":"Grammar-constrained decoding for structured NLP tasks without finetuning","venue":null,"work_id":"65349f3a-3ea6-46c1-a73c-85425c2658d7","year":2023},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.562338Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:2f6dc0ce166b9333480f9053b38b217cdd468c6e71554fb5f8383fa145bdaa2d","observation_id":"f8d8fc40-488f-4c03-95dc-89bf6294b111","resolution":{"observed_at":"2026-08-08T20:19:03.034567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.10868","last_updated":"2025-02-27T15:37:21Z","snapshot_observed_at":"2026-08-08T02:26:20.015042Z","submitted_at":"2025-01-18T20:26:00Z","title":"JSONSchemaBench: A Rigorous Benchmark of Structured Outputs for Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.10868","snapshot_observed_at":"2026-08-08T20:19:02.567124Z","title":"Jsonschemabench: A rigorous benchmark of structured outputs for language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.567124Z"},"links":{"cited_paper":"/paper/2501.10868","citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:f480a65c547e71442b9df961bccfa9f3c76e487ed6cb580df49a666832c55107","observation_id":"633ab7cc-80d3-483b-b1cb-0b089fcc245c","resolution":{"observed_at":"2026-08-08T20:19:02.567124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:03.013946Z","title":"llama.cpp, 2024","venue":null,"work_id":"b7b19c60-7dc2-4dd6-9dd5-19e1f5d77693","year":2024},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.572309Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:bdacc92b3d12fe68db76275ae87dec4c0bd881d3b3138257c9fe8dd017f88ce7","observation_id":"8ea8a163-37d2-496a-9b3f-88917507444f","resolution":{"observed_at":"2026-08-08T20:19:03.018894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.996049Z","title":null,"venue":null,"work_id":"df31c946-045a-4153-9b2f-81355e134310","year":1965},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.576986Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:6590d84b76a5e23feb72b93caeeecd538779c01e4e151a88bd4892ac088fc3a4","observation_id":"5459ad0e-a4ab-4bab-8d93-bedc1def2725","resolution":{"observed_at":"2026-08-08T20:19:03.000716Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.981616Z","title":"Automata-based constraints for language model decoding","venue":null,"work_id":"180ca162-0966-4612-b0e1-a0f333625247","year":2024},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.581871Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:5f8249021487f9d6ee09bc5185e28c3a06f2665410278253b7497fd532861186","observation_id":"b943ef0f-0518-4af3-a839-95cb63c34104","resolution":{"observed_at":"2026-08-08T20:19:02.986310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.966561Z","title":null,"venue":null,"work_id":"8bba4c37-737c-495c-82cf-56bfc2d1b5fe","year":null},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.586582Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:07daea2de2f9ef039f93404266df96208eab0d3c89cee72090eee06e1a9abd0e","observation_id":"e70e98d5-ff92-494c-8cd5-a8c895645159","resolution":{"observed_at":"2026-08-08T20:19:02.971284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.951109Z","title":"and Yamada, H","venue":null,"work_id":"34c5a487-450a-4a74-981f-f6049428c318","year":1960},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.591474Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:a7c9cd13a11f792370f3144a9aa2154402ba6f6d6b72b1b1532028b30bf9bf48","observation_id":"13f39f15-d696-4d25-8318-5b4d3ad8926f","resolution":{"observed_at":"2026-08-08T20:19:02.955855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.935600Z","title":"guidance-ai/llguidance","venue":null,"work_id":"09a7ae85-5c55-4c4c-9de6-3b0474a29101","year":2025},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.596188Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:5890f6eb70e937f464b7dde804b7ec7a90914b0a4706686d82ac14357672aafa","observation_id":"8bc6773a-d8fe-4718-8332-a006b530aa97","resolution":{"observed_at":"2026-08-08T20:19:02.940903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.919507Z","title":"Grammar-aligned decoding","venue":null,"work_id":"d32ea2b7-a115-412c-bfc5-7dc88c2db46a","year":2024},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.600660Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:c008d5ea107a00bd94d77bd1a7d1d54876ed74ab3288ebde40ab1b5b07a1329c","observation_id":"61095006-9ae3-4a40-a688-2d95166ed4a6","resolution":{"observed_at":"2026-08-08T20:19:02.924124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.903333Z","title":"Synchromesh: Reliable code generation from pre-trained language models","venue":null,"work_id":"436748bb-c63c-41ab-962d-997bd8c84620","year":2022},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.604907Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:d2db4dd83306cfaf94bc21c77b3fa1efb398a15180d99af5ccb486f156058c4b","observation_id":"76708671-754d-4766-9326-0a60fe67297e","resolution":{"observed_at":"2026-08-08T20:19:02.908296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.888106Z","title":null,"venue":null,"work_id":"4707612d-7891-4c8e-b9f8-3229f1307bb9","year":1963},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.609337Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:2c7e06433e4da78b40ce0c9fa546fcf63877ad9a96fcc0d4a747ed8610b79cf0","observation_id":"7fdd0418-35ba-4917-a8e9-b01fea113693","resolution":{"observed_at":"2026-08-08T20:19:02.893009Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.872519Z","title":"lark-parser/lark","venue":null,"work_id":"287f81c1-4d03-4ec0-a714-6a53929a96df","year":null},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.613777Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:e46c9c1999733e1b716f3ae11dfa02f5b6e8e63788df6341fbffef7108274e8a","observation_id":"71a301e6-0007-42bb-94c5-3e5582b3a56e","resolution":{"observed_at":"2026-08-08T20:19:02.877508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.618787Z","title":"R., Wu, C.-K., Tsai, Y.-L., Lin, C.-Y., Lee, H.-y., and Chen, Y.-N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.618787Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:28bc5450a99249bb7d34a95374635f29e071e0aa22866bbf2b8a759771e4700f","observation_id":"de984b37-5bb5-4616-9914-dba7190d65e3","resolution":{"observed_at":"2026-08-08T20:19:02.618787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01632","last_updated":"2024-11-06T18:04:35Z","snapshot_observed_at":"2026-08-04T17:38:49.392434Z","submitted_at":"2024-03-03T22:38:35Z","title":"SynCode: LLM Generation with Grammar Augmentation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01632","snapshot_observed_at":"2026-08-08T20:19:02.623487Z","title":"Syncode: Llm generation with grammar augmentation, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.623487Z"},"links":{"cited_paper":"/paper/2403.01632","citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:1ac0a1c4bbc418db77038a2607e1d166ea681d82e2ab29b67bda704c6099b8e8","observation_id":"d3b2612d-8bf1-45e4-8354-288dad8e935b","resolution":{"observed_at":"2026-08-08T20:19:02.623487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.856982Z","title":"Grammar prompting for domain-specific language generation with large language models","venue":null,"work_id":"b8d21d25-1f09-465e-937b-1454dcdc01f1","year":2024},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.631934Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:f02e67064c29dd2ffb5c1ba0311bfa9dcd317600b749f24df4202c7fff5ee3b4","observation_id":"e78448f9-76d6-449c-801c-a4ed20307479","resolution":{"observed_at":"2026-08-08T20:19:02.862666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:19:02.840720Z","title":null,"venue":null,"work_id":"7836e4f4-b838-4bdc-a788-f39c8bc4383e","year":2023},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.636657Z"},"links":{"citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:8f9e183c9f73af54e52018b18c90b74ab8435310a182ce94742ec161176f10c9","observation_id":"156681f4-a60e-4fdc-916d-49038b4e4e47","resolution":{"observed_at":"2026-08-08T20:19:02.846364Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":24},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 12 inbound Pith citation observations for arXiv:2502.05111."}