{"as_of":"2026-08-18T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77390b8f00c632739779850418e425a739e72d8651bc11ca270e37ad1e98e21d","coverage":[{"denominator":81,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":81,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:55:03.494981Z","state":"measured"},{"denominator":82,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":82,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T20:48:28.471997Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.20387","snapshot_observed_at":"2026-07-11T20:48:28.471997Z","title":"Nelson, Andrew J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04227","last_updated":"2026-07-05T11:01:11Z","snapshot_observed_at":"2026-08-12T22:49:55.570023Z","submitted_at":"2026-07-05T11:01:11Z","title":"Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-11T20:48:28.471997Z"},"links":{"cited_paper":"/paper/2507.20387","citing_paper":"/paper/2607.04227"},"observation_digest":"sha256:1c0d942757c7e369cdb5d316f6eb7d8f129cc3ad30f42520e078290bcb092abb","observation_id":"075b959b-b87d-4760-a2e9-52a56e1e7565","resolution":{"observed_at":"2026-07-11T20:48:28.471997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.20387/citation-record","integrity":"/paper/2507.20387/integrity","json":"/paper/2507.20387/citation-record.json","paper":"/paper/2507.20387"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:55:03.250733Z","title":"Realization of real-time fault-tolerant quantum error correction","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.250733Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:97da8a5c424749325c57afc6e7a2e87369a00092322196f304d1ed37c2fb482c","observation_id":"0cb9d695-00b1-42fc-a794-c50092c6f365","resolution":{"observed_at":"2026-08-15T17:55:03.250733Z","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-15T17:55:04.399519Z","title":"Suppressing quantum errors by scaling a surface code logical qubit","venue":null,"work_id":"ff6f7534-6a10-406b-82a7-10edea7a0925","year":2023},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.254603Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:ed70ea876e53050b320a21284143cc5e005243a7fb77cb2aec56be7cfe25564e","observation_id":"32279929-febb-4198-a004-9a2b23b5dac9","resolution":{"observed_at":"2026-08-15T17:55:04.402078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.391216Z","title":"Logical quantum processor based on reconfigurable atom arrays","venue":null,"work_id":"3451a6d0-c3d1-4e7b-bdcc-554dcb971fac","year":2023},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.258116Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:7b556434d7f07917987e311892f62264d8d9cf6019f662e422caac9e662da76b","observation_id":"347dc8b9-2c63-4564-bc65-2c9ca4455c66","resolution":{"observed_at":"2026-08-15T17:55:04.393671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.382729Z","title":"Fault-tolerant one-bit addition with the smallest interesting color code","venue":null,"work_id":"afc30181-4c04-4d8a-9218-3cbc42ef5313","year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.261191Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:fb8633f5c4eb8e59a8ca02510f832abd3105c4a80e5426381a5fc4eec8ec05d4","observation_id":"8b7cfbc8-8e97-43df-bb51-431618663d31","resolution":{"observed_at":"2026-08-15T17:55:04.385286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13732","last_updated":"2024-03-20T16:40:57Z","snapshot_observed_at":"2026-08-18T00:20:19.534779Z","submitted_at":"2024-03-20T16:40:57Z","title":"Experimental fault-tolerant code switching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13732","snapshot_observed_at":"2026-08-15T17:55:03.263789Z","title":"Experimental fault-tolerant code switching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.263789Z"},"links":{"cited_paper":"/paper/2403.13732","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:b708c54c8756fd74853a760b5403f71c3a7a14af467a3943931277eaaddcdc7e","observation_id":"07b36de3-4225-4edb-bf93-99f3a38cd8e1","resolution":{"observed_at":"2026-08-15T17:55:03.263789Z","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-15T17:55:04.373567Z","title":"High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery","venue":null,"work_id":"ce22f281-f5e1-4cdc-8715-21f7189c190f","year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.266479Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:58fbc70846ebe4c854462329ccf55e54c75e57c4bed084b559bc1e34d55f962d","observation_id":"c60c480d-4648-4d06-9740-ea1b6acb6f5d","resolution":{"observed_at":"2026-08-15T17:55:04.376709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.04628","last_updated":"2024-12-05T18:22:15Z","snapshot_observed_at":"2026-08-16T13:20:37.980337Z","submitted_at":"2024-09-06T21:36:49Z","title":"Demonstration of quantum computation and error correction with a tesseract code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.04628","snapshot_observed_at":"2026-08-15T17:55:03.280466Z","title":"Demonstration of quantum computation and error correction with a tesseract code","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.280466Z"},"links":{"cited_paper":"/paper/2409.04628","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:24d5d6feb8b7586a5539656c7c77bd9d774ca3b64b71745bbcd67de43414159f","observation_id":"f7d86a70-d1ab-41b9-9923-4718de67ee3c","resolution":{"observed_at":"2026-08-15T17:55:03.280466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.11822","last_updated":"2025-06-09T18:38:48Z","snapshot_observed_at":"2026-07-30T00:06:09.372286Z","submitted_at":"2024-11-18T18:39:23Z","title":"Fault-tolerant quantum computation with a neutral atom processor","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.11822","snapshot_observed_at":"2026-08-15T17:55:03.283837Z","title":"Logical computation demonstrated with a neutral atom quantum processor","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.283837Z"},"links":{"cited_paper":"/paper/2411.11822","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:a373b31a9fe5d18ec89d679db405537c793fbdece98943868b236c26347bd2f4","observation_id":"88043e53-f2e6-4925-a948-549ad9950f1b","resolution":{"observed_at":"2026-08-15T17:55:03.283837Z","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-15T17:55:03.287979Z","title":"Scaling and logic in the color code on a superconducting quantum processor","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.287979Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:8905039b71195ef68b2071fffd8c1f472c182d410be3f4b618bc75fd45d17ca5","observation_id":"2772bf69-fa86-4df2-af2b-64697fcfcec1","resolution":{"observed_at":"2026-08-15T17:55:03.287979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14360","last_updated":"2025-06-19T20:32:46Z","snapshot_observed_at":"2026-08-16T12:41:53.978817Z","submitted_at":"2024-12-18T21:56:50Z","title":"Demonstrating dynamic surface codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14360","snapshot_observed_at":"2026-08-15T17:55:03.291790Z","title":"Demonstrating dynamic surface codes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.291790Z"},"links":{"cited_paper":"/paper/2412.14360","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:06c652c87eafe96270b50765b7c173c53a8ecf50c4472ee8f5275056163b80ac","observation_id":"e16eac44-e0fb-402f-9e36-8fde211730ae","resolution":{"observed_at":"2026-08-15T17:55:03.291790Z","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-15T17:55:03.294463Z","title":"Experimental demonstration of logical magic state distillation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.294463Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:f6fc9bc26fee930f5303c9f3493a267e1bc8bdb1693c8aa6038bb519e1c38358","observation_id":"d7b2d0e4-90eb-4011-9c43-aec86eaa9eb6","resolution":{"observed_at":"2026-08-15T17:55:03.294463Z","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-15T17:55:04.365535Z","title":"Architectural mechanisms of a universal fault-tolerant quantum computer","venue":null,"work_id":"4776b377-1042-4485-8fc5-b61cffc84870","year":2025},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.297866Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:6c086f0f31c5df17251c407c2449b517b4e878241895d656fd3ed6840ad20d95","observation_id":"5fcfa691-9edc-417c-80dc-781dbf90ea62","resolution":{"observed_at":"2026-08-15T17:55:04.368353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-17T05:22:20.131163Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-08-15T17:55:03.300729Z","title":"Breaking even with magic: demon- stration of a high-fidelity logical non-clifford gate","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.300729Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:4e07317dc18186ea07f68126eea74026d07601cac63abde8af44d3e10818216c","observation_id":"4953edf6-4714-44ec-b808-13a6c30980ec","resolution":{"observed_at":"2026-08-15T17:55:03.300729Z","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-15T17:55:03.303471Z","title":"Experimental demonstration of high-fidelity logical magic states from code switching","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.303471Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:5eead888789e1a3fc74246a743547e2be358fb7041d0a2418c7c75ac80323d25","observation_id":"3a4dc966-6886-4481-a092-67ce2317dd67","resolution":{"observed_at":"2026-08-15T17:55:03.303471Z","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-15T17:55:04.357095Z","title":"Early fault-tolerant simulations of the hubbard model","venue":null,"work_id":"e9296702-e571-49db-be8e-4f162a567ffd","year":2021},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.306351Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:4ec0d4aa95ec541e9ad0e06a6543b00ffe65f4debb8dbacff180579e99b4df51","observation_id":"907fc82c-7d6c-4d26-8a4b-984e9079120d","resolution":{"observed_at":"2026-08-15T17:55:04.361304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.348784Z","title":"On low-depth algorithms for quantum phase estima- tion","venue":null,"work_id":"34c3aad1-de19-4d18-a9df-2a99fa1a2910","year":2023},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.308844Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:7db7bc73f0dd62238d4100896d515aaca3e1373614339e02bcc046d16a5ab66a","observation_id":"7f19dd92-fd59-4c5f-abc3-4b7433c3b800","resolution":{"observed_at":"2026-08-15T17:55:04.351162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.341710Z","title":"Even shorter quantum circuit for phase estimation on early fault- tolerant quantum computers with applications to ground-state energy estimation","venue":null,"work_id":"5d34d5d8-2189-4d3a-911b-332a18476af7","year":2023},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.311800Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:e416d231e7a22078a6816f869c29943e1337d41265d32d59b71d8a3cd029d377","observation_id":"7f83b19a-df16-4883-a5cb-73447b28c8f5","resolution":{"observed_at":"2026-08-15T17:55:04.344393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.332784Z","title":"Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers","venue":null,"work_id":"882ef15f-93d5-4715-985c-466112006d5e","year":2023},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.314615Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:5de26297dd41a6176ac633ee93750dc97c8ab072cf0850f072a6dedad0938832","observation_id":"a1f3b714-ea95-4be9-af0b-f30951535cc2","resolution":{"observed_at":"2026-08-15T17:55:04.335758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.325554Z","title":"Modeling the performance of early fault-tolerant quantum algorithms","venue":null,"work_id":"e3d82aed-711c-486f-be64-b1d9d32f7173","year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.317713Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:b7153bf3b0213e3b9881635c20cd7156e7ddc422d2d1e795fecc7452da551f63","observation_id":"c6bdc671-f0e2-46df-ae6d-a8439c402638","resolution":{"observed_at":"2026-08-15T17:55:04.328389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.318304Z","title":"Assessment of quantum phase estimation protocols for early fault-tolerant quantum computers","venue":null,"work_id":"434a3269-4778-4b36-93a1-32a0ac1a6b3e","year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.320087Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:d79691d25fd7c6a6c533c87a9907139a9306952f214699343381495cb2603269","observation_id":"dc75a6fc-5b22-4da9-a09d-66e5b5adc463","resolution":{"observed_at":"2026-08-15T17:55:04.321209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21125","last_updated":"2025-09-10T14:11:36Z","snapshot_observed_at":"2026-08-16T13:05:20.629238Z","submitted_at":"2024-10-28T15:28:15Z","title":"Stabilizer configuration interaction: Finding molecular subspaces with error detection properties","version":2},"cited_work":{"arxiv_id":"2410.21125","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.21125","snapshot_observed_at":"2026-08-15T17:55:03.854204Z","title":"Stabilizer configuration interaction: Finding molecular subspaces with error detection properties","venue":"quant-ph","work_id":"237f2257-234e-423e-a07c-899c8fa8a37f","year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.321964Z"},"links":{"cited_paper":"/paper/2410.21125","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:4d02e18a8484418014097ed267390f828989916ec316da413eb00389436c256a","observation_id":"2084c1eb-c1c2-41eb-bc27-db18d340a0cc","resolution":{"observed_at":"2026-08-15T17:55:03.857632Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.310219Z","title":"Ground-state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices","venue":null,"work_id":"b724fcfa-10bb-4ee8-94a1-d61b07d59d18","year":2022},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.324103Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:6c8b2eae8389e8aff694d8d5bd1b0fd74465010465da3821115985d3f90284cf","observation_id":"0cac0ff5-d367-4234-80c2-d8ee5f78f5f8","resolution":{"observed_at":"2026-08-15T17:55:04.313131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.300762Z","title":"Early fault- tolerant quantum computing","venue":null,"work_id":"85dbbef8-45f2-466e-b966-8b3833793076","year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.325882Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:534491635a94d63c73010c83c0770e5b9fab11497e92b0c0858b9afce0929da2","observation_id":"671c3860-d267-468b-9d85-9f2511ff7034","resolution":{"observed_at":"2026-08-15T17:55:04.303751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:03.327648Z","title":"Scheme for reducing decoherence in quantum computer memory","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.327648Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:8fc55beaf2a15a7549e9ded2f51500403798f8f824d8185c373c24c1934644ac","observation_id":"d64082aa-f94a-4df3-88f3-a8499be7a07b","resolution":{"observed_at":"2026-08-15T17:55:03.327648Z","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-15T17:55:04.285369Z","title":"Good quantum error-correcting codes exist","venue":null,"work_id":"5caad4c8-a4b5-4c99-a60d-858d81fa9664","year":1996},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.329539Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:0517c11e2de8cab6d41ec7fa82f3e2e512b5ccd224202797f19bedd4df7d4bfa","observation_id":"998fb464-3d58-4267-ab98-dfb78c75b2d5","resolution":{"observed_at":"2026-08-15T17:55:04.289228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:03.331684Z","title":"Fault-tolerant quantum computation with constant error","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.331684Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:579f748bf56dce78130ae25cbbab312e7b1485d37990b848114cd8027bb19fa0","observation_id":"6d328a91-caa6-47a9-aaea-75186ea771f5","resolution":{"observed_at":"2026-08-15T17:55:03.331684Z","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-15T17:55:03.333683Z","title":"Re- silient quantum computation","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.333683Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:c3c6c566d19b650f121b453aec1e88ef0835ce13fbf80f3b8ac987162a5a7215","observation_id":"22c73ef8-7676-417f-ac6b-f49d35102815","resolution":{"observed_at":"2026-08-15T17:55:03.333683Z","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-15T17:55:04.271530Z","title":"Fault-tolerant quantum computation","venue":null,"work_id":"52d3992e-c025-4228-9a31-bbecc238270b","year":1996},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.336445Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:8451fb67d79b46e2088657f37def2751678a3ab990575d179c6363d287f2ec70","observation_id":"c7c0355f-efe4-4345-b85e-4fd0825fde58","resolution":{"observed_at":"2026-08-15T17:55:04.274550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9712048","last_updated":"1997-12-19T22:58:18Z","snapshot_observed_at":"2026-08-04T17:33:05.754751Z","submitted_at":"1997-12-19T22:58:18Z","title":"Fault-tolerant quantum computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9712048","snapshot_observed_at":"2026-08-15T17:55:03.339759Z","title":"Fault-tolerant quantum computation","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.339759Z"},"links":{"cited_paper":"/paper/quant-ph/9712048","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:48bf0413dcc8a88cd3475ba452c41c6cebc7414518a7ebe889f33d280344fc91","observation_id":"5d07e226-ebfb-453b-a766-686ea4212059","resolution":{"observed_at":"2026-08-15T17:55:03.339759Z","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-15T17:55:04.263470Z","title":"Surviving as a quantum computer in a classical world","venue":null,"work_id":"bece2d42-6408-46ec-baf4-eacdb7f6c41b","year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.342962Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:179304152b5580265e0d007129b864c0a81819b7eb16956bfc73b047ffc27bcd","observation_id":"87541960-63c0-4d80-8af8-d9eca73cf6c8","resolution":{"observed_at":"2026-08-15T17:55:04.266452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.254559Z","title":"Restrictions on transversal encoded quantum gate sets","venue":null,"work_id":"06cdd198-2597-44eb-97c9-68664a1e1092","year":2009},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.345589Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:c86e99dd63473b732a2a55726507221d1e505b142feb33c28210ea65207358e7","observation_id":"c838c26a-90a1-4ef6-ae38-dffac97727f3","resolution":{"observed_at":"2026-08-15T17:55:04.258654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.247275Z","title":"Demonstrating the viability of universal quantum com- putation using teleportation and single-qubit operations","venue":null,"work_id":"c7d87923-d36c-4fb3-9aab-bf1919f4b7cd","year":1999},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.349048Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:859eee033bbd8ab4416ce10e4fd35e7b4672e3268f2b12532814bc09f67475cb","observation_id":"648dff9a-a48e-448b-a66b-64da46b7cb56","resolution":{"observed_at":"2026-08-15T17:55:04.250007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:03.352492Z","title":"Methodology for quantum logic gate construction","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.352492Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:044922dc3b619c4aee67e3ef9a33c4c57f56f1346abb623bcd7528aae3e8fd56","observation_id":"ab25d0d4-f3b6-461a-8ac7-2c0677caeffb","resolution":{"observed_at":"2026-08-15T17:55:03.352492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0403025","last_updated":"2004-12-16T12:49:57Z","snapshot_observed_at":"2026-08-01T23:46:11.145230Z","submitted_at":"2004-03-03T03:05:21Z","title":"Universal Quantum Computation with ideal Clifford gates and noisy ancillas","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0403025","snapshot_observed_at":"2026-08-15T17:55:03.355065Z","title":"Universal quantum computation with ideal Clifford gates and noisy ancillas","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.355065Z"},"links":{"cited_paper":"/paper/quant-ph/0403025","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:41c237393f06ca0c5e5c4d67bba1917a5ad7d7f7077b68a1dee02c4e2b49ade7","observation_id":"a49a1bc3-a9d5-491f-8311-4c9b9381b00e","resolution":{"observed_at":"2026-08-15T17:55:03.355065Z","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-15T17:55:03.358865Z","title":"Surface codes: Towards practical large-scale quantum computation","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.358865Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:fbe35830e7af6b464b0a9f443294f92865a5669a7dee0a0ddd2b8a2df7f9c81d","observation_id":"4568f9ea-b5b0-4de1-a682-3c6f9e78714f","resolution":{"observed_at":"2026-08-15T17:55:03.358865Z","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-15T17:55:04.232227Z","title":"Lower bounds on the non-clifford resources for quantum computations","venue":null,"work_id":"480eb9ec-1f94-4215-aa0d-f50c9939be1a","year":2020},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.361164Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:3b70a90e117086f0951ebf18a4783f6c4d084f8a2a68fc42732f14212231d42d","observation_id":"c822e1d4-add4-46bd-bf30-d1d5e37eeb7a","resolution":{"observed_at":"2026-08-15T17:55:04.235515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17595","last_updated":"2024-09-26T07:21:58Z","snapshot_observed_at":"2026-08-13T21:53:07.774758Z","submitted_at":"2024-09-26T07:21:58Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17595","snapshot_observed_at":"2026-08-15T17:55:03.363380Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.363380Z"},"links":{"cited_paper":"/paper/2409.17595","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:64c4faf8afc52c797413d588d847fa6d8d17ea360837202cb28ee1972dd7997b","observation_id":"02a23721-d2d9-421e-a3d0-cf4692361ea0","resolution":{"observed_at":"2026-08-15T17:55:03.363380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1304.3709","last_updated":"2013-09-04T15:17:34Z","snapshot_observed_at":"2026-08-15T11:14:45.129569Z","submitted_at":"2013-04-12T19:13:59Z","title":"Universal fault-tolerant quantum computation with only transversal gates and error correction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.3709","snapshot_observed_at":"2026-08-15T17:55:03.366441Z","title":"Universal fault-tolerant quantum computation with only transversal gates and error correction","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.366441Z"},"links":{"cited_paper":"/paper/1304.3709","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:225329f4357fec3f0f849a8fc82957e7b74540df20833c53fcd2ac54c986f590","observation_id":"48b11e27-9538-472d-9c3c-e44e78e31783","resolution":{"observed_at":"2026-08-15T17:55:03.366441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1403.2734","last_updated":"2014-03-11T20:07:01Z","snapshot_observed_at":"2026-08-14T23:41:39.974336Z","submitted_at":"2014-03-11T20:07:01Z","title":"Fault-tolerant conversion between the Steane and Reed-Muller quantum codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1403.2734","snapshot_observed_at":"2026-08-15T17:55:03.369829Z","title":"Fault-tolerant conversion between the Steane and Reed-Muller quantum codes","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.369829Z"},"links":{"cited_paper":"/paper/1403.2734","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:cad61ea2b6600fc4ba647fd104cea6c4f84a42a5bf75e95a72aa8340b8f64c12","observation_id":"4281df9b-2447-4077-9421-9866ff90cfa4","resolution":{"observed_at":"2026-08-15T17:55:03.369829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.0879","last_updated":"2015-08-06T14:21:46Z","snapshot_observed_at":"2026-08-16T07:29:13.187698Z","submitted_at":"2013-11-04T21:00:05Z","title":"Gauge Color Codes: Optimal Transversal Gates and Gauge Fixing in Topological Stabilizer Codes","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.0879","snapshot_observed_at":"2026-08-15T17:55:03.373191Z","title":"Gauge color codes: Optimal transversal gates and gauge fixing in topological stabilizer codes","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.373191Z"},"links":{"cited_paper":"/paper/1311.0879","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:a6993c7f0c246c044146d79b52c984f4ebd069e071fa849d0608fecc245d50d1","observation_id":"aff2d1de-a139-4089-b4f9-7f7404664e08","resolution":{"observed_at":"2026-08-15T17:55:03.373191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.5079","last_updated":"2016-05-12T04:16:47Z","snapshot_observed_at":"2026-08-16T12:44:34.648714Z","submitted_at":"2014-12-16T16:52:56Z","title":"Dimensional Jump in Quantum Error Correction","version":3},"cited_work":{"arxiv_id":"1412.5079","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.5079","snapshot_observed_at":"2026-08-15T17:55:03.812691Z","title":"Dimensional Jump in Quantum Error Correction","venue":"quant-ph","work_id":"dce182ec-c7f1-41f2-973a-2ee51144c89c","year":2014},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.375898Z"},"links":{"cited_paper":"/paper/1412.5079","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:68f69dee1c2c317aa31023e5164a1a94c244080771495643a3e419804444e022","observation_id":"7bf6cfc4-ac35-4f3c-b0d4-58f7a5f8ed64","resolution":{"observed_at":"2026-08-15T17:55:03.815479Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.224390Z","title":"Universal transversal gates with color codes: A simplified approach","venue":null,"work_id":"8ed5e51f-9c2a-4718-8125-4ceda0cce693","year":2015},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.379884Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:4942dae21e66325e2cb058f182859fb48468ad8715297ba40fd39fa7980aa7b3","observation_id":"735fea99-e399-47a3-b623-c93743d1b183","resolution":{"observed_at":"2026-08-15T17:55:04.226861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.218016Z","title":"Cost of universality: A com- parative study of the overhead of state distillation and code switching with color codes","venue":null,"work_id":"0738df8e-c3e0-4a6e-9e2e-130ba12e746a","year":2021},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.383419Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:0f39f9ba10ff20102db4a279c2e15cf95b0cd881492d58c7714298ff3d18deaa","observation_id":"118ea26f-5c4f-4e9c-8efa-6c7e6b7de358","resolution":{"observed_at":"2026-08-15T17:55:04.220575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13465","last_updated":"2025-08-29T13:57:23Z","snapshot_observed_at":"2026-08-16T13:16:53.197386Z","submitted_at":"2024-09-20T12:54:47Z","title":"Efficient fault-tolerant code switching via one-way transversal CNOT gates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.13465","snapshot_observed_at":"2026-08-15T17:55:03.385963Z","title":"Efficient fault-tolerant code switching via one-way transversal CNOT gates","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.385963Z"},"links":{"cited_paper":"/paper/2409.13465","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:a38d9352a944412df721fddccadbaa2110604c369a8d0045b3e192b071f52a63","observation_id":"9592e84d-14fd-4686-a780-969f5be06178","resolution":{"observed_at":"2026-08-15T17:55:03.385963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0602063","last_updated":"2006-05-22T17:10:49Z","snapshot_observed_at":"2026-08-16T12:50:24.931754Z","submitted_at":"2006-02-06T10:43:50Z","title":"Topological Quantum Error Correction with Optimal Encoding Rate","version":2},"cited_work":{"arxiv_id":"quant-ph/0602063","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0602063","snapshot_observed_at":"2026-08-15T17:55:03.797575Z","title":"Topological Quantum Error Correction with Optimal Encoding Rate","venue":"quant-ph","work_id":"a6490d0b-4274-4716-88f8-c76d14547638","year":2006},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.389327Z"},"links":{"cited_paper":"/paper/quant-ph/0602063","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:adc48751090e09aabb61ea80edb547d8c920515ef00dbcc29fb68ff0efa156f3","observation_id":"607a10f8-ea59-4d66-98a4-dd826f1069c2","resolution":{"observed_at":"2026-08-15T17:55:03.800223Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0610024","last_updated":"2007-03-29T14:36:57Z","snapshot_observed_at":"2026-08-16T12:50:25.283232Z","submitted_at":"2006-10-04T09:19:24Z","title":"Topological Computation without Braiding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0610024","snapshot_observed_at":"2026-08-15T17:55:03.392771Z","title":"Topological computation without braiding","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.392771Z"},"links":{"cited_paper":"/paper/quant-ph/0610024","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:2c9887b7a63d2f676c12544f1a51d93f62c66c690b72675d195da513899a9554","observation_id":"3c61f16e-8cb3-4f12-8fa9-eda7a9219d48","resolution":{"observed_at":"2026-08-15T17:55:03.392771Z","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-15T17:55:04.211048Z","title":"The smallest interesting colour code","venue":null,"work_id":"69f297b2-9f7d-4450-927b-7d349ae74f92","year":2016},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.395181Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:e0b562b38f244bd45e0b78b0f486c525e64022fbc846845afebd75715a59faa6","observation_id":"98c15a86-d281-42dc-88a9-1d63b489c536","resolution":{"observed_at":"2026-08-15T17:55:04.214060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.202657Z","title":"Quantum computation and quantum information","venue":null,"work_id":"54beee6d-961f-468e-a10e-475ea14bb384","year":2000},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.397372Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:21b89ec7e9f3475f5bf5c5ae8d6595bc1332c5a9e5e8db8d617e54181a3b277c","observation_id":"75d7e94a-60e2-4f54-af73-33fc0c243f3d","resolution":{"observed_at":"2026-08-15T17:55:04.205431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.194716Z","title":"Benchmarking quantum computers","venue":null,"work_id":"fe6e7e1b-1aac-41b3-943b-a700277e6b96","year":2025},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.399360Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:f69a80bd7f942ee1341e0153c502af56c49f1a28edaece3c127318fb00a5eec2","observation_id":"ba3836fe-cad2-43b8-9575-0f28e2f123a9","resolution":{"observed_at":"2026-08-15T17:55:04.197563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.187812Z","title":"Vali- dating quantum computers using randomized model circuits","venue":null,"work_id":"4c2ffca6-ad62-4c45-a549-dc087cca2c24","year":2019},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.402459Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:71d98762a72b750ffd8a8275e207c8254790e19a62159c744a708a40b5a7ff50","observation_id":"fc652ad2-97a8-4f48-a83b-03e01ca14c39","resolution":{"observed_at":"2026-08-15T17:55:04.190890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.179852Z","title":"A volumetric framework for quantum computer benchmarks","venue":null,"work_id":"5ca5c062-43f5-4804-9e72-72ff97907e5d","year":2020},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.404604Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:80492280a71653c7690c03ad873c9f79e64497fd705cb7fd88a86ee01b5c1e04","observation_id":"c50ed93c-8b44-480a-9f56-ea922becb89e","resolution":{"observed_at":"2026-08-15T17:55:04.182610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.05997","last_updated":"2021-06-17T20:51:07Z","snapshot_observed_at":"2026-08-18T02:37:35.309325Z","submitted_at":"2020-01-16T18:55:38Z","title":"Optimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation","version":4},"cited_work":{"arxiv_id":"2001.05997","doi":null,"metadata_source":"pith","pith_arxiv_id":"2001.05997","snapshot_observed_at":"2026-08-15T17:55:03.778785Z","title":"Optimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation","venue":"quant-ph","work_id":"ba9a70c4-1105-4775-8451-05dc73be74b0","year":2020},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.408022Z"},"links":{"cited_paper":"/paper/2001.05997","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:81cbd15f22ed26abe3ac080457ad70dde3470a5505a42a597d38f7e0ca242296","observation_id":"95e38871-1124-4075-814d-7de9691d310a","resolution":{"observed_at":"2026-08-15T17:55:03.782591Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0205115","last_updated":"2002-05-26T03:27:38Z","snapshot_observed_at":"2026-07-07T07:09:01.861344Z","submitted_at":"2002-05-18T00:54:19Z","title":"Both Toffoli and Controlled-NOT need little help to do universal quantum computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0205115","snapshot_observed_at":"2026-08-15T17:55:03.411148Z","title":"Both Toffoli and controlled-NOT need little help to do universal quantum compu- tation","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.411148Z"},"links":{"cited_paper":"/paper/quant-ph/0205115","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:71624aac8b8d66647ab8bb704aa4ecbc369becba446e66c627f40e9fbbf15f09","observation_id":"db4d079b-5573-4091-8073-00bb57cd5393","resolution":{"observed_at":"2026-08-15T17:55:03.411148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0301040","last_updated":"2003-01-09T23:13:49Z","snapshot_observed_at":"2026-07-07T07:11:35.292783Z","submitted_at":"2003-01-09T23:13:49Z","title":"A Simple Proof that Toffoli and Hadamard are Quantum Universal","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0301040","snapshot_observed_at":"2026-08-15T17:55:03.413755Z","title":"A simple proof that Toffoli and Hadamard are quantum universal","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.413755Z"},"links":{"cited_paper":"/paper/quant-ph/0301040","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:2f822a80fdbb329cfffb2beeeb000b2e8c4b0f14b562443243b38aaac2df9511","observation_id":"bfcedac5-e6c6-4f2b-808e-c572156ddde3","resolution":{"observed_at":"2026-08-15T17:55:03.413755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.09915","last_updated":"2024-04-15T16:40:24Z","snapshot_observed_at":"2026-08-16T14:00:46.044897Z","submitted_at":"2024-04-15T16:40:24Z","title":"Catalysing Completeness and Universality","version":1},"cited_work":{"arxiv_id":"2404.09915","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.09915","snapshot_observed_at":"2026-08-15T17:55:03.752297Z","title":"Catalysing Completeness and Universality","venue":"quant-ph","work_id":"523b1e2d-18d9-4af0-94b6-523fdc0fbc81","year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.416294Z"},"links":{"cited_paper":"/paper/2404.09915","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:5251e5acaf98bb77ab9e6a930693fe0bb0d701151435954465aa1f359e57faa1","observation_id":"7511b3c3-8173-4ea4-b350-1c475e08d3dc","resolution":{"observed_at":"2026-08-15T17:55:03.755049Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.171682Z","title":"Quantum computations: algorithms and error correction","venue":null,"work_id":"bcf50830-5d89-47b7-819b-7b13cd0032f3","year":1997},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.418661Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:e09c77ed7210398e904ae5f6783fedd216f37af1cc3537ebc50639f3f82e45ce","observation_id":"45e72d69-d271-4563-a6b3-6d68d26a9d74","resolution":{"observed_at":"2026-08-15T17:55:04.174764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.06628","last_updated":"2020-10-13T18:38:46Z","snapshot_observed_at":"2026-08-16T19:13:45.769058Z","submitted_at":"2020-10-13T18:38:46Z","title":"The surface code on the rhombic dodecahedron","version":1},"cited_work":{"arxiv_id":"2010.06628","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.06628","snapshot_observed_at":"2026-08-15T17:55:03.742141Z","title":"The surface code on the rhombic dodecahedron","venue":"quant-ph","work_id":"a6c43879-2f42-4a1b-a92a-71266c3c27f0","year":2020},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.420885Z"},"links":{"cited_paper":"/paper/2010.06628","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:466e1059a21ae4a8efc931dade1dd6cefb956274fa4df7d185cedf6ee22e7726","observation_id":"af54c046-0d12-47be-bc39-e49468b1a5cc","resolution":{"observed_at":"2026-08-15T17:55:03.745183Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cond-mat/0607736","last_updated":"2006-07-29T12:38:53Z","snapshot_observed_at":"2026-07-07T02:32:43.661403Z","submitted_at":"2006-07-27T18:45:40Z","title":"Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cond-mat/0607736","snapshot_observed_at":"2026-08-15T17:55:03.423413Z","title":"Exact topological quantum order ind = 3 and beyond: Branyons and brane-net condensates","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.423413Z"},"links":{"cited_paper":"/paper/cond-mat/0607736","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:9928e717ee7cf92e5ad9ae827f5056c8c136cef03a1da848c6a32300e0a45f6c","observation_id":"35d60670-31b8-4fb4-902d-f51f409442da","resolution":{"observed_at":"2026-08-15T17:55:03.423413Z","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-15T17:55:04.162875Z","title":"Automated dis- covery of logical gates for quantum error correction (with supplementary (153 pages))","venue":null,"work_id":"a055cbba-6ede-4806-92f7-26b4944c067d","year":2022},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.426600Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:77e33f8b3beea2ed1349a80d192b7ca00b50a7ac8a85d3604d2957bc55c8079d","observation_id":"e8f56051-dc5a-43b0-a380-5d335083cfb7","resolution":{"observed_at":"2026-08-15T17:55:04.166402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9512032","last_updated":"1996-04-16T19:48:00Z","snapshot_observed_at":"2026-07-07T07:26:05.303471Z","submitted_at":"1995-12-30T21:31:00Z","title":"Good Quantum Error-Correcting Codes Exist","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9512032","snapshot_observed_at":"2026-08-15T17:55:03.429049Z","title":"Good quantum error-correcting codes exist","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.429049Z"},"links":{"cited_paper":"/paper/quant-ph/9512032","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:40ab60d83309362afb4fe4ac8eb131bc6001dc11e2109ba22f35af3540e61414","observation_id":"5ac464a6-2924-4a48-874c-4c6bf53e94e9","resolution":{"observed_at":"2026-08-15T17:55:03.429049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9601029","last_updated":"1996-05-13T10:43:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1996-01-29T18:05:15Z","title":"Multiple Particle Interference and Quantum Error Correction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9601029","snapshot_observed_at":"2026-08-15T17:55:03.432416Z","title":"Multiple particle interference and quantum error correction","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.432416Z"},"links":{"cited_paper":"/paper/quant-ph/9601029","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:fbcb2d8c4a88ffe45ba7076919e2bceebfabce76380e209437295bdfb31401ef","observation_id":"c289aa93-f6ea-437c-9fc6-f1dd2185f8e1","resolution":{"observed_at":"2026-08-15T17:55:03.432416Z","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-15T17:55:04.155225Z","title":"Fault-tolerant compil- ing of classically hard instantaneous quantum polynomial circuits on hypercubes","venue":null,"work_id":"bd27e65e-57e2-4def-879b-627a8db99447","year":2025},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.434797Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:e117a52a7e2ff88c72ebd8cbe9218e985a39fa7343237eda694356af02bca23e","observation_id":"7c0902df-54ab-4569-b3f6-103ef48be5af","resolution":{"observed_at":"2026-08-15T17:55:04.158106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0002039","last_updated":"2000-08-01T01:48:08Z","snapshot_observed_at":"2026-08-16T12:51:19.774547Z","submitted_at":"2000-02-14T20:55:55Z","title":"Methodology for quantum logic gate constructions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0002039","snapshot_observed_at":"2026-08-15T17:55:03.438353Z","title":"Methodology for quantum logic gate construction","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.438353Z"},"links":{"cited_paper":"/paper/quant-ph/0002039","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:1b8b537b6c9c7b667478d9522daf62b33998604eeaad56fe8d1696325d64c8dd","observation_id":"28f69f2f-969b-4a0d-bec4-7fd339513099","resolution":{"observed_at":"2026-08-15T17:55:03.438353Z","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-15T17:55:04.146064Z","title":"Virtual reading group communication","venue":null,"work_id":"9e4b4d79-8aef-41bc-bf1d-37e0dc3a62be","year":1994},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.442105Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:7f2bba9b29b572155e946760c799dfeef8ffae57efa5a290d470b491a2899349","observation_id":"07f5f555-6f40-4e3c-9de7-05f89a53cdd6","resolution":{"observed_at":"2026-08-15T17:55:04.149889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.138041Z","title":"Lie groups and quantum circuits","venue":null,"work_id":"90d10d98-6740-4b6b-be6f-50feabee4b71","year":2000},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.444725Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:a59f8cf4f379922cb612c3a7c3c3262c8cd4beb756adf567f5c2afc71ed201e9","observation_id":"ad8103bc-abae-4cbd-88cf-175b90eff5df","resolution":{"observed_at":"2026-08-15T17:55:04.141196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.130321Z","title":"Quantum computations: Algorithms and error correction","venue":null,"work_id":"fae19579-000a-4e00-94ce-18e6df7446df","year":1997},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.448500Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:501570237fa2d9da22df03dd4d564ea360be81fd1b705cb726df08ae76b71847","observation_id":"3d137d14-8b7c-43bd-a4b4-bfa6c2e4a119","resolution":{"observed_at":"2026-08-15T17:55:04.133280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.122831Z","title":"Classical and quantum computation","venue":null,"work_id":"9624c991-5876-4288-a755-9f2c6770f2a1","year":2002},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.451885Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:7cba3bc80937f77e76bae1cdb003f1d5337db40ba2ea2ce9d1b3023f6459010d","observation_id":"f97ad2ef-348d-4a16-83ae-b40a713c0d10","resolution":{"observed_at":"2026-08-15T17:55:04.125530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0505030","last_updated":"2005-08-23T01:12:00Z","snapshot_observed_at":"2026-08-13T09:40:04.012975Z","submitted_at":"2005-05-06T00:55:45Z","title":"The Solovay-Kitaev algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0505030","snapshot_observed_at":"2026-08-15T17:55:03.454140Z","title":"The Solovay-Kitaev algorithm","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.454140Z"},"links":{"cited_paper":"/paper/quant-ph/0505030","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:ead5f54713b91e14f0c2d9e80b8872365506a2365153646a7174cb8a9f3ee4fb","observation_id":"64b9d99e-f978-43ed-af89-7b0b3970e607","resolution":{"observed_at":"2026-08-15T17:55:03.454140Z","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-15T17:55:04.114107Z","title":"Andrewglaudell/gausssynth: Gausssynth","venue":null,"work_id":"c69845b7-3d9a-41e6-9067-30f50a8810e1","year":null},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.458076Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:ba12d673d435d05fd02d13b4d973c929c1bc3338aad5604f42f974d640f75ac2","observation_id":"fe962e89-fdfb-4127-8e9d-2030cf3706c1","resolution":{"observed_at":"2026-08-15T17:55:04.117496Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.106462Z","title":"Number-theoretic characterizations of some restricted Clifford+T circuits","venue":null,"work_id":"1ae6559a-63fd-41b5-93cb-898e6775c670","year":2020},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.461776Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:6b35d6754c730fbf1815e8c3758104c86e2f141fb964fa2a5de6d9df2fe6823c","observation_id":"03b36f51-4059-42e5-97db-baab5a313e98","resolution":{"observed_at":"2026-08-15T17:55:04.109624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08950","last_updated":"2024-01-17T03:53:37Z","snapshot_observed_at":"2026-08-16T14:26:55.331023Z","submitted_at":"2024-01-17T03:53:37Z","title":"Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08950","snapshot_observed_at":"2026-08-15T17:55:03.464680Z","title":"Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.464680Z"},"links":{"cited_paper":"/paper/2401.08950","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:112153d86d1d09e97b79d3c27bbdeaa729a48c60e537ef6fa8c8209995d6b7ab","observation_id":"e7dbba81-98c2-4259-a345-497e4e3827cf","resolution":{"observed_at":"2026-08-15T17:55:03.464680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.07720","last_updated":"2023-05-12T18:21:33Z","snapshot_observed_at":"2026-08-16T15:33:28.524396Z","submitted_at":"2023-05-12T18:21:33Z","title":"Catalytic Embeddings of Quantum Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.07720","snapshot_observed_at":"2026-08-15T17:55:03.467762Z","title":"Catalytic embeddings of quantum circuits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.467762Z"},"links":{"cited_paper":"/paper/2305.07720","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:a65db42d15f2bb64079a8659e7f6df3521439f8d524e29893092accb2d517b04","observation_id":"e5c6521a-e3dc-4df7-a192-a90fc909ff01","resolution":{"observed_at":"2026-08-15T17:55:03.467762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9604023","last_updated":"1996-04-22T22:07:40Z","snapshot_observed_at":"2026-08-16T12:50:24.248936Z","submitted_at":"1996-04-22T22:07:40Z","title":"Sending quantum entanglement through noisy channels","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9604023","snapshot_observed_at":"2026-08-15T17:55:03.472085Z","title":"Sending quantum entanglement through noisy channels","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.472085Z"},"links":{"cited_paper":"/paper/quant-ph/9604023","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:f1056f06ca174b9463d529fa6afd664a4493d814764ef48fa2354a875c684f63","observation_id":"dfaa8f7e-43cb-4590-ab7e-4ba06ec1119e","resolution":{"observed_at":"2026-08-15T17:55:03.472085Z","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-15T17:55:03.474775Z","title":"The entanglement fidelity and quantum error correction","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.474775Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:254601463f4e972fe65b0e99b8acc3325d34c158ada08d0c188bbd59a601662f","observation_id":"c1d2e330-0a1a-4ee3-ba0b-befb9a8744d4","resolution":{"observed_at":"2026-08-15T17:55:03.474775Z","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-15T17:55:03.477932Z","title":"Establishing trust in quantum computations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.477932Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:7381c19f0db51f994707818bb3df48ad95b71cd0bc14b39cb6e36f448b222437","observation_id":"48536929-7bbb-4e24-9b74-bc0bafd9210c","resolution":{"observed_at":"2026-08-15T17:55:03.477932Z","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-15T17:55:04.097368Z","title":"Scalable randomized benchmarking of quantum computers using mirror circuits","venue":null,"work_id":"389bc651-42a0-4623-9421-da5d6101658a","year":2022},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.481537Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:7eeae16a7f4316ba1dd800f57e5ed89304732bd8e180659739c2aed251c984d0","observation_id":"d67d123f-14fd-4e7d-85cb-da8f56955684","resolution":{"observed_at":"2026-08-15T17:55:04.100773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.088411Z","title":"Measuring the capabilities of quantum computers","venue":null,"work_id":"5596d4c2-5421-410b-a4ad-bef2be4a7e66","year":2022},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.483720Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:63a00b400e700495cd0fe25175a9ca2e1e76760e05e6895ddf5f28a7b9dd215c","observation_id":"0f98aba2-ecff-4b04-9d19-97c25686ed8f","resolution":{"observed_at":"2026-08-15T17:55:04.091586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.10431","last_updated":"2023-06-01T20:53:24Z","snapshot_observed_at":"2026-08-16T18:01:26.831166Z","submitted_at":"2021-08-23T22:14:57Z","title":"Theory of mirror benchmarking and demonstration on a quantum computer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.10431","snapshot_observed_at":"2026-08-15T17:55:03.486467Z","title":"Theory of mirror benchmarking and demonstration on a quantum computer","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.486467Z"},"links":{"cited_paper":"/paper/2108.10431","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:2d0c5aa8d7d81d1a1ee084c1c0bf756003a4ccfb51babfb4e40b0850eef4fc5a","observation_id":"686fa54c-545d-4c9d-8f08-38634f785444","resolution":{"observed_at":"2026-08-15T17:55:03.486467Z","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-15T17:55:04.079085Z","title":"Demonstrating scalable randomized bench- marking of universal gate sets","venue":null,"work_id":"390a586b-545d-477c-90fe-38ee7cf03412","year":2023},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.490120Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:d69d1bd6c38d996f3205b279d6f3f9a79763352e6042177895058d63dc79118a","observation_id":"c1e11fbd-ccad-4770-945b-6ceadc4590bf","resolution":{"observed_at":"2026-08-15T17:55:04.082430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09549","last_updated":"2019-12-19T21:21:10Z","snapshot_observed_at":"2026-08-16T12:44:46.871525Z","submitted_at":"2019-12-19T21:21:10Z","title":"Flag fault-tolerant error correction for any stabilizer code","version":1},"cited_work":{"arxiv_id":"1912.09549","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.09549","snapshot_observed_at":"2026-08-15T17:55:03.520615Z","title":"Flag fault-tolerant error correction for any stabilizer code","venue":"quant-ph","work_id":"afcb38ff-b860-4bd9-b1bb-774ddcd98dd8","year":2019},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.492625Z"},"links":{"cited_paper":"/paper/1912.09549","citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:149641bcf6ab4fb0f636ce1d11c65b22614b23518ac98220c85ed9b5ad008bcc","observation_id":"6fca3b1b-ae78-4233-8cb8-db397c672688","resolution":{"observed_at":"2026-08-15T17:55:03.525631Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:55:04.071468Z","title":"Characterization of addressability by simultaneous randomized benchmarking","venue":null,"work_id":"980ea1dd-3f0d-4bab-855b-07c412ce6943","year":2012},"citing_paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:03.494981Z"},"links":{"citing_paper":"/paper/2507.20387"},"observation_digest":"sha256:f0b587acc6f8b97df5400adfbbd161ab2e4ae743ae4cafcfa86d74a42f6d33a8","observation_id":"e5ca7752-c2db-4f76-aa53-b566f99b33cd","resolution":{"observed_at":"2026-08-15T17:55:04.074250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.20387","last_updated":"2025-07-27T19:07:12Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T18:03:08.703141Z","submitted_at":"2025-07-27T19:07:12Z","title":"A small and interesting architecture for early fault-tolerant quantum computers"},"reference_resolution":{"displayed":81,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":7,"verified_fuzzy":38},"total_outbound_references":81},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 81 of 81 outbound references and 1 inbound Pith citation observation for arXiv:2507.20387."}