{"as_of":"2026-08-22T00:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6637e9903280427c68a154dd904ebc0bb124f5cc25e2bc63de2892a80ee86844","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:29:28.355244Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:20:50.058333Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T12:50:22.338997Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18287","snapshot_observed_at":"2026-08-15T20:20:23.916079Z","title":"Guernut and C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13587","last_updated":"2025-06-20T04:04:22Z","snapshot_observed_at":"2026-08-20T11:55:08.223155Z","submitted_at":"2025-05-19T18:00:00Z","title":"Fast correlated decoding of transversal logical algorithms","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T20:20:23.916079Z"},"links":{"cited_paper":"/paper/2411.18287","citing_paper":"/paper/2505.13587"},"observation_digest":"sha256:c0094ff55ea855ed4989d11e99a2b031941d1611e5c910428b25106bf9ae6cc6","observation_id":"cb9e331d-b6c9-4bd2-abc2-f935d96f2547","resolution":{"observed_at":"2026-08-15T20:20:23.916079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18287","snapshot_observed_at":"2026-08-15T20:20:50.058333Z","title":"Guernut and C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13599","last_updated":"2026-07-06T14:01:50Z","snapshot_observed_at":"2026-08-17T23:00:26.510949Z","submitted_at":"2025-05-19T18:00:02Z","title":"Decoding across transversal Clifford gates in the surface code","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T20:20:50.058333Z"},"links":{"cited_paper":"/paper/2411.18287","citing_paper":"/paper/2505.13599"},"observation_digest":"sha256:01894109ec029a5814da2be3633e37c93bcafa56bcdc70539f89575aec16b39a","observation_id":"9a5c4d51-79bf-44cc-96fb-08b4afc17ac3","resolution":{"observed_at":"2026-08-15T20:20:50.058333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"cited_work":{"arxiv_id":"2411.18287","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.18287","snapshot_observed_at":"2026-08-07T12:50:22.338997Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","venue":"quant-ph","work_id":"d18c6309-a687-4d5d-b113-f9c30753c6ba","year":2024},"citing_paper":{"arxiv_id":"2505.23567","last_updated":"2025-05-29T15:41:11Z","snapshot_observed_at":"2026-08-15T11:39:09.025496Z","submitted_at":"2025-05-29T15:41:11Z","title":"Scalable decoding protocols for fast transversal logic in the surface code","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T12:50:19.683701Z"},"links":{"cited_paper":"/paper/2411.18287","citing_paper":"/paper/2505.23567"},"observation_digest":"sha256:f1e4836461ed32395fa8ff8b6fba3f18f2664156b085ae2f82c9d3bf2d2324cc","observation_id":"3b5c15b5-6093-4bf2-a51d-fa7d2d19e821","resolution":{"observed_at":"2026-08-07T12:50:22.387102Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18287","snapshot_observed_at":"2026-08-03T03:01:33.114825Z","title":"Fault-tolerant constant-depth Clifford gates on toric codes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.09788","last_updated":"2026-06-01T03:43:50Z","snapshot_observed_at":"2026-08-17T18:36:36.746458Z","submitted_at":"2026-02-10T13:49:00Z","title":"Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T03:01:33.114825Z"},"links":{"cited_paper":"/paper/2411.18287","citing_paper":"/paper/2602.09788"},"observation_digest":"sha256:3c4716eaae0509f032ef2c013990a0d5a19c995716c5e16e261d39fad856a234","observation_id":"4bde58b7-07a1-4d34-bb32-762744504fe7","resolution":{"observed_at":"2026-08-03T03:01:33.114825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.18287/citation-record","integrity":"/paper/2411.18287/integrity","json":"/paper/2411.18287/citation-record.json","paper":"/paper/2411.18287"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9707021","last_updated":"1997-07-09T18:28:27Z","snapshot_observed_at":"2026-07-07T07:27:02.186468Z","submitted_at":"1997-07-09T18:28:27Z","title":"Fault-tolerant quantum computation by anyons","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9707021","snapshot_observed_at":"2026-08-12T11:29:28.177362Z","title":"Fault-tolerant quantum computation by anyons","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.177362Z"},"links":{"cited_paper":"/paper/quant-ph/9707021","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:e57e76d4621e416d23397a6a7c257acad5f4287572157aaf4f697522cd1bf9c7","observation_id":"0d314dcc-80f5-4fa9-9691-61728c2523d8","resolution":{"observed_at":"2026-08-12T11:29:28.177362Z","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-12T11:29:29.075279Z","title":"Topologicalquantum memory","venue":null,"work_id":"eb85fe87-81f9-4186-8a2e-4b56aade6cb3","year":2002},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.185543Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:c0f028fb9f71a3c77ce7d8834ff3af3406c7c25a4e833b8184d07896a51fd259","observation_id":"ef2f8ec7-b94e-474c-ac6d-57586795ed04","resolution":{"observed_at":"2026-08-12T11:29:29.081333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1111.4022","last_updated":"2013-02-21T12:16:38Z","snapshot_observed_at":"2026-08-15T10:16:52.695478Z","submitted_at":"2011-11-17T06:01:47Z","title":"Surface code quantum computing by lattice surgery","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1111.4022","snapshot_observed_at":"2026-08-12T11:29:28.191528Z","title":"Sur- face code quantum computing by lattice surgery","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.191528Z"},"links":{"cited_paper":"/paper/1111.4022","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:5ee57da43813cdaba76b31247509a49ec7f98d5ac2087e070312f264d9295486","observation_id":"bfeb5fcb-2978-4bae-9408-8a5a647e24b8","resolution":{"observed_at":"2026-08-12T11:29:28.191528Z","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-12T11:29:28.198808Z","title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.198808Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:31b728d5b0fb6fc2be839242ceebea6b7bcf898901ce44ed8aea51b1cdc18585","observation_id":"697e323f-ad8f-4177-a0af-66d2abb13edf","resolution":{"observed_at":"2026-08-12T11:29:28.198808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1310.2984","last_updated":"2014-07-22T19:44:54Z","snapshot_observed_at":"2026-08-14T23:59:23.348527Z","submitted_at":"2013-10-10T23:21:37Z","title":"Fault-Tolerant Quantum Computation with Constant Overhead","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.2984","snapshot_observed_at":"2026-08-12T11:29:28.204567Z","title":"Fault-Tolerant Quantum Computation with Constant Over- head","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.204567Z"},"links":{"cited_paper":"/paper/1310.2984","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:3389fca31457b308a6f9c369a07801c3d307de63ad9ef1a112894378f9bca4f6","observation_id":"a14add31-5351-4b01-9014-0e500a194c6c","resolution":{"observed_at":"2026-08-12T11:29:28.204567Z","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-12T11:29:29.039643Z","title":"Scalable quantum computing in the presence of large detected-error rates","venue":null,"work_id":"805faabb-caba-408e-8985-aaf96aae73ef","year":2005},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.211512Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:d5efefcc3f769c5544c4c1892beee6df61dcd650b42e04b5d6484901a182f4af","observation_id":"109d62b5-924b-4264-82a0-fef1ded8cfd6","resolution":{"observed_at":"2026-08-12T11:29:29.047297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T11:29:28.217706Z","title":"Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.217706Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:d722f36b08126552d87db17224b77291859cc1e87a1ac0da2bf49a72d82b03a9","observation_id":"83b16c21-12e5-4957-8181-84926c194ea8","resolution":{"observed_at":"2026-08-12T11:29:28.217706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10794","last_updated":"2022-05-22T19:19:18Z","snapshot_observed_at":"2026-08-19T17:58:50.261315Z","submitted_at":"2021-10-20T21:49:48Z","title":"Low-overhead fault-tolerant quantum computing using long-range connectivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.10794","snapshot_observed_at":"2026-08-12T11:29:28.231426Z","title":"Low- overhead fault-tolerant quantum computing using long-range connectivity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.231426Z"},"links":{"cited_paper":"/paper/2110.10794","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:ec3016fcd5d9b9b98afe9246090d0450c2b8512c3ca3050d4301381df6af4ecf","observation_id":"cbb4a77e-1b3b-412a-bcde-6b42792fe702","resolution":{"observed_at":"2026-08-12T11:29:28.231426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03982","last_updated":"2023-12-07T01:54:45Z","snapshot_observed_at":"2026-08-16T14:36:59.254680Z","submitted_at":"2023-12-07T01:54:45Z","title":"Logical quantum processor based on reconfigurable atom arrays","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03982","snapshot_observed_at":"2026-08-12T11:29:28.238067Z","title":"Logical quantum processor based on reconfigurable atom arrays","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.238067Z"},"links":{"cited_paper":"/paper/2312.03982","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:9861715775abde26f87eb5289920d86462b5c3678fefa6cd9536bdc7091fdfa5","observation_id":"1a04f5d9-affe-4ea3-b937-0b2722da3734","resolution":{"observed_at":"2026-08-12T11:29:28.238067Z","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-12T11:29:28.245776Z","title":"Algorithmic Fault Tolerance for Fast Quantum Computing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.245776Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:15ba997a2637aba7a842bd77df805c1259aea0387e6c2ebc14a8c8ac2da5cd01","observation_id":"d4a43ca9-0eef-4895-aa35-119c7dd6ebe5","resolution":{"observed_at":"2026-08-12T11:29:28.245776Z","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-12T11:29:29.005605Z","title":"Fault-tolerant quantum computation: Theory and practice","venue":null,"work_id":"28fe546d-1ec4-4033-8932-c6dd86e365a1","year":2020},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.252069Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:e5d89eca6d5e985ea9f2c9741e7750e5cf73869a00c705ea9516a52f0dfd3548","observation_id":"5610ad9b-d70f-46dd-9c49-128ef581dab0","resolution":{"observed_at":"2026-08-12T11:29:29.011872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T11:29:28.985780Z","title":"Homomorphic Logical Measurements","venue":null,"work_id":"90e7b0eb-0853-4e73-af5b-7abdf8f87ade","year":2023},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.264579Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:7735983429ac874f9d22efd6cfc1ada9bd1933bd64b2ddf9a5992f361feced32","observation_id":"0eee8b89-77ee-45d5-b854-0a15be1a69d9","resolution":{"observed_at":"2026-08-12T11:29:28.991550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T11:29:28.271626Z","title":"Single- shot and measurement-based quantum error correction via fault complexes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.271626Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:e5bfff67445d86d1514d4a30752693ea03e4af803d57ca5c5992d62f9c859faa","observation_id":"b00ee7a1-f448-40ce-9849-3a12fc0f1ae3","resolution":{"observed_at":"2026-08-12T11:29:28.271626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.02286","last_updated":"2016-10-15T00:03:31Z","snapshot_observed_at":"2026-08-14T22:07:06.560546Z","submitted_at":"2016-03-07T21:01:21Z","title":"Transversal Clifford gates on folded surface codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.02286","snapshot_observed_at":"2026-08-12T11:29:28.279353Z","title":"Transversal Clifford gates on folded surface codes","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.279353Z"},"links":{"cited_paper":"/paper/1603.02286","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:f4b0a6737e476d2077cb4c0712ffd090d5a8a0372a685d375d8df1b2105b389f","observation_id":"eedac597-5207-4e77-96c1-2beafe38fde4","resolution":{"observed_at":"2026-08-12T11:29:28.279353Z","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-12T11:29:28.965580Z","title":"Fold-Transversal Clifford Gates for Quan- tum Codes","venue":null,"work_id":"9f0dd860-6652-4228-bfef-4a7f4e305cc5","year":2024},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.286113Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:d398dcc498766f94160f408a236148c4697c7f23cda07a84e2cef96e19225700","observation_id":"111aef7c-03b4-443c-acfa-a9ea39197e3a","resolution":{"observed_at":"2026-08-12T11:29:28.972479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T11:29:28.944435Z","title":"Hyperbolic and semi-hyperbolic surface codes for quantum stor- age","venue":null,"work_id":"f12d2816-7932-4cfb-b227-8c188604f0cd","year":2017},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.292613Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:5365b0240ec89d3be530bd887519b373aa916801471d3463eb724a4520d1d8fe","observation_id":"4097c840-138a-4339-b980-652cb5794305","resolution":{"observed_at":"2026-08-12T11:29:28.950167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9811052","last_updated":"1998-11-20T03:23:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1998-11-20T03:23:13Z","title":"Quantum codes on a lattice with boundary","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9811052","snapshot_observed_at":"2026-08-12T11:29:28.298428Z","title":"Quantum codes on a lattice with boundary","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.298428Z"},"links":{"cited_paper":"/paper/quant-ph/9811052","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:9e15b770c76bb3597bfc42c1c37351229b478b854a1104f74aed3c1974e97204","observation_id":"f1d94053-9f70-45fc-909c-7ef2a468f914","resolution":{"observed_at":"2026-08-12T11:29:28.298428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-12T11:29:28.305782Z","title":"Methodology for quantum logic gate constructions","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.305782Z"},"links":{"cited_paper":"/paper/quant-ph/0002039","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:2c9aa80c0bb502be318ed73cc0e64209cf3de1311bb22dc6a32d0d6f9fb0ace1","observation_id":"3f669a30-b042-4159-bda0-58688d2d3568","resolution":{"observed_at":"2026-08-12T11:29:28.305782Z","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-12T11:29:28.925307Z","title":"Universal quantum computation with ideal Clifford gates and noisy ancillas","venue":null,"work_id":"411e382d-af94-4bc9-8d16-63f4929a86f0","year":2005},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.313223Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:8646a9659ed3c34ec2f0b49bc335698af7f2c81fa8600b0f2eb5c2c27e692b26","observation_id":"28d61a92-d544-4e50-b6f0-0b444706b740","resolution":{"observed_at":"2026-08-12T11:29:28.930656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.02202","last_updated":"2021-06-18T05:03:01Z","snapshot_observed_at":"2026-08-16T18:41:39.137374Z","submitted_at":"2021-03-03T06:21:21Z","title":"Stim: a fast stabilizer circuit simulator","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.02202","snapshot_observed_at":"2026-08-12T11:29:28.324086Z","title":"Stim: A fast stabilizer circuit simulator","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.324086Z"},"links":{"cited_paper":"/paper/2103.02202","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:95c4d2f64b0de6a563d216f1c58ab445d48550f1bceb47707c2819a082c1ce7b","observation_id":"f20d822e-d249-4a2f-849c-56ce3934ade3","resolution":{"observed_at":"2026-08-12T11:29:28.324086Z","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-12T11:29:28.904592Z","title":"Reducibility among combinatorial problems","venue":null,"work_id":"5c58b6e9-9a83-4f80-80ce-f39321e0919b","year":1972},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.333223Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:48ec5d39f758251545013e2eba5ac8968ed051f85fa5db318f44cc6c0fc59ec4","observation_id":"c269c3e8-040c-49d6-a869-4ba20975a6f8","resolution":{"observed_at":"2026-08-12T11:29:28.912329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03272","last_updated":"2025-04-07T16:29:51Z","snapshot_observed_at":"2026-08-16T14:12:31.555911Z","submitted_at":"2024-03-05T19:13:32Z","title":"Correlated decoding of logical algorithms with transversal gates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03272","snapshot_observed_at":"2026-08-12T11:29:28.341074Z","title":"Correlated decoding of logical algorithms with transversal gates","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.341074Z"},"links":{"cited_paper":"/paper/2403.03272","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:5720701d953e9b60c5439e8cb3ee4283f769e28fd180280bc2c3ce9de2f26aec","observation_id":"2a211273-c965-4014-89e0-1dd7e77c94aa","resolution":{"observed_at":"2026-08-12T11:29:28.341074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-14T20:31:58.041180Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-08-12T11:29:28.346817Z","title":"Almost-linear time decoding algorithm for topological codes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.346817Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:6f81e565339828f431220c7a6b63359390217a8bc2a26e51b848bed899f8f2a6","observation_id":"e8fd7af5-7b43-47b6-a351-1fdd01168e62","resolution":{"observed_at":"2026-08-12T11:29:28.346817Z","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-12T11:29:28.355244Z","title":"Tutorial on the Quantikz Package","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:28.355244Z"},"links":{"citing_paper":"/paper/2411.18287"},"observation_digest":"sha256:bcc8d2e9aad3777fc70aed4066cbb605ea4ba3c41e1777e936104243fa33cca6","observation_id":"6a71d9ab-2d5d-4281-a436-c44a297caa08","resolution":{"observed_at":"2026-08-12T11:29:28.355244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.18287","last_updated":"2024-11-27T12:17:56Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T23:29:44.586522Z","submitted_at":"2024-11-27T12:17:56Z","title":"Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":24},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 4 inbound Pith citation observations for arXiv:2411.18287."}