{"as_of":"2026-08-19T15:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7ad9cdc317fa0e7e6231d4cf0c8cbb337df6dbb4922f480fea4f90e1842726cb","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-25T20:26:09.264043Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2606.25777/citation-record","integrity":"/paper/2606.25777/integrity","json":"/paper/2606.25777/citation-record.json","paper":"/paper/2606.25777"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T20:26:09.264043Z","title":"2026 , eprint=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:e63598f7ee6d105425e68c9bb1adcf34848f10036c1d39a7577d10bc3376181f","observation_id":"e3cb594f-4352-4e20-901b-19ce7673ea88","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:337351cb9c0ccb8089ad583ae69017bbba64a166fd0718de8884b3d92c361760","observation_id":"3d10630f-7b40-41fd-8737-bd9441f12255","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18530","last_updated":"2025-07-03T15:39:41Z","snapshot_observed_at":"2026-08-16T12:59:58.707261Z","submitted_at":"2024-12-24T16:24:43Z","title":"On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability","version":2},"cited_work":{"arxiv_id":"2412.18530","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.18530","snapshot_observed_at":"2026-07-04T20:20:06.885884Z","title":"Characterizations of language generation with breadth","venue":null,"work_id":"70b9f665-5f11-41c2-a566-826a1f7a483d","year":2024},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2412.18530","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:6c4aa0e3996fe5ca00c0eeecd36ecf054e85da67ee6b01066542e307dc4b0171","observation_id":"a7f88e73-bb7f-46e9-a03c-42d6b5b687fa","resolution":{"observed_at":"2026-07-04T20:20:06.887596Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T20:26:09.264043Z","title":"1985 , publisher=","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:0c9823964ef8bd83cbe07492b7294985cb5c8fe320e2a6537acb1a0e7fac1189","observation_id":"c6c1db59-02f6-4400-9be1-7676b3db3be5","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.15543","last_updated":"2025-07-10T14:01:54Z","snapshot_observed_at":"2026-08-15T19:30:42.039418Z","submitted_at":"2025-06-18T15:17:03Z","title":"Learning Algorithms in the Limit","version":2},"cited_work":{"arxiv_id":"2506.15543","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.15543","snapshot_observed_at":"2026-07-08T15:35:07.189234Z","title":"Learning Algorithms in the Limit","venue":"cs.LG","work_id":"aeffb046-ad1f-47dc-b2d4-3203cc180a46","year":2025},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2506.15543","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:98c5c57c1591483911a470369de78cfb8618aafa7f7dd7a84439e922f5eb3941","observation_id":"7644b581-bd0d-4d5e-9c7b-9a3db8d82256","resolution":{"observed_at":"2026-07-04T20:20:06.877708Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15364","last_updated":"2024-12-24T10:57:49Z","snapshot_observed_at":"2026-08-15T08:17:23.788985Z","submitted_at":"2024-11-22T22:13:40Z","title":"Exploring Facets of Language Generation in the Limit","version":2},"cited_work":{"arxiv_id":"2411.15364","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.15364","snapshot_observed_at":"2026-07-04T20:20:06.876961Z","title":"On the non-uniform generation of countable language collections","venue":null,"work_id":"4fb3d5c8-f279-42ad-93a8-53e93d721457","year":2024},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2411.15364","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:34167a77a4418222c5e876aa08b9e8755cd9bdb039b8e725657068a547b1b968","observation_id":"67c28f1b-0b09-41e5-ab65-138d4f6acde1","resolution":{"observed_at":"2026-07-04T20:20:06.878788Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14370","last_updated":"2025-04-19T18:08:18Z","snapshot_observed_at":"2026-08-16T11:48:08.715615Z","submitted_at":"2025-04-19T18:08:18Z","title":"Density Measures for Language Generation","version":1},"cited_work":{"arxiv_id":"2504.14370","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14370","snapshot_observed_at":"2026-07-04T20:20:06.861753Z","title":"Density measures for language generation","venue":null,"work_id":"611c967c-a152-4432-8851-11e92dfc29d9","year":2025},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2504.14370","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:3ebbd56a43112963d14e002995a76c0bb61516f5fd9500edc552470b1ddb6960","observation_id":"ea36f365-37f9-4fde-9fcb-e28686743e01","resolution":{"observed_at":"2026-07-04T20:20:06.863675Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13714","last_updated":"2024-12-27T13:42:07Z","snapshot_observed_at":"2026-08-16T13:08:20.586989Z","submitted_at":"2024-10-17T16:14:49Z","title":"Generation through the lens of learning theory","version":5},"cited_work":{"arxiv_id":"2410.13714","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13714","snapshot_observed_at":"2026-07-04T20:20:06.871003Z","title":"Generation through the lens of learning theory","venue":null,"work_id":"36159cd9-d1ca-4118-983e-a3810003f3e9","year":2024},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2410.13714","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:5ba447c416fa446830d2bb8198a0d825d8347a07c8f84350cde3ae933be8a340","observation_id":"1a8e8156-3783-4d3a-9b84-c3b61006f27c","resolution":{"observed_at":"2026-07-04T20:20:06.872636Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.02795","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T20:20:06.882852Z","title":"Pareto-optimal non-uniform language generation","venue":null,"work_id":"26a9986a-764c-49e7-a771-b04c2b2f9c1a","year":2025},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:37a62bd4968d92b0f239da214d1ce1da01e754c337271a5472a3ce912a21f36f","observation_id":"e478c58c-3c20-45d7-b4ed-1f300540057e","resolution":{"observed_at":"2026-07-04T20:20:06.884579Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04179","last_updated":"2025-06-10T01:33:34Z","snapshot_observed_at":"2026-08-16T12:59:28.070917Z","submitted_at":"2025-01-07T23:16:14Z","title":"Generation from Noisy Examples","version":2},"cited_work":{"arxiv_id":"2501.04179","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.04179","snapshot_observed_at":"2026-07-04T20:20:06.867562Z","title":"Generation from noisy examples","venue":null,"work_id":"579689a1-25d1-41ff-bb86-12acd2e1a5ee","year":2025},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2501.04179","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:cdc978da596e4e89d7a4d4c0eebce35608275c67ddf017e9ec4faa14d1906d8d","observation_id":"3ed5fce6-65f4-4435-b6b6-7ae816800e00","resolution":{"observed_at":"2026-07-04T20:20:06.869444Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.21819","last_updated":"2025-05-27T23:02:54Z","snapshot_observed_at":"2026-08-16T01:33:46.084266Z","submitted_at":"2025-05-27T23:02:54Z","title":"Representative Language Generation","version":1},"cited_work":{"arxiv_id":"2505.21819","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.21819","snapshot_observed_at":"2026-07-04T20:20:06.879981Z","title":"Representative language generation","venue":null,"work_id":"fa466bb0-2656-48bb-903b-9c85bce00eff","year":2025},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2505.21819","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:01fd7086ca63e2184059662fc5971e4128d64c433fe65ce272985d182107fa93","observation_id":"88fb6cd5-4c4d-4448-a4d8-c2101b475e2b","resolution":{"observed_at":"2026-07-04T20:20:06.881680Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.18642","last_updated":"2025-06-23T13:42:25Z","snapshot_observed_at":"2026-08-18T19:43:42.205201Z","submitted_at":"2025-06-23T13:42:25Z","title":"On Union-Closedness of Language Generation","version":1},"cited_work":{"arxiv_id":"2506.18642","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.18642","snapshot_observed_at":"2026-07-04T20:20:06.888662Z","title":"On union-closedness of language generation","venue":null,"work_id":"f06dc7dc-f8c0-4e4c-a650-6e22cd75c469","year":2025},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2506.18642","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:a97b82a3b34956a6e69c7d52d70d70614f1346b9c0e1059ed8333ffdf6ca8891","observation_id":"af193596-af54-4fe1-86df-e66b1473510c","resolution":{"observed_at":"2026-07-04T20:20:06.890236Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.04103","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T20:20:06.864934Z","title":"arXiv preprint arXiv:2511.04103 , year=","venue":null,"work_id":"74e0c98d-b512-4388-8a5c-75c95aceed70","year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:5806369d782e49283d8564baba40fe1b754e66540e1fb52344ec270d5456cdcb","observation_id":"18321cd9-fe08-4b5e-a3af-ef3d4cf7f8e0","resolution":{"observed_at":"2026-07-04T20:20:06.866472Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T20:26:09.264043Z","title":"Machine Learning , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:0ea65c9f1c565b15c3db913fe3c646790cd3780b5d74767a605b39072d620b75","observation_id":"9333b652-e899-4187-b169-0b7b6e59c34e","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Information and control , volume=","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:0a7eef9294f028a76d272b9a50d0dae2e6120cebef733c67b7abfa444e8c01e2","observation_id":"dbb74579-bd49-4e96-991e-ae5297aba040","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Information and control , volume=","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:918f62ef9cdd729dd0c77a157c1c4674eab651664ede9e2a060000b12e5290d3","observation_id":"33c4458c-7363-41e4-bf32-1ad14e443f5e","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Information and control , volume=","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:e551e2b7a27b083c4e9964c84d5d74416ce94b4462da17328e0ab37270e959a7","observation_id":"bba446fc-3116-400e-9e46-d3baadf31ca7","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Machine Learning , volume=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:f7e5fa4115686e71ecdc3c8643e82c9acecb6432f13b5c69ee7896cb57526ebb","observation_id":"7f01c5cb-cc99-47ba-81a3-662de7b87b29","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Annual Symposium on Theoretical Aspects of Computer Science , pages=","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:3c53c82fcc47a1d8136e08209e9723788a06271f1a54b89c23c010d9b53eb5a7","observation_id":"eee19ec8-7618-45ca-9825-4e984d8fe431","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"International Workshop on Algorithmic Learning Theory , pages=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:ee872e35df0c181f1712f8ea052ef401fdfa7d64c1dfa424738a970336adb57d","observation_id":"d598f06d-7886-41e2-85c2-568632b5b215","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"2023 , publisher=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:4619fffd934d7670e10d98898eafe55f9682b5ac3773c146987d0d0601b2e3e0","observation_id":"b45c7fca-5082-4b3d-90a0-d4fef5ed64f5","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"ACM Sigact News , volume=","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:afb6459a97cad1bdf933b96e03d32da2b6650d61d1040c73533d4b7eacb6da0d","observation_id":"c5351869-070f-400b-834f-dac0d6c3efdd","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Acm Sigact News , volume=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:4b2007b8879d575ef3e5ede2ac099d28a440f6ca130b8f55289ac36fdd743728","observation_id":"b29664d7-5824-4e22-8dfa-5adc21671cab","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Theory of machines and computations , pages=","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:c8b6704f7b14adb4a6f358bb0e108e55b4e6b67bbbc88dc87c717049ebdb493a","observation_id":"efc56162-7899-46db-910c-f79ccaf342e3","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Acta Informatica , volume=","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:b9f90b29f311a4c776b117b961dcc26c3a50ea4b312f0f9991d449f19a5a35ac","observation_id":"b8987dd9-6bd3-4cf3-ad58-1adc54062b2e","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"RAIRO-Theoretical Informatics and Applications , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:8f897512e81af742029a8700363c61a6eb03c98495657f55c9163f266884966a","observation_id":"a64ac4f2-af7e-440f-9dad-da7f3814b4b5","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Theoretical computer science , volume=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:701393c5739a309a0d4b91d5e5d47c12c9897bdc8eeda566735bd0844755188d","observation_id":"6597af0a-ad95-4328-9446-43580198086c","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"International Symposium on Mathematical Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:fd1faaf1c63c70cc2d78216195edf41843b2259a50db7ab5c73aa2c9e5caa9bb","observation_id":"d5eaa8a2-bdda-42cb-a3d5-2a79a0c7f91d","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"International Symposium on Mathematical Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:a24f8c9ec49ecf13f93192ab0da3df32d9ba6ab25c404aa53421f879c0ca1225","observation_id":"ea5e648c-3c05-42f3-a3f8-7d7242e99aea","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"International Journal of Foundations of Computer Science , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:381443296ce5e2d96003cccf8108c62dcdefb722a6599ca63c2b7fd77a7ae3da","observation_id":"9267a441-d34f-4a84-bbf1-b734b62247e1","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Problemy Kibernetiki , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:7b216c23ed0f5dcd30fe77fb25dc54d72a20da61082ab1599cd3f3113ff8df56","observation_id":"5689456f-fd8b-48e5-a337-e6cd41a239b2","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Theoretical Computer Science , volume=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:a62a5f858a5ff82f8cbc3b65a004d208645618da85aea330ba0bd56b4fbcf113","observation_id":"8e861c0e-e6b1-40f6-bf98-1bcf0d9cf639","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Discrete Mathematics & Theoretical Computer Science , volume=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:b0ab1e9bdd67acb6ecc4af1579b167676aba9a755d784b4fd5a33580c1992619","observation_id":"5fdd3c0c-cad7-4471-8cb8-4794de1268e3","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1109.5683","last_updated":"2011-09-26T19:39:56Z","snapshot_observed_at":"2026-08-15T04:34:09.070927Z","submitted_at":"2011-09-26T19:39:56Z","title":"Asymptotic enumeration of Minimal Automata","version":1},"cited_work":{"arxiv_id":"1109.5683","doi":null,"metadata_source":"pith","pith_arxiv_id":"1109.5683","snapshot_observed_at":"2026-07-04T20:20:06.878863Z","title":"Asymptotic enumeration of Minimal Automata","venue":"cs.FL","work_id":"e82f7135-14be-43c7-9a81-19b8086c825e","year":2011},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/1109.5683","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:f81af4fbe3b1f7c76ea659db85c41b44195c58f8b871d80362413698580433ff","observation_id":"d331124a-b4aa-406f-9316-8049a16274dc","resolution":{"observed_at":"2026-07-04T20:20:06.880677Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T20:26:09.264043Z","title":"International Symposium on Mathematical Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:bfca5f90e67d7084fa805e4aea7a4a8c53f0a351bf3e600dd229633aee3989a4","observation_id":"d089168a-64d7-4eda-a900-9b3c9c77e51b","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:bcc48ce8490e75d1fc4bbe24380e104efbdd4a240938dea7bdb080048401e675","observation_id":"93c9e2f6-fc52-48a4-8f71-1eb3a7dea009","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"IRE Transactions on information theory , volume=","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:a0772560b64c2b3e06a0c3a4ed7ec6fbff063c8857a624eba82824c7e0b5b947","observation_id":"429998f0-c367-4311-9d69-f8539859d1af","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:122f575376ac0a971422993d4e4b8381c77341d842a9a2aa323c5bd158054af5","observation_id":"0d10072c-eb15-4c23-bf21-bba2da8d6820","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Cognition , volume=","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:b8f951375435fe8733207b790adc66757e228fbc10d03cc12d44f83c80aa4cd7","observation_id":"26a0e75b-7194-4795-9fa2-75452d30ef9a","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Journal of child language , volume=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:daf8122627d0bbfd4ff48e03f8f51c4b391ccd890ceec01ff4deff7caa27d369","observation_id":"1a870a5f-c9f8-4ba1-8d80-72a7d11dc876","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05161","last_updated":"2023-12-19T10:13:33Z","snapshot_observed_at":"2026-08-16T14:54:05.161994Z","submitted_at":"2023-10-08T13:36:05Z","title":"Recurrent Neural Language Models as Probabilistic Finite-state Automata","version":4},"cited_work":{"arxiv_id":"2310.05161","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.05161","snapshot_observed_at":"2026-07-04T20:20:06.873260Z","title":"arXiv preprint arXiv:2310.05161 , year=","venue":null,"work_id":"a82870db-59e9-464b-bc52-01227d99100c","year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2310.05161","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:524ad7b6c9bdf1721cfb8276f4fee3beba275b05578e75a10ec57f2c109a7855","observation_id":"74a1011b-7fae-4f65-aced-24e539122879","resolution":{"observed_at":"2026-07-04T20:20:06.874896Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T20:26:09.264043Z","title":"Trends in cognitive sciences , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:7ad9be5500e3ec050e965b9351628640ceb30c822087288b31de1f45de878808","observation_id":"c3dc90b0-5eb9-4666-abed-1afb24e210d8","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:8cb3d0d063f9e60e7010c66b86403d31a5265669906201c3e86f8a3296fa404c","observation_id":"9b89893f-acfc-4270-bff5-2455ce20ab7f","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"OpenAI blog , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:536b516f60af1654d72461955182a95a64348cd086de35acd599c078f5af2cc4","observation_id":"84e4eed8-0322-4b59-8de0-967a134c0a90","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Coding for Interactive Communication: A Survey , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:c76a17e413334ef753749cbff1beb481fcef258b2b0b1e9df0a143f7158eab88","observation_id":"ac82ee8d-e844-40fe-817f-0ed999f52fdb","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Journal of computer and system sciences , volume=","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:d7c83ef80b17d999ea2d49b27d3caafa32c54a70aae089bfee17931e200fd3b5","observation_id":"8ec6b620-00d3-4509-83dc-e016a8edf3e7","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08819","last_updated":"2025-03-05T23:00:57Z","snapshot_observed_at":"2026-08-16T14:01:18.649299Z","submitted_at":"2024-04-12T21:30:06Z","title":"The Illusion of State in State-Space Models","version":3},"cited_work":{"arxiv_id":"2404.08819","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.08819","snapshot_observed_at":"2026-07-04T20:20:06.870632Z","title":"R Chris Miall and Daniel M Wolpert","venue":null,"work_id":"84888539-7324-4623-988f-1c4f49ba62ab","year":2024},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2404.08819","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:61e38f26638253cf81709ac2810665c47106d610654f640f3b20a5656de0f554","observation_id":"597db3dd-848d-4cca-ad05-031500858c76","resolution":{"observed_at":"2026-07-04T20:20:06.872063Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14994","last_updated":"2024-06-20T15:21:23Z","snapshot_observed_at":"2026-08-16T13:58:32.954473Z","submitted_at":"2024-04-23T12:51:37Z","title":"Transformers Can Represent $n$-gram Language Models","version":3},"cited_work":{"arxiv_id":"2404.14994","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14994","snapshot_observed_at":"2026-07-04T20:20:06.852432Z","title":"arXiv preprint arXiv:2404.14994 , year=","venue":null,"work_id":"b49aadfd-0d49-4b12-9d18-b45a7dabd683","year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2404.14994","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:9d677a08ef19dbbe95942f6268efd3ed2f3bceeda1b0015992d7940f1d8fed44","observation_id":"f74f8b14-9228-48cf-a054-d9853d069f97","resolution":{"observed_at":"2026-07-04T20:20:06.854207Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T20:26:09.264043Z","title":"Jack , title =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:c6dccab8d631b417ba8a23e3cfd3d27437cdc575de8ad37ed8cf35d41d914f20","observation_id":"38180f5f-cc8c-4403-bdf2-a63ed4903265","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Communications of the ACM , volume=","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:ee452c4985059d9c070365f8b2a5ec02b05d5bfbfd5438d6a06517d4ec6000b6","observation_id":"b799320f-d6fb-45d8-8003-5195e6838232","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"1994 , publisher=","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:305f45735355f32efef270a254c7550dc7aa07fb4a8a43b0ef7be9e2fc7e1129","observation_id":"034f34e8-1658-4d39-aa47-5e6db034c573","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"2010 , publisher=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:40d9cde2895bc203fadc0f1865a46cf24f67a5b6c4cb7bf3cdea8034e08bd3a1","observation_id":"51d2f617-4703-4c40-ba41-6ea267ad9ae6","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"1999 , publisher=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:69299f589c99b0a57157c5051d8bfb32507cd6cb75de5ee381e266cd7eb6ddb7","observation_id":"fd664310-a558-493d-a74f-66baea5968e2","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"2007 , publisher=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:073f66e05e6ec9f6011fa3cd1e8c5161cb2cfb825036d943695f388eeb163632","observation_id":"be0eff2d-dce8-4fd8-b30c-56887a4346a9","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Information Theory Methods in Communication Complexity , booktitle =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:992a764beeae0417f546ba7188504603d0d0e0b192b9093ee2952aa1f11ac9fd","observation_id":"10644f4a-5dde-4e59-8fc4-5e2ba4390df6","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:2c16036fdee24df1e2930d9e7c3bf6109870d5380b12ee5b276f77a7c81f4ede","observation_id":"7c2c6ba7-208f-49e7-b0df-4f893ae9dd90","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","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-06-25T20:26:09.264043Z","title":"Advances in Computers , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:1531c872ade546442f2dfb699f86ce021e8f5d4e22e9708d90057278469e41a5","observation_id":"56ee0261-f812-4a3e-80fa-81c3770dafad","resolution":{"observed_at":"2026-06-25T20:26:09.264043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":10,"parse_uncertain":0,"unresolved":43,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":57},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2606.25777."}