{"as_of":"2026-08-09T21:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31df2ac20c15e7899b4f1225a1c96bf0fad8573da6a8dbae1dd4d82f40d30bf6","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T20:57:07.286282Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2508.09683/citation-record","integrity":"/paper/2508.09683/integrity","json":"/paper/2508.09683/citation-record.json","paper":"/paper/2508.09683"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.12252","last_updated":"2025-07-18T21:25:21Z","snapshot_observed_at":"2026-08-07T18:11:11.502610Z","submitted_at":"2025-02-17T19:00:10Z","title":"Roadmap to fault tolerant quantum computation using topological qubit arrays","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12252","snapshot_observed_at":"2026-08-05T20:57:07.106814Z","title":"Aasen, M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.106814Z"},"links":{"cited_paper":"/paper/2502.12252","citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:71b2bc14aec9cefd1ab76fd4bdc673e37031f8ca22085de194c3561f71c0f9b9","observation_id":"dbf648ec-3af7-4844-bfa1-af90669efdd5","resolution":{"observed_at":"2026-08-05T20:57:07.106814Z","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-05T20:57:08.402370Z","title":null,"venue":null,"work_id":"1ff4eca5-9684-4b10-a5f7-bfd21ad080b3","year":1980},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.112388Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:0f4ce45aa63fa41a7b5f7e4d488524ea5981b7a40a6029179bf0c71630219c18","observation_id":"0c69bd82-0958-44cb-902a-b76990c1838e","resolution":{"observed_at":"2026-08-05T20:57:08.406951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.387354Z","title":"Bouma and J","venue":null,"work_id":"fc860e42-1927-4734-b6a7-2b2c914f1f7c","year":1996},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.117306Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:b5d80885027bf742a982effe28e2170bf04fffedde1ead369065336e08a223a2","observation_id":"226202e8-ec86-4bc0-96f9-442ea5ccd3bf","resolution":{"observed_at":"2026-08-05T20:57:08.392034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.122788Z","title":"Compressing and Comparing the Generative Spaces of Procedural Con- tent Generators,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.122788Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:1df596863197ccb5a102bf220d427d1672680b44f8fa8f6c59d240998563fcf1","observation_id":"eaf758c1-f99f-4014-96f3-89a65fce7d4e","resolution":{"observed_at":"2026-08-05T20:57:07.122788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.12162","last_updated":"2024-12-11T16:26:03Z","snapshot_observed_at":"2026-08-08T09:25:34.679701Z","submitted_at":"2024-12-11T16:26:03Z","title":"Quandoom -- DOOM as a quantum circuit","version":1},"cited_work":{"arxiv_id":"2412.12162","doi":"10.48550/arxiv.2412.12162","metadata_source":"pith","pith_arxiv_id":"2412.12162","snapshot_observed_at":"2026-08-06T00:16:16.768632Z","title":"Quandoom -- DOOM as a quantum circuit","venue":"physics.pop-ph","work_id":"753c1f26-df23-4a74-8d0d-709b917e7c6f","year":2024},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.127504Z"},"links":{"cited_paper":"/paper/2412.12162","citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:f7744f1792c14050d64a630882e3d83fde432d16e118bc6fb1378c28cc16b650","observation_id":"5e6d50e4-19af-43fa-b8bd-a0ec2939805e","resolution":{"observed_at":"2026-08-05T20:57:07.511092Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.132806Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.132806Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:d33c30f64ae8caffd2d68d76d562babe660aa683093bde7207810b7b2072d124","observation_id":"3d3b08ea-cfa1-47ac-b750-e339c848b57e","resolution":{"observed_at":"2026-08-05T20:57:07.132806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.03719","last_updated":"2022-06-27T00:26:33Z","snapshot_observed_at":"2026-08-05T13:39:29.091521Z","submitted_at":"2018-04-10T21:08:57Z","title":"Quantum Algorithm Implementations for Beginners","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.03719","snapshot_observed_at":"2026-08-05T20:57:07.138180Z","title":"Quan- tum Algorithm Implementations for Beginners,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.138180Z"},"links":{"cited_paper":"/paper/1804.03719","citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:8899528ed108fe489fc3c3500962c742d64b5f20798b6fa1de6e4afd59101206","observation_id":"c2b69edc-2f36-4617-81bf-e246bdaf2cbf","resolution":{"observed_at":"2026-08-05T20:57:07.138180Z","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-05T20:57:08.371582Z","title":"Defining quantum games,","venue":null,"work_id":"280cc6c6-2164-41a3-aa74-23ec909a6b14","year":2025},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.143168Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:24c99f03fe3f4719429ea44e7c3d805df6e1efa694546e6155c95b9a352642e0","observation_id":"a6a70a03-6c5f-4360-9aaf-6008ae9ed86e","resolution":{"observed_at":"2026-08-05T20:57:08.376483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2942.34096","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.064769Z","title":"Procedural generation using quantum computation,","venue":null,"work_id":"4e0d1a0a-e096-4296-ae64-d71ebddc172e","year":2020},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.148627Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:bb50e85e30967277d2074d56161174f9513906c00348d062e923494dd6c48d89","observation_id":"8cdf7cb0-fbf7-454c-8c9f-c45b156a7dc9","resolution":{"observed_at":"2026-08-05T20:57:08.072981Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.154337Z","title":"A quantum procedure for map gen- eration,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.154337Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:438ff92e479963861895be7e883539959ec6fd5608fd97693da0a3841358ad20","observation_id":"3e52774b-89d1-40c3-8989-8caa12d7e7b3","resolution":{"observed_at":"2026-08-05T20:57:07.154337Z","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-05T20:57:07.159558Z","title":"Model Synthesis: A Gen- eral Procedural Modeling Algorithm,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.159558Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:08fb44ff8233df8710724e95659ee3b34eecde5d4112c078edccbe68937612d4","observation_id":"50905e62-33e0-4645-a2f5-e6a359993ee7","resolution":{"observed_at":"2026-08-05T20:57:07.159558Z","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":"1758.36980","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.894689Z","title":"Towards Wave Function Collapse using Optimization with Quantum Algorithms,","venue":null,"work_id":"8023dbab-9025-4325-bb85-0610bcf92f09","year":2024},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.164650Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:55a2762fda8c7df6e7865aca07e370149fe3140ae356bfb1b7cd9737b3f019ce","observation_id":"fab95471-9597-4033-a602-847180799e95","resolution":{"observed_at":"2026-08-05T20:57:07.902703Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.169933Z","title":"Quantum Wave Function Collapse for Pro- cedural Content Generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.169933Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:3a4f7e6bc288e6383df7b0f8e491383eddab30f84d9cbb7b75c070e30fa03f09","observation_id":"a7d31459-e530-4c1f-8b70-9f9693b92484","resolution":{"observed_at":"2026-08-05T20:57:07.169933Z","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.1145/3102071","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.461813Z","title":"WaveFunctionCollapse is constraint solving in the wild,","venue":null,"work_id":"42b6c8ba-3f87-4789-818f-7bc59a37a19d","year":2017},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.174696Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:aaeeb66e0199ac5bf1e4cf51cb4c421108367d5699dfdd1732d132748ac173a7","observation_id":"99b854a0-08a2-4be8-977b-5a0ef432bafa","resolution":{"observed_at":"2026-08-05T20:57:07.466678Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s42254-024-00796-z","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.444613Z","title":"Benchmarking quantum computers,","venue":null,"work_id":"5a57bb61-8ed8-4ffe-ba51-634811b82a77","year":2025},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.180247Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:1a73a83e52025f3e840848ac94e388771b85ebeedf86bc36a1400d4ddb521af5","observation_id":"cd5ec7c4-e5b8-4ba2-8bc3-5398401b9a20","resolution":{"observed_at":"2026-08-05T20:57:07.449006Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.355805Z","title":"Laakkonen, E","venue":null,"work_id":"6476ce69-aef6-40b3-8a0b-b5db8e9267f0","year":2025},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.184565Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:351a5e1675606b2155c7caadf7cada3fb1f61bf965ea981d64fad5601e295501","observation_id":"ea07f095-f922-45b6-9aaf-f6d1239524b1","resolution":{"observed_at":"2026-08-05T20:57:08.360185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.340471Z","title":"Why Oatmeal is Cheap: Kol- mogorov Complexity and Procedural Generation,","venue":null,"work_id":"61623895-c522-4c7c-9fd9-2728394c3efb","year":2023},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.188857Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:afc97c2f425db90d0953492e965ca2665433a8803f207204a55823e094d73e7a","observation_id":"47412640-0f88-4be6-a301-199b2fddd711","resolution":{"observed_at":"2026-08-05T20:57:08.345102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/dfu.v","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.427835Z","title":"Pro- cedural Content Generation: Goals, Challenges and Ac- tionable Steps,","venue":null,"work_id":"89a8107d-8def-4713-8844-0300a1594a92","year":2013},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.192945Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:346446b068ef4de4b31f501ba54d2c26c385bdd77d95c1e78efac70e8f209435","observation_id":"1c6a03b1-5f20-4ece-bd18-19af89ad0ed9","resolution":{"observed_at":"2026-08-05T20:57:07.432905Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.323899Z","title":"Con- ditions for a quadratic quantum speedup in nonlinear transforms with applications to energy contract pric- ing,","venue":null,"work_id":"963ebc70-fa6b-4b41-9aa1-2ff8aaf66bf4","year":2025},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.197249Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:928bec504971a00d649b5f377d441ac292e78c4bb044583f18e32dbc8baf515e","observation_id":"0b96d1d1-fc58-4f63-bca3-d095160130d8","resolution":{"observed_at":"2026-08-05T20:57:08.328957Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-05T20:57:07.201784Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.201784Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:e9599e2a3959e0ab236211d4838c1afd465ce13aca0ff4537c0a9b6ebf3a1010","observation_id":"c521a18c-2a05-4d4a-b1ea-dee66a437fc5","resolution":{"observed_at":"2026-08-05T20:57:07.201784Z","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.1007/978-3-031-16719-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.393511Z","title":"Guzdial, S","venue":null,"work_id":"ae361f5d-fe15-4b7b-bc69-49006f956cfc","year":2022},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.207054Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:8d0e51a63dd2920ac1ebd92f9294bdb0c3f341d950a98a8fdbaec65155e571fa","observation_id":"b5ad009a-f1dd-4815-8282-21610c3c3bcc","resolution":{"observed_at":"2026-08-05T20:57:07.398047Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07059","last_updated":"2024-03-14T11:02:26Z","snapshot_observed_at":"2026-08-08T09:24:36.428852Z","submitted_at":"2024-03-11T18:00:06Z","title":"Better than classical? The subtle art of benchmarking quantum machine learning models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07059","snapshot_observed_at":"2026-08-05T20:57:07.211869Z","title":"Better than clas- sical? The subtle art of benchmarking quantum machine learning models,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.211869Z"},"links":{"cited_paper":"/paper/2403.07059","citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:bcc8af6e07867b94b8f08524ce3df0f3d66bafea68696e05a669b6291405a6f4","observation_id":"3184d548-5929-4996-860b-b8d1186e27e3","resolution":{"observed_at":"2026-08-05T20:57:07.211869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00727","last_updated":"2022-11-01T20:12:35Z","snapshot_observed_at":"2026-08-08T03:03:18.141517Z","submitted_at":"2022-11-01T20:12:35Z","title":"Quantum Natural Language Generation on Near-Term Devices","version":1},"cited_work":{"arxiv_id":"2211.00727","doi":"10.48550/arxiv.2211.00727","metadata_source":"pith","pith_arxiv_id":"2211.00727","snapshot_observed_at":"2026-08-06T00:16:16.768632Z","title":"Quantum Natural Language Generation on Near-Term Devices","venue":"quant-ph","work_id":"be3ce78d-53b5-4149-aab8-e5a46e3039d0","year":2022},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.217501Z"},"links":{"cited_paper":"/paper/2211.00727","citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:48365b7c2d7f01325dd1815b7d1b2604c8c67143404a3f2b37e378920ca08a79","observation_id":"d2a5fdb9-e8de-450a-aecc-88b32aced619","resolution":{"observed_at":"2026-08-05T20:57:07.380508Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tciaig","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.723681Z","title":"Answer Set Programming for Procedural Content Generation: A Design Space Approach,","venue":null,"work_id":"7742ed41-9113-4629-bc6d-af6ffc517094","year":2011},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.222114Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:edf3d4c672655d27cb5a53eaa829037aab527cc4541b511d28d1f297008801ed","observation_id":"322a8634-2530-4870-92e5-cbec3f60006e","resolution":{"observed_at":"2026-08-05T20:57:07.729781Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.307549Z","title":"Machine learning for combinatorial optimization: A methodological tour d’horizon,","venue":null,"work_id":"5e5222e5-5b37-47c7-9ebc-0a46ee2bf8fb","year":2021},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.226168Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:27f13b29ce64bd6524361b7bf9ea84b4aa28b2b87232b3759ea81f295a8915c9","observation_id":"b71673f6-bb8c-4514-8963-1a99efb42b15","resolution":{"observed_at":"2026-08-05T20:57:08.312121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.292352Z","title":"Practical Implementa- tion of a Quantum Backtracking Algorithm,","venue":null,"work_id":"dc176faf-60ee-4851-a473-b11213ad9a81","year":2020},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.236043Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:4f16845dd2de13eba3925d86505cac8c140dcff40f6eeadd95bd8c138312dd72","observation_id":"8d2f27f3-b1db-49fe-afdf-183637dd7a98","resolution":{"observed_at":"2026-08-05T20:57:08.296959Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.276496Z","title":null,"venue":null,"work_id":"59693c40-5309-4b9c-995c-ab117a11e039","year":2024},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.240705Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:ebfd5833c08b45b54fe041f9eb7558b735f3465aecb14626481d7b5343d7bf17","observation_id":"11146791-95e4-4932-9cc8-59a500f2f49b","resolution":{"observed_at":"2026-08-05T20:57:08.281494Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.259730Z","title":"Search-based procedural content generation: A taxonomy and survey,","venue":null,"work_id":"c8e5c5bb-7b02-43cf-b660-6e50cc96cde4","year":2011},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.246095Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:cf395aa2d06ab804f70cc6cf110fbe6e2b0d7516deb7efa3109772144f9d4e4c","observation_id":"0da46bcc-09a1-49db-841f-bb879085ee4d","resolution":{"observed_at":"2026-08-05T20:57:08.264986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.243187Z","title":"Quantum vs clas- sical genetic algorithms: A numerical comparison shows faster convergence,","venue":null,"work_id":"39d8758c-441c-43cc-afd1-6306146fad20","year":2022},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.250697Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:38f61ddb4f0aaf6368ff5c36b6cc142fbedfa4452d9c305cd7ae08f59c30ec4e","observation_id":"608d0581-c15d-4f5e-bade-2628a0ede2a9","resolution":{"observed_at":"2026-08-05T20:57:08.248199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.259854Z","title":"Shaker, J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.259854Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:b53efdca95115a3cb3c16aeb93f8c4871f4a80a9674257d9a012e0f89bac53c8","observation_id":"9f3e70db-e093-4fef-96f6-2e404aa5a956","resolution":{"observed_at":"2026-08-05T20:57:07.259854Z","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-05T20:57:08.227000Z","title":"Quantum automata and quantum grammars,","venue":null,"work_id":"fc105893-8f7d-4f69-bf00-786ee3d09028","year":2000},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.264966Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:62147a72063146fd064fe55b48dfcf751b30424c29dc2f16dcc44a0abbe33cd2","observation_id":"ef65bdf7-9e70-48ef-8d34-e18754d0ee9d","resolution":{"observed_at":"2026-08-05T20:57:08.232213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.209836Z","title":"A comprehensive review of quantum machine learning: From NISQ to fault toler- ance,","venue":null,"work_id":"815ce8d0-bce0-4234-ae03-337db92b86de","year":2024},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.274850Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:ed359772012e7a4b6c6f70f4590d99b475b52dc3dae67de6a609aba75b084288","observation_id":"be667732-2290-471e-9e35-f16b587c6293","resolution":{"observed_at":"2026-08-05T20:57:08.215115Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:08.193694Z","title":"Example-Based Procedural Modeling Using Graph Grammars,","venue":null,"work_id":"e7e34f00-d141-4da7-8008-79e4defc1c5b","year":2023},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.281891Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:d41774ae4e1d6c7b0f1c4cbf407d082b02352eefc17a3cf39ba1ab97a2a70c93","observation_id":"50148abb-4342-419a-a95c-c51549fe5eac","resolution":{"observed_at":"2026-08-05T20:57:08.198827Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.286282Z","title":"Quantum algorithms for graph problems with cut queries,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.286282Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:095b20e5d4923448e4d9d264948b2ad7615f91bc1f60b8b5dd7821b882ac90d8","observation_id":"3425bdd2-dacf-486f-8c70-304eb7c0b7d1","resolution":{"observed_at":"2026-08-05T20:57:07.286282Z","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":"1031.2022","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.635266Z","title":null,"venue":null,"work_id":"4dfacd7b-4ab1-48ed-98a3-c228be9d52ac","year":2022},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":954,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.255505Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:45deecce9d172b4bd8d7e63d67e5e6021aaa81407faa85409f93dbb0052ea3b2","observation_id":"7b05271a-6797-45d1-aca8-aef91d153932","resolution":{"observed_at":"2026-08-05T20:57:07.643045Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:57:07.231258Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":2217,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.231258Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:898e96790f8339f9b00377d4d7de55cb0b1de130211a31bf484a2e6c422e9a24","observation_id":"e14ba5ef-b13e-4085-931a-07f2221fa2f6","resolution":{"observed_at":"2026-08-05T20:57:07.231258Z","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-05T20:57:07.269569Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":3975,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.269569Z"},"links":{"citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:2740b479176937069e4547c92fdfd00bcccc08dc81f0da5e9abd3c9d5468964a","observation_id":"9d5b35ce-2c1b-43c0-ac22-4739e9e6e922","resolution":{"observed_at":"2026-08-05T20:57:07.269569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":7,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":15,"verified_exact":6,"verified_fuzzy":8},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2508.09683."}