{"as_of":"2026-08-24T00:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:40277ba5f2dcfd4e3e884fa28f0530f5ec1d59f13d2ac07b5a224c48226a72b4","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:06:44.824746Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.03065/citation-record","integrity":"/paper/2608.03065/integrity","json":"/paper/2608.03065/citation-record.json","paper":"/paper/2608.03065"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.803059Z","title":"Lark - Parsing Library & Toolkit","venue":null,"work_id":"164a69cc-9768-477d-89d7-9133179d2699","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.583165Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:513542863e28a7df05749bbd2114fc57579b4b58c9384410e4497e0b6a5c27f9","observation_id":"e1a6dc57-7f70-4cc6-af49-4598c9e27034","resolution":{"observed_at":"2026-08-15T15:06:45.810275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.782091Z","title":"d.].Llama.Cpp: LLM Inference in C/C++","venue":null,"work_id":"6edca2bb-ee29-4bae-8ea3-90b04dee24fe","year":null},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.589176Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:3c845853f39cb24411bf33b53225ccb52497c2ce61acba698f2bfe1a4328eb91","observation_id":"44e26674-0d8c-4004-9b36-da0678270f60","resolution":{"observed_at":"2026-08-15T15:06:45.790013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.761826Z","title":"d.].MaskBench","venue":null,"work_id":"e428848a-4e4f-4fc4-91e1-96857566c2c6","year":null},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.595209Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:41f573d4f428f97f9a489feb0554478d8fc94c33427e59c3cfdbdbbdc9d050b9","observation_id":"8710386a-056b-4012-a848-ca43ddea5b3c","resolution":{"observed_at":"2026-08-15T15:06:45.767413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.744773Z","title":"Aho and Jeffrey D","venue":null,"work_id":"b79b86cb-123b-4bb7-9c23-4cc238dd119b","year":1972},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.600730Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:f9787c9c0404fde5039491837268834fe24ae4b0707d62cb839c4a65543dd932","observation_id":"ef2e7241-b412-45d8-9acc-5728f3ad4ca4","resolution":{"observed_at":"2026-08-15T15:06:45.750618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.728187Z","title":null,"venue":null,"work_id":"19583b2b-9742-4fca-af80-1985a5723bcb","year":null},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.605907Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:21c78debe97d10366790f55364b648fca0e32f220c24d74d2949a72369ca2d5a","observation_id":"78f05ac1-ade0-43d6-a132-28d420337817","resolution":{"observed_at":"2026-08-15T15:06:45.733480Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2210.14868","last_updated":"2023-03-28T19:02:34Z","snapshot_observed_at":"2026-08-16T16:20:54.275993Z","submitted_at":"2022-10-26T17:17:06Z","title":"Multi-lingual Evaluation of Code Generation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.14868","snapshot_observed_at":"2026-08-15T15:06:44.611094Z","title":"2023.Multi-Lingual Evaluation of Code Generation Models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.611094Z"},"links":{"cited_paper":"/paper/2210.14868","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:1428fe58fb908bf579317f890e4d757b724d0e45462c259b766e94beef37babf","observation_id":"d604f600-da62-41c1-b6ab-1a998ce71052","resolution":{"observed_at":"2026-08-15T15:06:44.611094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-15T15:06:44.616803Z","title":"2021.Program Synthesis with Large Language Models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.616803Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:b4b041596bb8e91817ecb6a14b127ffeb9eac46d9e95f56517e9a886b57eb18f","observation_id":"decc45b4-81d1-45c9-a09d-ef7417f036df","resolution":{"observed_at":"2026-08-15T15:06:44.616803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-08-20T15:31:01.041088Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-15T15:06:44.622387Z","title":"2023.Qwen Technical Report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.622387Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:af52be9578cf11435257d62999d1ee04c0571946484ebdeda434e2eab6e80a81","observation_id":"5b89d5b2-7e7f-4426-8f39-50350f03f8fc","resolution":{"observed_at":"2026-08-15T15:06:44.622387Z","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-15T15:06:45.709335Z","title":null,"venue":null,"work_id":"89edcbbd-71d1-44db-802b-ca70564c646d","year":2024},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.627920Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:1613c5e5c50dad7c2cb5f06c355e460ab51d3fa1197204679a5879d8523aba64","observation_id":"6eb055a0-fa77-4bcd-9611-0095d3cdf8e4","resolution":{"observed_at":"2026-08-15T15:06:45.714962Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/321239","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.037144Z","title":"Brzozowski","venue":null,"work_id":"67be0e26-7e82-45b0-b411-4e55bda9bfb5","year":1964},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.633462Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:d94a407b38e34fb2cc4bfc6a17013192ad2f36517e28f6d1a027b81055e0b88d","observation_id":"e4974c58-6177-4228-b326-30bc6d671e3b","resolution":{"observed_at":"2026-08-15T15:06:45.043581Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:44.638448Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.638448Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:d62cfc7ff941844f95347e295c4109da3a3638601ee10d29632efbb5fa18f4b3","observation_id":"9d3d925d-14a8-49b4-8d66-fc38e53086e6","resolution":{"observed_at":"2026-08-15T15:06:44.638448Z","resolver_source":null,"status":"malformed_identifier"},"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-15T15:06:45.692493Z","title":null,"venue":null,"work_id":"b75acd74-51f9-4356-801c-019157c3a0d4","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.643962Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:6d584c9ce6edad5fc97ccb92c26ed27d83cd59ef4a075a63bea01c09dfd2617b","observation_id":"5bfe883d-3f3d-4934-83fd-ba1291d31511","resolution":{"observed_at":"2026-08-15T15:06:45.698052Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2025.acl-long.551","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.672995Z","title":null,"venue":null,"work_id":"ba77f639-a25d-43f0-a970-434d50970605","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.649240Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:404866b41f5fb93426c52173c527f4232af6b9beaef613a1b749923a1e3500dc","observation_id":"90ade810-67b5-4725-8ffc-32285755f38f","resolution":{"observed_at":"2026-08-15T15:06:45.678402Z","resolver_source":"doi","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":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-20T20:50:23.483838Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-15T15:06:44.654183Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.654183Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:5b7aae075b89845fbb772e0dc8cfcddfff421b89ca719270546c791cf358d443","observation_id":"8ce03d39-0bcd-4f8a-838f-e434e3ec218f","resolution":{"observed_at":"2026-08-15T15:06:44.654183Z","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-15T15:06:44.659332Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.659332Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:bb1c313cbdc89b6dac1f8af54e6ea547f9dbded68a8f1452debea33793b129ba","observation_id":"b557d060-5355-4e7f-87df-926a8961bf15","resolution":{"observed_at":"2026-08-15T15:06:44.659332Z","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-15T15:06:45.655668Z","title":"Ruan, Yaxing Cai, Ziyi Xu, Yilong Zhao, Ruihang Lai, and Tianqi Chen","venue":null,"work_id":"7d58cec2-8a8e-42ed-9180-1e6bd8211adf","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.664375Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:51ea85ee7387a197fbcabb97518389f1a6c19618ef51ddf1f4996cd827481312","observation_id":"2eb4a446-7cb6-41da-93fe-a7a1ade5910b","resolution":{"observed_at":"2026-08-15T15:06:45.660582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:44.669100Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.669100Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:d16d8105b0a45e654ce4ca4944f4c7d5d21758ef7684011107a551bc7d4d6ae0","observation_id":"72b46f56-734f-4cfe-ac27-e5a2e354591a","resolution":{"observed_at":"2026-08-15T15:06:44.669100Z","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-15T15:06:45.639895Z","title":null,"venue":null,"work_id":"616d06c0-dfb1-4af4-b27c-7e3aaafae71c","year":1994},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.674693Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:722f2302e39659d92d13c575f34dfe15b095d8d87ebbae2b8893e52f407d18e6","observation_id":"f89ac649-f6cf-41a6-95da-c7a03a38d59f","resolution":{"observed_at":"2026-08-15T15:06:45.644910Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"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-15T15:06:44.680778Z","title":"Choquette-Choo, C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.680778Z"},"links":{"cited_paper":"/paper/2503.19786","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:d3057f79cf61027df33bc64d3f5c0f495f6268f3c324ddf9c9e9634e561dcfb6","observation_id":"78a3bcc5-c442-42c9-b3ab-27a454b97895","resolution":{"observed_at":"2026-08-15T15:06:44.680778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.10868","last_updated":"2025-02-27T15:37:21Z","snapshot_observed_at":"2026-08-15T03:30:22.750526Z","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-15T15:06:44.687561Z","title":"2025.JSONSchemaBench: A Rigorous Benchmark of Structured Outputs for Language Models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.687561Z"},"links":{"cited_paper":"/paper/2501.10868","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:a363944d4288d43c16ac7476d2026f83f6ecc7b94b7fc9ac1f58520f95620ccd","observation_id":"4baebed0-5cad-4e47-a608-04958ab1975d","resolution":{"observed_at":"2026-08-15T15:06:44.687561Z","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-15T15:06:44.693163Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.693163Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:0b0af095cc0fa082c785596cde58cb0d34b529d17d894f9c0680d5d94a5a7c07","observation_id":"0d7f1868-2713-4747-929b-d83e74e39573","resolution":{"observed_at":"2026-08-15T15:06:44.693163Z","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-15T15:06:45.623513Z","title":"2021.GitHub Copilot·Your AI Pair Programmer","venue":null,"work_id":"85b3a0ee-acc6-4044-abc9-cc95268ce4c4","year":2021},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.697980Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:1926be0b7d4e37a0b8c79fd81c93d8b487c88c78830e4adcde17b3efe2c50858","observation_id":"a3f476fc-5c14-49fa-9544-78c5f6070b6f","resolution":{"observed_at":"2026-08-15T15:06:45.628929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-15T15:06:44.703731Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.703731Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:772b03d09163c94bdc4d88eb052a6f5fb8245a12aaf451cf9a3493c4b69ca7cd","observation_id":"a3dd1830-1a59-476e-9f1c-014c45270d22","resolution":{"observed_at":"2026-08-15T15:06:44.703731Z","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-15T15:06:45.606860Z","title":"Hopcroft and Jeffrey D","venue":null,"work_id":"b8d9f73a-a26d-4532-9885-2d3ea029afd6","year":1979},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.709550Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:2f79f41db8a57ea93acc19090b0b6fc516ac0a13ebb08610c55af266c3f9cb28","observation_id":"e6cb1c6b-07bc-41c3-a0ae-a27ee63333e7","resolution":{"observed_at":"2026-08-15T15:06:45.611935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:44.714459Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.714459Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:c8a3c8750d1ae405c425ae00f260ad417d6dc190d77636c60e8d9f5a1d3d97e3","observation_id":"9d935902-e1f3-49f9-beef-7af5d51947ef","resolution":{"observed_at":"2026-08-15T15:06:44.714459Z","resolver_source":null,"status":"malformed_identifier"},"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-15T15:06:45.590782Z","title":null,"venue":null,"work_id":"798054b3-adad-4e7b-bbaf-368b1f2cd05c","year":2022},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.720538Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:4d3f3e413075aeb858448e674761fa8b904a9f5c17959b3118c82d90f4208315","observation_id":"0d3513c8-7cc4-4346-bb22-46c98ede1245","resolution":{"observed_at":"2026-08-15T15:06:45.595825Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.573802Z","title":null,"venue":null,"work_id":"56de91d3-18a6-4e1c-9cde-d0405a0131bb","year":2024},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.728375Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:642dd238116ada6cd6f5997268d724e884cc8a49be676ce481f76accbc8a8e29","observation_id":"3e5525cb-22e3-481c-a977-455c93481f49","resolution":{"observed_at":"2026-08-15T15:06:45.579134Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:44.734459Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.734459Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:78234edca916eb2545a71a18ac23fd730158a536397b79137abfb6034ea79b86","observation_id":"a9e90bd4-a77c-45f0-be2b-84f4b07869eb","resolution":{"observed_at":"2026-08-15T15:06:44.734459Z","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-15T15:06:45.558154Z","title":"Fiannaca, Terry Koo, Lucas Dixon, Michael Terry, and Carrie J","venue":null,"work_id":"a73fafb4-b1b6-4ade-b9be-0c9fd378e22e","year":null},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.739558Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:266e4e95e0072304c6271655b73e0f5340bc5c96db02d6cef69f12101b48bd1d","observation_id":"5c3026b5-64d9-47ef-8df1-ad7d62a9595c","resolution":{"observed_at":"2026-08-15T15:06:45.563188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.542485Z","title":"2025.LLGuidance: Making Structured Outputs Go Brrr","venue":null,"work_id":"02a5b654-be87-409d-b9b3-bebf3390ce89","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.750667Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:c961dfa7f7da81ac89db865a54e3aed4a34925f4754389e0ca598fa748398e72","observation_id":"6e162e84-4202-4d24-9b40-4b7c300a7b2d","resolution":{"observed_at":"2026-08-15T15:06:45.547365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.526556Z","title":"2025.Json-Mode-Eval","venue":null,"work_id":"2a08732e-634e-4f5b-bc4a-94a62dbc08a2","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.756019Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:cdf806cc2b9e34be92f5d54d3a31778e072f6be9535478929906ebabc3c12fda","observation_id":"99a7c4e0-be87-4cc9-b391-fe0f11894f9c","resolution":{"observed_at":"2026-08-15T15:06:45.531539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.509666Z","title":null,"venue":null,"work_id":"b890360f-419b-4e3d-8673-e4a0255a24e8","year":null},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.760955Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:8930be6e2a28dce9bc7325b284ee914bd42264ad15e049a9bbcab165396e5d8c","observation_id":"21e81beb-6af0-4d03-b375-ca1329c68281","resolution":{"observed_at":"2026-08-15T15:06:45.514774Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.486394Z","title":null,"venue":null,"work_id":"adbeb124-3727-46ad-bb1e-e9708db3ce56","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.766557Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:de735c355b7f4ee31f946ea912fd02095b484b8a08022cd290b3859fd4303f32","observation_id":"d8881875-f661-4b2b-9d17-384a69af9e4a","resolution":{"observed_at":"2026-08-15T15:06:45.492107Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.468269Z","title":null,"venue":null,"work_id":"0e7322da-1c5b-4e1b-bd2f-ef821e18ccaf","year":2021},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.771621Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:6a9cab7276a1a008ab6dad568357d5f4dabb7f002e5702bbc8954cabd3ef48bb","observation_id":"571bde1e-9c72-438e-93df-666ed13e2ad0","resolution":{"observed_at":"2026-08-15T15:06:45.474353Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-08-17T18:50:07.059564Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-15T15:06:44.777599Z","title":"2025.Qwen2.5 Technical Report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.777599Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:f39e767199f7114ef1ca0efb3237f09f6237911210cd1ca07dcf180658a8c91a","observation_id":"5ef3afe9-926f-4593-82c9-7eeb956858e5","resolution":{"observed_at":"2026-08-15T15:06:44.777599Z","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-15T15:06:45.449539Z","title":null,"venue":null,"work_id":"8face6c0-8ccf-44df-b998-6674a2b344d1","year":2021},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.783257Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:ccf06a5235f4a81029885b1b76ada6af3a08ddb16d40b204617c95a34495c43d","observation_id":"e9360c2e-cd18-4018-867c-7206673e8340","resolution":{"observed_at":"2026-08-15T15:06:45.455435Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:44.788622Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.788622Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:358c48ce83523de5d8fb9959a0f1a1caaaaf612563e53ce79af0c1ec67d90b7a","observation_id":"e73aa0d5-d7d8-48f4-b6e6-5c56b95ae6ca","resolution":{"observed_at":"2026-08-15T15:06:44.788622Z","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-15T15:06:45.432117Z","title":"2013.Introduction to the Theory of Computation(third edition, international edition ed.)","venue":null,"work_id":"c36473a2-c231-474d-9927-231027f6c225","year":2013},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.793683Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:1daf6d6accb96abe0deb35297304d390e139a0c57f2a88ebfe727526decd7a3a","observation_id":"b8ceb03f-0cb8-45cb-ad23-4a531d2235e8","resolution":{"observed_at":"2026-08-15T15:06:45.437906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.410733Z","title":null,"venue":null,"work_id":"ebb28b1f-88d1-4f6f-93fb-67fb199eb14c","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.798543Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:10e41d2fe2ab6b8934118225a3c088a7229483dc5fa012d3b41c29f73c76c506","observation_id":"26d129ba-c595-4c50-84aa-69853067ae21","resolution":{"observed_at":"2026-08-15T15:06:45.419072Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.391791Z","title":null,"venue":null,"work_id":"c143f410-8002-47a3-93f8-fe2c17adfdf3","year":2025},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.803487Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:d3289ceb8fb13579c7c54f2b580315be8c11ab1e589180c71aa5545b8613f402","observation_id":"3503f004-59c5-4d4e-b152-9555673be3ae","resolution":{"observed_at":"2026-08-15T15:06:45.397219Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:06:45.373021Z","title":null,"venue":null,"work_id":"6858e738-4bf2-4f90-aee0-7681e55febab","year":2026},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.808964Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:97280362ad87c590fa77c84295d5e4f600a73af6e61290ef3e62ab598058c79e","observation_id":"ea02b594-28dd-4444-b35c-5a987e485539","resolution":{"observed_at":"2026-08-15T15:06:45.378727Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2307.09702","last_updated":"2023-08-19T21:27:51Z","snapshot_observed_at":"2026-08-16T18:10:05.404630Z","submitted_at":"2023-07-19T01:14:49Z","title":"Efficient Guided Generation for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09702","snapshot_observed_at":"2026-08-15T15:06:44.813833Z","title":"Willard and Rémi Louf","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.813833Z"},"links":{"cited_paper":"/paper/2307.09702","citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:d97145b1f61d9122b8cbf2cb3bfc34ba6776820c948976b63793a34fdff16dd9","observation_id":"9052e1d3-28b0-4c0a-a3eb-5db594b0c9fa","resolution":{"observed_at":"2026-08-15T15:06:44.813833Z","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-15T15:06:44.819832Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.819832Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:50b4cef78574ab08f0f6a83f55bc7f6eb6bebacb01418f7093abe807caf5c6f8","observation_id":"4fa7f2a0-5a42-494a-b3a0-07d19351635d","resolution":{"observed_at":"2026-08-15T15:06:44.819832Z","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-15T15:06:44.824746Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.824746Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:21da8e57e5287aae4814c8130886fe099ba0a94d493d04f59b159e79b45e0e4a","observation_id":"28a42ec0-804f-49ba-bf60-13f38fc12a04","resolution":{"observed_at":"2026-08-15T15:06:44.824746Z","resolver_source":null,"status":"malformed_identifier"},"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-15T15:06:44.744765Z","title":"We Need Structured Output","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T15:06:44.744765Z"},"links":{"citing_paper":"/paper/2608.03065"},"observation_digest":"sha256:a89804563d5dd5e9ba2ef6d1054196d7aca41df6524f468348147ad733041bd7","observation_id":"f4703de1-daae-4c31-871c-4b650ed8d95e","resolution":{"observed_at":"2026-08-15T15:06:44.744765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.03065","last_updated":"2026-08-04T03:26:54Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-23T19:15:16.454904Z","submitted_at":"2026-08-04T03:26:54Z","title":"Efficient Grammar-Constrained Decoding via Parser Stack Classification"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":45},"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 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2608.03065."}