{"as_of":"2026-08-09T05:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:be90ff8c8e9e11cb3bc95a8762d1cc4d82d7cbf054b138df3fd49f1578fafb2b","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":43,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:36:45.910061Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":69,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"1907.03044","last_updated":"2019-07-05T23:03:28Z","snapshot_observed_at":"2026-07-06T08:05:29.572386Z","submitted_at":"2019-07-05T23:03:28Z","title":"Credit Risk Analysis using Quantum Computers","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-25T01:54:59.533164Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/1907.03044"},"observation_digest":"sha256:987427daa92a8c6c056c25e38c2925591ccc40e8a9484b95f836ec5bbe8b4c37","observation_id":"ecf18ff0-5ea7-4170-b0dc-3a9045f6b11a","resolution":{"observed_at":"2026-05-25T01:55:11.680647Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2401.15829","last_updated":"2026-04-06T05:49:23Z","snapshot_observed_at":"2026-07-06T17:21:34.093816Z","submitted_at":"2024-01-29T01:28:42Z","title":"Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice","version":6},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T04:54:59.680417Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2401.15829"},"observation_digest":"sha256:94ff87ea22dff460b9f231c1d3ddc9960ee9ce7d94ce153cb84d34b454147875","observation_id":"3f58777f-5012-4d3e-86de-52e27450e892","resolution":{"observed_at":"2026-05-24T04:56:00.291106Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2406.09340","last_updated":"2025-06-02T08:19:28Z","snapshot_observed_at":"2026-07-06T18:30:28.421247Z","submitted_at":"2024-06-13T17:20:49Z","title":"Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers","version":2},"reference_index":116,"source":"pdf_text","source_observed_at":"2026-05-24T00:17:59.927743Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2406.09340"},"observation_digest":"sha256:bda644f75d5f32a57fc02af699ed5b6dc4b2c6b267947804ecd01abc6980856d","observation_id":"439c7983-77e1-4bab-9370-a2d8ab192d3c","resolution":{"observed_at":"2026-05-24T00:18:39.153611Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2409.17595","last_updated":"2024-09-26T07:21:58Z","snapshot_observed_at":"2026-07-06T19:22:36.876751Z","submitted_at":"2024-09-26T07:21:58Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-13T00:09:25.996037Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2409.17595"},"observation_digest":"sha256:a811eb035764340eeb078ffd86e68c07e32b92e41fd00bb8a3834722f40941ae","observation_id":"7df146ff-4d38-42b9-b9b4-edbb0f5cbae5","resolution":{"observed_at":"2026-05-13T00:09:26.536281Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2410.13759","last_updated":"2025-02-17T22:16:30Z","snapshot_observed_at":"2026-07-06T19:35:26.421419Z","submitted_at":"2024-10-17T16:54:41Z","title":"On the practicality of quantum sieving algorithms for the shortest vector problem","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-05-23T18:34:16.823293Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2410.13759"},"observation_digest":"sha256:e7571e019a07a184c92064bd13f207e2137f66736179ff4be74bfcccec9eecb2","observation_id":"e1e8d7e2-6f35-4d00-a70c-faafa6a880c6","resolution":{"observed_at":"2026-05-23T18:35:46.172880Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2504.05611","last_updated":"2026-04-30T18:16:03Z","snapshot_observed_at":"2026-08-09T03:41:28.494090Z","submitted_at":"2025-04-08T01:56:19Z","title":"Transversal Fault Tolerant Distributed Quantum Computing Operations","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-22T21:03:07.651596Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2504.05611"},"observation_digest":"sha256:b632333cf1ae8a87109b504096e35be38df2bac46bff4e046727ba7eb6123040","observation_id":"8c9d5e83-f9ec-4772-b021-656346ec7155","resolution":{"observed_at":"2026-05-22T21:05:09.783010Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-07T04:36:45.910061Z","title":"Fowler and Craig Gidney","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.10258","last_updated":"2025-06-12T00:57:49Z","snapshot_observed_at":"2026-08-08T17:11:48.816348Z","submitted_at":"2025-06-12T00:57:49Z","title":"Synchronization for Fault-Tolerant Quantum Computers","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:36:45.910061Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2506.10258"},"observation_digest":"sha256:4b1ac494962e02e8cd02eb744080a80aa647a71d0638a4e02cd357865599fe22","observation_id":"504780e2-483e-474a-854a-7935532bd367","resolution":{"observed_at":"2026-08-07T04:36:45.910061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-06T16:48:44.426703Z","title":"Low overhead quan- tum computation using lattice surgery","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.12511","last_updated":"2025-07-16T18:00:00Z","snapshot_observed_at":"2026-08-06T16:42:30.539435Z","submitted_at":"2025-07-16T18:00:00Z","title":"Unfolded distillation: very low-cost magic state preparation for biased-noise qubits","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T16:48:44.426703Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2507.12511"},"observation_digest":"sha256:fba23d802d444e58c8544caa483ce13d78a87b096809c1156cf51dc3462a23c7","observation_id":"2777d713-f89d-4c8b-b5c6-0bde43a940fa","resolution":{"observed_at":"2026-08-06T16:48:44.426703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-06T14:17:47.011380Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.19713","last_updated":"2025-07-25T23:26:48Z","snapshot_observed_at":"2026-08-08T23:32:21.794382Z","submitted_at":"2025-07-25T23:26:48Z","title":"Exponentially robust non-Clifford gate in a driven-dissipative circuit","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:47.011380Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2507.19713"},"observation_digest":"sha256:26f00655c024b109feae07c48aaf127b4f0b11747bc0a0b8119d63719a863dc1","observation_id":"dc0b9ebf-a200-4874-b911-e0dca0f28b5f","resolution":{"observed_at":"2026-08-06T14:17:47.011380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2508.06236","last_updated":"2025-08-08T11:38:41Z","snapshot_observed_at":"2026-08-02T18:46:19.714352Z","submitted_at":"2025-08-08T11:38:41Z","title":"Space and Time Cost of Continuous Rotations in Surface Codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T00:30:15.208196Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2508.06236"},"observation_digest":"sha256:1f3a53d4e0a5edbe612ec0b298714be468a19779368f3c3941dec78fd62399aa","observation_id":"39b31a16-78f6-46e0-8579-f3e1a77bd75e","resolution":{"observed_at":"2026-05-19T00:31:55.708984Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T18:37:04.479542Z","title":"Low overhead quantum compu- tation using lattice surgery,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.14533","last_updated":"2025-08-20T08:40:32Z","snapshot_observed_at":"2026-08-08T21:38:49.538247Z","submitted_at":"2025-08-20T08:40:32Z","title":"Trace-Based Reconstruction of Quantum Circuit Dataflow in Surface Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T18:37:04.479542Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2508.14533"},"observation_digest":"sha256:ca66d2bbc1abd13acec737ced829aec51e37319174a09ee259a0b64627644b6f","observation_id":"5fd890a5-bb86-4198-a4de-1dbca4258f70","resolution":{"observed_at":"2026-08-05T18:37:04.479542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T18:03:16.743224Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.15314","last_updated":"2025-08-27T08:48:35Z","snapshot_observed_at":"2026-08-08T00:36:25.357926Z","submitted_at":"2025-08-21T07:15:18Z","title":"VideoEraser: Concept Erasure in Text-to-Video Diffusion Models","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T18:03:16.743224Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2508.15314"},"observation_digest":"sha256:79ed20bb96d33e237322d57f548fdf0cff53f5a3beed57f17d124370c1fa4edd","observation_id":"4d392a63-9f2b-408f-ae86-b948c609f8b8","resolution":{"observed_at":"2026-08-05T18:03:16.743224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2508.19160","last_updated":"2026-04-23T17:16:44Z","snapshot_observed_at":"2026-07-06T22:19:00.152099Z","submitted_at":"2025-08-26T16:09:45Z","title":"Architecting Distributed Quantum Computers: Design Insights from Resource Estimation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-18T21:14:24.329406Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2508.19160"},"observation_digest":"sha256:fc55d0fd116398d6f515afef6f970ba95f5fb0e1cbd88c4a962c8d06a111c987","observation_id":"e5383c56-52e8-42c4-8ebf-b2c598deeae1","resolution":{"observed_at":"2026-05-09T07:24:15.406091Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-04T20:14:27.139092Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.08807","last_updated":"2025-09-10T17:40:19Z","snapshot_observed_at":"2026-08-07T11:15:02.335135Z","submitted_at":"2025-09-10T17:40:19Z","title":"A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T20:14:27.139092Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2509.08807"},"observation_digest":"sha256:53132446e11d07e906741453cb89382579c3e00bde6101e15beaf1399ab56077","observation_id":"64cbf05c-01a7-4c64-9b7e-a44652d64691","resolution":{"observed_at":"2026-08-04T20:14:27.139092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-04T18:37:22.966994Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09882","last_updated":"2025-09-11T22:26:57Z","snapshot_observed_at":"2026-08-08T11:35:30.159818Z","submitted_at":"2025-09-11T22:26:57Z","title":"Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:22.966994Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2509.09882"},"observation_digest":"sha256:6f23c09cd515ae2adcdf900fabcbbffdaa7cf504e2b668965f5bd78ef4258664","observation_id":"428d6201-2584-44a2-9851-eb399293d0fa","resolution":{"observed_at":"2026-08-04T18:37:22.966994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-04T15:51:50.422084Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.18294","last_updated":"2026-05-29T17:17:12Z","snapshot_observed_at":"2026-08-04T15:50:28.664459Z","submitted_at":"2025-09-22T18:23:28Z","title":"Transversal architecture for megaquop-scale quantum simulation with neutral atoms","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.422084Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2509.18294"},"observation_digest":"sha256:ea5aee262f3f51076564eac109e1b52356ad30107207289a30978292f02e5170","observation_id":"13094123-b5e1-4303-aad5-278d7c5c9ba6","resolution":{"observed_at":"2026-08-04T15:51:50.422084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-04T10:54:42.795325Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.08290","last_updated":"2026-06-25T05:49:44Z","snapshot_observed_at":"2026-08-08T07:08:10.091523Z","submitted_at":"2025-10-09T14:42:35Z","title":"Theory and Architecture of Syndrome-Resolved Logical Gates","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T10:54:42.795325Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2510.08290"},"observation_digest":"sha256:9d159ad956636cf91906167a61efed47f51eb79f1863fb741f8a870c47fe64e5","observation_id":"c8d8abe8-9be1-4260-9fa0-3d1a09c6174a","resolution":{"observed_at":"2026-08-04T10:54:42.795325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2511.06758","last_updated":"2026-05-16T06:34:40Z","snapshot_observed_at":"2026-07-06T22:35:22.282985Z","submitted_at":"2025-11-10T06:36:55Z","title":"Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T20:08:33.007139Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2511.06758"},"observation_digest":"sha256:7e79822ed852b0917e080cb12cafe5078b63cba2770a5405f5d445470fdbabc9","observation_id":"29b345d5-4d31-467e-bb97-bb03c9d16eb2","resolution":{"observed_at":"2026-05-21T20:10:34.660976Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-02T23:50:44.834241Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.13395","last_updated":"2026-07-12T21:35:59Z","snapshot_observed_at":"2026-08-05T20:57:21.779908Z","submitted_at":"2026-02-13T19:00:44Z","title":"No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T23:50:44.834241Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2602.13395"},"observation_digest":"sha256:023ad4535ab4bfdb5ece472cc86e02b61c284b5205b367d0d2bae69b1a76f086","observation_id":"6e858b5d-3f59-4cc6-a0fa-17070db4beb6","resolution":{"observed_at":"2026-08-02T23:50:44.834241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-02T21:27:58.918826Z","title":"Low overhead quantum computation using lattice surgery,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.20546","last_updated":"2026-06-02T15:13:30Z","snapshot_observed_at":"2026-08-02T21:27:53.468174Z","submitted_at":"2026-02-24T04:57:42Z","title":"Distilling Magic States in the Bicycle Architecture","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T21:27:58.918826Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2602.20546"},"observation_digest":"sha256:80b19f286a44f31d6d3bbcb74c87d5339cc960d842012165073633851cfdc81c","observation_id":"95b49623-0434-423d-9880-6244bcc6e29e","resolution":{"observed_at":"2026-08-02T21:27:58.918826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-02T19:38:17.271264Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.01628","last_updated":"2026-06-20T01:42:06Z","snapshot_observed_at":"2026-08-08T23:01:02.822240Z","submitted_at":"2026-03-02T09:05:21Z","title":"No More Hooks in the Surface Code: Distance-Preserving Syndrome Extraction for Arbitrary Layouts at Minimum Depth","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T19:38:17.271264Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2603.01628"},"observation_digest":"sha256:aace636d2ee7c03344d03feefdd407d41c7d61906ba6aa04ff041bc2c7253fa1","observation_id":"a7664c31-e872-4e4f-8b6b-5231bed96058","resolution":{"observed_at":"2026-08-02T19:38:17.271264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2604.12560","last_updated":"2026-04-14T10:42:01Z","snapshot_observed_at":"2026-07-06T23:00:46.620106Z","submitted_at":"2026-04-14T10:42:01Z","title":"Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T15:42:01.820350Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2604.12560"},"observation_digest":"sha256:457b0dca5850480089b9036cbb261d6fa3ea97e48e76a47f6d80981dd10fd320","observation_id":"d27cee1d-6606-4d90-a3a9-988ae475825e","resolution":{"observed_at":"2026-05-10T15:45:33.892290Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2604.12841","last_updated":"2026-04-14T15:01:05Z","snapshot_observed_at":"2026-07-30T06:32:01.859046Z","submitted_at":"2026-04-14T15:01:05Z","title":"Fast and accurate AI-based pre-decoders for surface codes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T16:01:25.228677Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2604.12841"},"observation_digest":"sha256:86ca0490eadbf363f4a243863bb467f6c236ef658e14e389686f0737c73110a2","observation_id":"e6dd95e4-d677-4090-9722-3d4cf728f49b","resolution":{"observed_at":"2026-05-11T09:26:01.812379Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2604.21468","last_updated":"2026-07-01T05:02:10Z","snapshot_observed_at":"2026-08-07T22:10:34.893183Z","submitted_at":"2026-04-23T09:28:19Z","title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-05T01:27:19.545404Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2604.21468"},"observation_digest":"sha256:db4efc5f4c25d438607d6660fc9fcdd5608fc5947fe5260cb0ce1aa3f9e7b190","observation_id":"6cf24964-bdae-46a1-ab15-4f392c6146d7","resolution":{"observed_at":"2026-07-05T01:30:37.165461Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2604.21472","last_updated":"2026-06-03T02:27:08Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-23T09:30:00Z","title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-09T22:30:01.774437Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2604.21472"},"observation_digest":"sha256:1d6582a7586c0b9abc4174455af8ab854b0132715f763090309c7240db0a10a4","observation_id":"0b7e093d-98a8-47ba-89f9-20e64fc08210","resolution":{"observed_at":"2026-05-09T22:34:07.054513Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2604.25524","last_updated":"2026-04-28T11:47:03Z","snapshot_observed_at":"2026-07-06T23:11:21.433834Z","submitted_at":"2026-04-28T11:47:03Z","title":"Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-07T16:55:45.913723Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2604.25524"},"observation_digest":"sha256:d92f3ba4d17724e93ba740807cd9764a9c19d9d72f87a9e4840becc1f1c32fee","observation_id":"9f2dbb91-963f-4009-b8b9-382ffa937c32","resolution":{"observed_at":"2026-05-11T23:31:13.805939Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2605.04049","last_updated":"2026-05-06T02:47:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T17:59:59Z","title":"FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T18:39:25.009829Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2605.04049"},"observation_digest":"sha256:213e44570f6b55870a1c64071b6a851c86b745384fa49ec51c9e269b6ddce389","observation_id":"d05c73c2-51c3-4e39-894d-3b1441f2faa7","resolution":{"observed_at":"2026-05-09T06:15:39.422382Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2605.04459","last_updated":"2026-05-06T03:39:24Z","snapshot_observed_at":"2026-07-06T23:17:13.770090Z","submitted_at":"2026-05-06T03:39:24Z","title":"Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-08T18:16:43.975309Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2605.04459"},"observation_digest":"sha256:1b37a5ad973517f54d1061df7d5816e0d3b145ff5bfa56b7c7b2a1250d7078e8","observation_id":"ce327634-6fa2-4c7a-b254-d3a5d366b7f2","resolution":{"observed_at":"2026-05-09T06:35:41.042544Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2605.05315","last_updated":"2026-05-06T18:00:09Z","snapshot_observed_at":"2026-08-08T08:15:28.868034Z","submitted_at":"2026-05-06T18:00:09Z","title":"Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-05-08T17:19:15.359980Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2605.05315"},"observation_digest":"sha256:839e14b2e10d97ef7d3038e33f6db5956c8963a29b9fee6339fe4b6a661c71d7","observation_id":"d82deb22-cbfa-415c-bbc1-de850b7440b3","resolution":{"observed_at":"2026-05-11T17:41:08.191062Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2605.12600","last_updated":"2026-05-12T18:00:04Z","snapshot_observed_at":"2026-07-06T23:24:18.302402Z","submitted_at":"2026-05-12T18:00:04Z","title":"Fermion lattices can be simulated by same-size qubit lattices with $\\mathcal{O}(1)$ interaction overhead","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-14T20:40:10.873603Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2605.12600"},"observation_digest":"sha256:e9ac159dcec418516ff7ba553a883c09bf67fc0665f4a97a8b3a09eecf49b3b9","observation_id":"13ea0f18-20cb-420b-b343-72b1b71662ea","resolution":{"observed_at":"2026-05-14T20:42:58.185895Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2605.19471","last_updated":"2026-05-19T07:22:47Z","snapshot_observed_at":"2026-08-02T10:09:26.035384Z","submitted_at":"2026-05-19T07:22:47Z","title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T05:57:28.304470Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2605.19471"},"observation_digest":"sha256:4242bba2f736965710baf9909e10d92fa0f792e692ea4afa6cb9e53a7dcf975a","observation_id":"6a1ebe62-80ef-4313-b159-8f7d76cff8dd","resolution":{"observed_at":"2026-05-20T05:58:05.032205Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2605.21746","last_updated":"2026-05-20T21:17:42Z","snapshot_observed_at":"2026-07-06T23:32:10.472558Z","submitted_at":"2026-05-20T21:17:42Z","title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T08:39:29.459668Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2605.21746"},"observation_digest":"sha256:fd1333f4dc68aea56d6f04b65740624feadfdbc243296f58eca734ea3bee2b7e","observation_id":"49ca7d87-dc4a-4c7d-8bc0-6338baaaa5e2","resolution":{"observed_at":"2026-05-22T08:41:16.866176Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2605.31544","last_updated":"2026-06-11T13:58:50Z","snapshot_observed_at":"2026-08-02T11:14:24.503145Z","submitted_at":"2026-05-29T16:59:34Z","title":"More efficient Clifford+T synthesis for small-angle rotations and application to Trotterization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T21:42:03.351546Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2605.31544"},"observation_digest":"sha256:f643dbfabedd47d9be2ffdd09959ec2388ebdb2f7c1e6e10209d9f0bd1294cbf","observation_id":"995c54c2-cf1e-4db9-adbe-e665a5389e7d","resolution":{"observed_at":"2026-07-01T20:06:11.788950Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2606.07734","last_updated":"2026-07-09T08:31:58Z","snapshot_observed_at":"2026-07-12T23:17:33.087864Z","submitted_at":"2026-06-05T18:00:00Z","title":"Exploring the landscape of compact magic-state distillation factories","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T21:27:39.552180Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2606.07734"},"observation_digest":"sha256:914c647be09df6d251527ac3d4b9b7f314acba0c4f76aac7630401eaa52aeb92","observation_id":"2763f7c3-f861-46d6-b1b9-350c0a640c14","resolution":{"observed_at":"2026-07-02T19:37:19.244446Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-07-12T14:49:51.418401Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.07734","last_updated":"2026-07-09T08:31:58Z","snapshot_observed_at":"2026-07-12T23:17:33.087864Z","submitted_at":"2026-06-05T18:00:00Z","title":"Exploring the landscape of compact magic-state distillation factories","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T14:49:51.418401Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2606.07734"},"observation_digest":"sha256:cda3faa2237208f71b2268403b5bc43128e2ef8b3dad50d4d292a0a914e697fc","observation_id":"dee33539-51e2-4526-8af6-491012c77557","resolution":{"observed_at":"2026-07-12T14:49:51.418401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2606.19593","last_updated":"2026-06-17T20:47:45Z","snapshot_observed_at":"2026-07-31T05:44:32.205331Z","submitted_at":"2026-06-17T20:47:45Z","title":"Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T20:16:22.729997Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2606.19593"},"observation_digest":"sha256:eca1c0e7127d1f9797745a5f0ce8ecd9109aa2b022ffd155a0376a4e8bdcac36","observation_id":"58120d01-ac70-4da3-ab74-81653c61fabc","resolution":{"observed_at":"2026-07-04T01:39:24.960662Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":"1808.06709","doi":"10.48550/arxiv.1808.06709","metadata_source":"pith","pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Low overhead quantum computation using lattice surgery","venue":"quant-ph","work_id":"3f3e7a3a-dfc7-4ad2-bc4c-ec5ba87c34b5","year":2018},"citing_paper":{"arxiv_id":"2606.21192","last_updated":"2026-06-19T08:03:26Z","snapshot_observed_at":"2026-07-06T23:56:12.374739Z","submitted_at":"2026-06-19T08:03:26Z","title":"Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T14:35:06.211082Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2606.21192"},"observation_digest":"sha256:160321029515ffbf625d1e063ff64cc6a8d9c58b8bf131019d9602edf2e43677","observation_id":"d4f96324-9046-4fcf-bcb8-4d0b6fa27254","resolution":{"observed_at":"2026-07-04T06:19:38.531031Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:50.490105+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-07-11T06:45:48.562961Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.05501","last_updated":"2026-07-06T18:00:02Z","snapshot_observed_at":"2026-07-11T06:45:46.739300Z","submitted_at":"2026-07-06T18:00:02Z","title":"Towards Lattice Surgery Compilation for the Color Code Using Pipe Diagrams","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-11T06:45:48.562961Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2607.05501"},"observation_digest":"sha256:56e9dec85c8099a3ffd019c24921946efe779891dc33ea0eb93d6e7144508163","observation_id":"49a71832-0090-49d7-8e51-91d23c974e6a","resolution":{"observed_at":"2026-07-11T06:45:48.562961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-02T02:20:54.060109Z","title":"arXiv preprint arXiv:1808.06709 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15313","last_updated":"2026-07-15T21:28:59Z","snapshot_observed_at":"2026-08-06T21:03:28.527492Z","submitted_at":"2026-07-15T21:28:59Z","title":"Position: Quantum Program Generation Must Prioritize Validity Over Probabilistic Scaling","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-02T02:20:54.060109Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2607.15313"},"observation_digest":"sha256:799e4a3f840be2ec62c2fe7dfe15dbfb5ef7e4736bd69afd0e69153fd3ce435b","observation_id":"7efeb1b8-e2eb-4e24-ae99-7c5488a5544c","resolution":{"observed_at":"2026-08-02T02:20:54.060109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-01T23:29:03.365939Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.15426","last_updated":"2026-07-16T19:57:17Z","snapshot_observed_at":"2026-08-03T20:05:21.838493Z","submitted_at":"2026-07-16T19:57:17Z","title":"Performance Model for Hybrid Quantum-Classical Workflows","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T23:29:03.365939Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2607.15426"},"observation_digest":"sha256:bca66b6f95bd5c70d695baee2e2df94583806913116bd76a2fb8f7d98e27d678","observation_id":"028d30eb-2118-4058-a1cf-1ed364986dae","resolution":{"observed_at":"2026-08-01T23:29:03.365939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-01T15:47:31.455805Z","title":"Low overhead quan- tum computation using lattice surgery.arXiv preprint arXiv:1808.06709, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.18204","last_updated":"2026-08-05T14:03:33Z","snapshot_observed_at":"2026-08-08T23:13:03.817431Z","submitted_at":"2026-07-20T17:43:08Z","title":"QuantiSpect: A Structure-Aware Lightweight 3D CNN Pre-Decoder for Scalable Surface Code Quantum Error Correction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T15:47:31.455805Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2607.18204"},"observation_digest":"sha256:c743b90c78218646b1910fe25e8ea37de8eb7f7b52ebba2a8ce0cccb3e637fea","observation_id":"fc54b9de-4dd0-48ff-8b7c-c9426fdd4b8e","resolution":{"observed_at":"2026-08-01T15:47:31.455805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-08-01T10:43:17.811435Z","title":"Low overhead quan- tum computation using lattice surgery.arXiv preprint arXiv:1808.06709, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20143","last_updated":"2026-07-22T13:45:09Z","snapshot_observed_at":"2026-08-08T18:03:18.313721Z","submitted_at":"2026-07-22T13:45:09Z","title":"Biased-noise qubits: a guide to efficient fault-tolerance using the hierarchy of errors","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-01T10:43:17.811435Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2607.20143"},"observation_digest":"sha256:672929b5f6c9f22889edfe4f0428119cbbf62ce6884d29b0f4856ad78645f3ef","observation_id":"b6cb7d66-761f-4bc6-92e2-f462908b19dc","resolution":{"observed_at":"2026-08-01T10:43:17.811435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06709","snapshot_observed_at":"2026-07-31T06:22:10.716313Z","title":"Low overhead quan- tum computation using lattice surgery,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24907","last_updated":"2026-07-29T06:48:41Z","snapshot_observed_at":"2026-08-04T06:57:42.355589Z","submitted_at":"2026-07-27T18:00:00Z","title":"Fault-tolerant distributed quantum computing with a single nucleus per node","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-31T06:22:10.716313Z"},"links":{"cited_paper":"/paper/1808.06709","citing_paper":"/paper/2607.24907"},"observation_digest":"sha256:4be8a0c1af52c47a9bca2b7e9b4bcbff3602e3a9f12611e3f7b49d3fd8712b76","observation_id":"88eed685-4fe6-4834-944b-48b9a0da9664","resolution":{"observed_at":"2026-07-31T06:22:10.716313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1808.06709/citation-record","integrity":"/paper/1808.06709/integrity","json":"/paper/1808.06709/citation-record.json","paper":"/paper/1808.06709"},"outbound":[],"paper":{"arxiv_id":"1808.06709","last_updated":"2019-08-30T22:12:41Z","latest_version":4,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T18:47:58.488894Z","submitted_at":"2018-08-20T22:09:39Z","title":"Low overhead quantum computation using lattice surgery"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 43 inbound Pith citation observations for arXiv:1808.06709."}