{"as_of":"2026-08-08T18:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62a4336ff545f0669b0c8952087d71510f32043f827cff954687219c6e1fb02b","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:00:54.322617Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.01151/citation-record","integrity":"/paper/2506.01151/integrity","json":"/paper/2506.01151/citation-record.json","paper":"/paper/2506.01151"},"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-07T12:00:55.152403Z","title":"Prompting is programming: A query language for large language models","venue":null,"work_id":"0eeb6815-42f7-4d3f-a606-b3633c72f210","year":1946},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.173458Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:ebe4468085b93b4ca795c2e4b3156431b51f25be8cdb0658a2a4c563cc291001","observation_id":"d3315272-91d0-428b-9ab2-c7a13411f7af","resolution":{"observed_at":"2026-08-07T12:00:55.157705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:55.136018Z","title":"Guiding llms the right way: fast, non-invasive constrained generation","venue":null,"work_id":"9103add2-2683-46d8-ac68-4a2fb16a250a","year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.177987Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:93f7f5d373597f7177a72494987e6fd046e1944ff88044025d4af220f5b192d8","observation_id":"1b73073c-81ba-4c39-b65e-34e2309df071","resolution":{"observed_at":"2026-08-07T12:00:55.141176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T11:58:24.516369Z","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-07T12:00:54.181866Z","title":"P., Cummings, D","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.181866Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:5c0ed8860747f396e26a07d7ac9cf7e1e07474ad5dd359e654e47d5d40a78f88","observation_id":"f1c9f695-5345-4024-b83d-14ea7aeff17c","resolution":{"observed_at":"2026-08-07T12:00:54.181866Z","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-07T12:00:55.097061Z","title":"Three models for the description of language","venue":null,"work_id":"67ff38a7-fa01-44bd-8648-9fdce881df6b","year":1956},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.186300Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:9a782bd4e12bc40b1982508db7b65886928b696cc0f3e4ef3084e9ee087cc90a","observation_id":"87933201-6688-4f5f-ac17-ddd27a707dfb","resolution":{"observed_at":"2026-08-07T12:00:55.118677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:55.072317Z","title":"and Meltzer, P","venue":null,"work_id":"e4450aad-465c-4b5f-8f4d-a6c1bb213d78","year":2007},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.190155Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:2219a267c77b83e1d5bd22977176c2feb905faa608e3306225ba416afd9c41be","observation_id":"dfafbe90-8ed2-41b2-9f81-310cb8a32873","resolution":{"observed_at":"2026-08-07T12:00:55.086495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:55.055556Z","title":"A general-purpose algorithm for constrained sequential inference","venue":null,"work_id":"10ee1350-96e5-4a05-bd8b-11d07bec012c","year":2019},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.193981Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:d4dfe6ad60efeba7094fc8b28508761b56a9b5dacecccba97bb613e2f33ecb69","observation_id":"2f59bb6b-a1fe-4115-ac77-542458ac7e6b","resolution":{"observed_at":"2026-08-07T12:00:55.061545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15100","last_updated":"2025-05-12T08:20:08Z","snapshot_observed_at":"2026-07-06T19:55:37.400185Z","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-07T12:00:54.198205Z","title":"F., Cai, Y., Lai, R., Xu, Z., Zhao, Y., and Chen, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.198205Z"},"links":{"cited_paper":"/paper/2411.15100","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:e9ea3d73547e933b13e54c9e36ff9deae5dd4fb97b73419b0674f9ae6549a66a","observation_id":"4f0efdcb-c4f6-4c28-9888-8fc6f19dacce","resolution":{"observed_at":"2026-08-07T12:00:54.198205Z","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-07T12:00:55.041018Z","title":"Implement json schema field constraints \\#215, August 2023","venue":null,"work_id":"15ce0b00-6d44-478f-b818-eb80e0f128e9","year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.202170Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:9e7ec051e8bae1d8e962efed2494d91b24e0ece0ec11ff850f03a64568740134","observation_id":"a116c62a-a024-47b3-899a-b7df8d1fd66d","resolution":{"observed_at":"2026-08-07T12:00:55.046133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T18:55:11.576666Z","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-07T12:00:54.205993Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.205993Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:b32164d60f27706c30f33587dd22fa42f2d69b2f7e3f95af1d7bfb47b11a4292","observation_id":"729a824e-fc04-4eb6-ac23-9ba1af12c05c","resolution":{"observed_at":"2026-08-07T12:00:54.205993Z","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-07T12:00:54.209928Z","title":"An efficient context-free parsing algorithm","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.209928Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:c31f4b0913ec195254a0cc1141027323d22b0857c85b9f146a7774193103eb77","observation_id":"987658be-43d7-45f3-b579-d774839f32d7","resolution":{"observed_at":"2026-08-07T12:00:54.209928Z","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":"10.18653/v1/2023.findings-acl.351","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:00:55.023486Z","title":"The whole truth and nothing but the truth: Faithful and controllable dialogue response generation with dataflow transduction and constrained decoding","venue":null,"work_id":"6bd34db4-eb39-4ad4-a958-ddbaed341f66","year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.213503Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:613ccd6151df84499c60375f55452acd26d08349da9c550751091cdd941da99a","observation_id":"240dddcc-e994-4685-93dd-c2c4e01f1f8b","resolution":{"observed_at":"2026-08-07T12:00:55.029644Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-07T12:00:54.218464Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.218464Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:3ef7bc97c74673d724e30ef039d20c438a0360b7dd45a610e27d2029e5d00050","observation_id":"085a0c8d-cf8c-4964-8f85-f724659525d3","resolution":{"observed_at":"2026-08-07T12:00:54.218464Z","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-07T12:00:55.003848Z","title":"Grammar-constrained decoding for structured nlp tasks without finetuning","venue":null,"work_id":"836eae00-5a00-4446-b09a-f063f5908e0e","year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.222660Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:d41d903e7f30c19375ad58079368d8ecd474a2e192f23c25abf50196b6c3a46e","observation_id":"e86399ca-1b01-4cfa-a783-0ad16d667171","resolution":{"observed_at":"2026-08-07T12:00:55.008981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.226160Z","title":"Grammar-constrained decoding for structured NLP tasks without finetuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.226160Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:bfb18310833a73cccc95802b51647d32adc44fa7d4f41e8db123974094748a9a","observation_id":"8a62e305-b1f9-4cd2-aebb-033d9fae915e","resolution":{"observed_at":"2026-08-07T12:00:54.226160Z","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-07T12:00:54.986268Z","title":null,"venue":null,"work_id":"f1e14f36-9baf-4365-8df4-68ddd74cade8","year":1979},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.229852Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:7ec1bd76695f5d1be992d64f7a98e65513872fce7ae0c876c0bfaf2be93c51ec","observation_id":"d8734055-1457-4011-91b8-a2d677fbbcb9","resolution":{"observed_at":"2026-08-07T12:00:54.991618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.971670Z","title":null,"venue":null,"work_id":"01b68cdc-6db7-4b62-b437-6ecca889e0d6","year":1979},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.233733Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:eb59e5e4140409a3f66540a8b4d0d95b76c76071fc9a8c133839a2fe86d5ee3f","observation_id":"141c54ea-c7e6-4dde-b96b-b4f28ccac152","resolution":{"observed_at":"2026-08-07T12:00:54.976468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-07T12:00:54.237345Z","title":"Q., Sablayrolles, A., Mensch, A., Bamford, C., Chaplot, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.237345Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:fd647482b9e6462df4efb185c0d56ae136579ed6cfb42c4652f2aea1b2b8e477","observation_id":"ba9f0950-5d16-4192-9052-b772944ff4b6","resolution":{"observed_at":"2026-08-07T12:00:54.237345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03346","last_updated":"2024-09-05T08:45:44Z","snapshot_observed_at":"2026-07-06T19:10:52.672585Z","submitted_at":"2024-09-05T08:45:44Z","title":"Sketch: A Toolkit for Streamlining LLM Operations","version":1},"cited_work":{"arxiv_id":"2409.03346","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.03346","snapshot_observed_at":"2026-08-07T12:00:54.649125Z","title":"Sketch: A Toolkit for Streamlining LLM Operations","venue":"cs.CL","work_id":"dff5e360-ecc8-42d8-a710-669064e9537e","year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.241248Z"},"links":{"cited_paper":"/paper/2409.03346","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:a61837a2422fbf6f34a83a17b3df8bf8bfb3ad6435da30c67deef15cff4b54b7","observation_id":"f2764e7a-d5d3-4238-b51e-c637ee32f0bc","resolution":{"observed_at":"2026-08-07T12:00:54.653538Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.958365Z","title":"Automata-based constraints for language model decoding","venue":null,"work_id":"b907aec4-841b-4545-b419-3157ebe6ad05","year":null},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.245257Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:d68af67bae3ca56d553c211bebc47725462601ed8b6f1de75230607dd258bc9e","observation_id":"10751b8f-f43d-4407-91d1-9e342e9b18ab","resolution":{"observed_at":"2026-08-07T12:00:54.962727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.944106Z","title":"Validating large language models with relm","venue":null,"work_id":"bc44a6d1-b2e7-4ebd-884c-eadf493aad74","year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.249491Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:1fb137017ffaeafd5bdf5658166ee85cbfa37fbb5ef1f91347e21e765aa98553","observation_id":"3c1523d8-d8c5-4c9f-b1a4-d1c1392e5729","resolution":{"observed_at":"2026-08-07T12:00:54.948972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.253441Z","title":"Crafting papers on machine learning","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.253441Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:a1811f69b59c61f1014e40725dd5c53ce6ee68fad9cad0f14697cf0142c6a3d6","observation_id":"b386691f-dcb0-4403-a892-c8b9f14b986b","resolution":{"observed_at":"2026-08-07T12:00:54.253441Z","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-07T12:00:54.257136Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.257136Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:298e0732a672821f3111255d8e76b0a7dd1efec587e3c0c4f7163975b03f4de1","observation_id":"6abe6004-ae9c-467e-965c-813cfb5092af","resolution":{"observed_at":"2026-08-07T12:00:54.257136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11477","last_updated":"2023-09-27T07:29:44Z","snapshot_observed_at":"2026-08-01T15:58:01.346044Z","submitted_at":"2023-04-22T20:34:03Z","title":"LLM+P: Empowering Large Language Models with Optimal Planning Proficiency","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11477","snapshot_observed_at":"2026-08-07T12:00:54.261060Z","title":"Llm+p: Empowering large language models with optimal planning proficiency","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.261060Z"},"links":{"cited_paper":"/paper/2304.11477","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:7bbb4eeaae4dae51ac251b22395a9e27eda21a227ba8aa1a12403e3590a1853e","observation_id":"ef9719b3-ff05-4610-8f76-2ff7b16ee313","resolution":{"observed_at":"2026-08-07T12:00:54.261060Z","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-07T12:00:54.919380Z","title":null,"venue":null,"work_id":"b87da072-8612-4a56-a738-796d0bfe671e","year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.265002Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:697e6d8c567abbbf59a9531b125ce19af4edc23ec53be147c27c284d73c8648e","observation_id":"a51a4bd2-79ad-44de-99e3-b4c7ccfef9b9","resolution":{"observed_at":"2026-08-07T12:00:54.924034Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.904951Z","title":"Support left recursive grammars","venue":null,"work_id":"1a27eaed-7c9a-467a-925f-c6d311ce7b31","year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.268552Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:41c1c61feebd081da7d199e593390c887089a360b87b03974cf624391281c720","observation_id":"5e5338de-26c5-444f-8c42-842867044511","resolution":{"observed_at":"2026-08-07T12:00:54.909887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2023.acl-long.204","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:00:54.396080Z","title":"Efficient semiring-weighted E arley parsing","venue":null,"work_id":"3ea0a82a-53eb-41a2-bb41-36dec79a4e19","year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.272114Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:1df79602e52a5ffc7468a005a955e3c24755a3732f374c97bf33e89f2360ecdd","observation_id":"fb5501f9-adbe-4fcd-9602-906b0b3d5bfa","resolution":{"observed_at":"2026-08-07T12:00:54.399838Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.889513Z","title":"Function calling - OpenAI API , 2024","venue":null,"work_id":"5f8a63bb-397f-47a8-8179-b122953f2838","year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.275904Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:5316e7bca75dd4003aead62668cea1450ebdba767078fd3a43999e486b7a3433","observation_id":"ddfebd0d-588a-4504-b5ac-4d0cee4613da","resolution":{"observed_at":"2026-08-07T12:00:54.893980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T12:00:54.279934Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.279934Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:19f4fa2234aad4ab46a817af34aa383ad5c295a5479e0aee40e4617b719ba286","observation_id":"d35f0815-ab08-4e29-a788-8352f6d92b00","resolution":{"observed_at":"2026-08-07T12:00:54.279934Z","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-07T12:00:54.283439Z","title":"L., Suarez, F., Ugarte, M., and Vrgo c , D","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.283439Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:88e56e2dd62564463962c0fe8936df4c9eaa4c4f0ccb72c339de98bf13e03c70","observation_id":"c09f69ac-899e-48a3-a02a-dc5878f51ce2","resolution":{"observed_at":"2026-08-07T12:00:54.283439Z","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-07T12:00:54.874112Z","title":"Synchromesh: Reliable code generation from pre-trained language models","venue":null,"work_id":"ea0cf6d1-5ac2-42cb-bd9f-97c1b40bec7d","year":null},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.286950Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:025c1651c6e7ecfc42e630c2036d55bdf5e16b79d568d87237e57c7c7be161e6","observation_id":"4b17f102-5d21-4d81-aa9b-d3841e768400","resolution":{"observed_at":"2026-08-07T12:00:54.878841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.859617Z","title":"Benchclamp: A benchmark for evaluating language models on syntactic and semantic parsing","venue":null,"work_id":"7b857ab3-f49c-4452-93fc-10b234515bef","year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.290414Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:446999e48bf57f099fc83bdd8b7798436ec629444dd1dcb977b4e3bb2b377a33","observation_id":"880a4666-6a17-4de1-a6d1-f16bf9790b0b","resolution":{"observed_at":"2026-08-07T12:00:54.863894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.845906Z","title":"Picard: Parsing incrementally for constrained auto-regressive decoding from language models","venue":null,"work_id":"83f681e9-e787-4a61-b5f0-3691fc0ed804","year":2021},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.293779Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:a3950beb8422dd2acec298471318c5c0c21c823c7073946608ee39214431e03b","observation_id":"f8283935-135f-45a5-9090-2528e0a863a5","resolution":{"observed_at":"2026-08-07T12:00:54.850189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.297601Z","title":"A., Pauls, A., Klein, D., Eisner, J., and Van Durme, B","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.297601Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:96a7a36aa28e1e630b63aa24bbbaa1e5708dc57dffcb89d5e88b7c5ed199bb18","observation_id":"939db0cf-b3bd-40a9-bd7f-2d44ad975ef1","resolution":{"observed_at":"2026-08-07T12:00:54.297601Z","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-07T12:00:54.831005Z","title":"Neural machine translation with byte-level subwords","venue":null,"work_id":"dc1d4aca-ae39-4f0c-bf58-b304595475ed","year":2020},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.300973Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:988c1910de49e3e1c102427321cd0854a24b2fbee15bb236097867d57f796ffd","observation_id":"dc7d814a-a472-402a-8b2f-dd473162203d","resolution":{"observed_at":"2026-08-07T12:00:54.835492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:00:54.304131Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.304131Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:565b129a1baca132679803586e3d24f739611c548337222487e9c953631cd6d1","observation_id":"ab1a9587-a601-40af-bbc7-95703797dbbb","resolution":{"observed_at":"2026-08-07T12:00:54.304131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09702","last_updated":"2023-08-19T21:27:51Z","snapshot_observed_at":"2026-07-06T15:55:41.294452Z","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-07T12:00:54.307847Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.307847Z"},"links":{"cited_paper":"/paper/2307.09702","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:a2b88be1b62efee16c12fb57791919111b3c10c1162163fd59b47371a6dbbd5f","observation_id":"64d10d41-cdc5-4830-8073-679f19c98b28","resolution":{"observed_at":"2026-08-07T12:00:54.307847Z","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":"10.18653/v1/p16-1127","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:00:54.363635Z","title":"Sequence-based structured prediction for semantic parsing","venue":null,"work_id":"5fca6617-c501-4ab0-9bb4-9c0ba30fb3af","year":2016},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.311450Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:a00b5b14b1e27b2ac3d60326ae39794ef344601491d9e740dc6190e7953af270","observation_id":"a806b63a-8ce6-4ba8-9e06-c18aa83053d2","resolution":{"observed_at":"2026-08-07T12:00:54.369385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T02:11:23.670680Z","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-07T12:00:54.315108Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.315108Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:b93607ac4afca2b18c9be740b01d8574adfdebdc70b80c00fe8d608ed2a9d6af","observation_id":"fa9ef019-36cd-474b-ae20-bab8f5d0b0bf","resolution":{"observed_at":"2026-08-07T12:00:54.315108Z","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-07T12:00:54.318897Z","title":"and Neubig, G","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.318897Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:2630018620ff9b30947fe3d6910b25ba54dcb2230929ee67bd2d9a76f6f8bb74","observation_id":"f3933a3f-de12-4ed3-a39a-a2a2baf8ed7f","resolution":{"observed_at":"2026-08-07T12:00:54.318897Z","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-07T12:00:54.322617Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:54.322617Z"},"links":{"citing_paper":"/paper/2506.01151"},"observation_digest":"sha256:6c658ecee6bde208b61c6f5f362dd130927a617867f6eec899c6975c5784898c","observation_id":"6f2f6397-03f3-49e4-94fd-f1db532d331c","resolution":{"observed_at":"2026-08-07T12:00:54.322617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.01151","last_updated":"2025-06-01T20:05:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T11:48:11.084607Z","submitted_at":"2025-06-01T20:05:30Z","title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":4,"verified_fuzzy":15},"total_outbound_references":40},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2506.01151."}