{"as_of":"2026-08-23T04:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7af4f2509f868549dc4a57965dc08f9f705d77d40c1ad3a4d4ae3fea3458bf27","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:11:09.158880Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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-08-08T01:03:22.326338Z","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-08T01:03:23.578873Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"cited_work":{"arxiv_id":"2607.26477","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.26477","snapshot_observed_at":"2026-08-08T01:03:23.578873Z","title":"Finding diagonal logical gates in CSS codes and circuits","venue":"quant-ph","work_id":"cec6d307-2a36-4c95-904f-6fdb2cc11327","year":2026},"citing_paper":{"arxiv_id":"2608.05688","last_updated":"2026-08-06T07:28:20Z","snapshot_observed_at":"2026-08-17T17:53:02.607185Z","submitted_at":"2026-08-06T07:28:20Z","title":"Beyond transversality: structure of Clifford circuits for CSS codes","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T01:03:22.326338Z"},"links":{"cited_paper":"/paper/2607.26477","citing_paper":"/paper/2608.05688"},"observation_digest":"sha256:8f0baea314e4a8039294582ab2501fcfb24553d8697e7318674dcff6a1f5d04e","observation_id":"b6ae1dcf-c20c-4cbc-bc2c-0c32d87413fe","resolution":{"observed_at":"2026-08-08T01:03:23.582492Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2607.26477/citation-record","integrity":"/paper/2607.26477/integrity","json":"/paper/2607.26477/citation-record.json","paper":"/paper/2607.26477"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0403025","last_updated":"2004-12-16T12:49:57Z","snapshot_observed_at":"2026-08-21T23:42:06.814101Z","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-01T15:11:06.197196Z","title":"Universal quan- tum computation with ideal clifford gates and noisy ancillas","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:06.197196Z"},"links":{"cited_paper":"/paper/quant-ph/0403025","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:0895383cc4e5509676a2eb5cb149b2207c4c4c3b1d9fa6d5e43e812ec23f57ba","observation_id":"7eeb7508-48c4-4ae9-ada5-79aa45eb1999","resolution":{"observed_at":"2026-08-01T15:11:06.197196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1209.2426","last_updated":"2012-09-11T20:04:05Z","snapshot_observed_at":"2026-08-15T04:17:30.721088Z","submitted_at":"2012-09-11T20:04:05Z","title":"Magic state distillation with low overhead","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.2426","snapshot_observed_at":"2026-08-01T15:11:06.324657Z","title":"Magic state distillation with low overhead","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:06.324657Z"},"links":{"cited_paper":"/paper/1209.2426","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:af301c9aa197fed8bcb263908b7e869aa5b38b2b11ced06610a901f83f1587f1","observation_id":"afc7df0b-8559-4784-b31e-69412dceb8b4","resolution":{"observed_at":"2026-08-01T15:11:06.324657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.06903","last_updated":"2019-11-06T17:52:15Z","snapshot_observed_at":"2026-08-18T10:17:09.039534Z","submitted_at":"2019-05-16T16:52:52Z","title":"Magic State Distillation: Not as Costly as You Think","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.06903","snapshot_observed_at":"2026-08-01T15:11:06.549619Z","title":"Magic state distillation: Not as costly as you think","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:06.549619Z"},"links":{"cited_paper":"/paper/1905.06903","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:f765efb7a98c05351dd4827265510959ee57729d43ef72688d641e0b313b6ac0","observation_id":"78c9fc3a-eeb5-4fb3-898d-5f58f3419b09","resolution":{"observed_at":"2026-08-01T15:11:06.549619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07764","last_updated":"2024-08-21T03:22:09Z","snapshot_observed_at":"2026-08-21T23:15:45.953497Z","submitted_at":"2024-08-14T18:31:22Z","title":"Constant-Overhead Magic State Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.07764","snapshot_observed_at":"2026-08-01T15:11:06.730542Z","title":"Constant-overhead magic state distilla- tion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:06.730542Z"},"links":{"cited_paper":"/paper/2408.07764","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:a59fbe1320c12f45e528ce63f4caaa0c617543c20f8097dce8d497fdb4ca7ab2","observation_id":"7b30b973-8e6e-4c64-a37e-a3bb71ad7b80","resolution":{"observed_at":"2026-08-01T15:11:06.730542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0811.4262","last_updated":"2009-07-09T22:52:52Z","snapshot_observed_at":"2026-08-15T10:01:10.594980Z","submitted_at":"2008-11-26T10:09:31Z","title":"Restrictions on Transversal Encoded Quantum Gate Sets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0811.4262","snapshot_observed_at":"2026-08-01T15:11:06.898636Z","title":"Restrictions on transversal encoded quantum gate sets","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:06.898636Z"},"links":{"cited_paper":"/paper/0811.4262","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:eee2eb40796cdd245348cd7124a9c10f2d9244ded0c79f21a87c0c1d60fcd4be","observation_id":"4df4670d-efc3-4479-9fce-e22a7875e7d2","resolution":{"observed_at":"2026-08-01T15:11:06.898636Z","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-21T19:59:09.796826Z","submitted_at":"2014-12-16T16:52:56Z","title":"Dimensional Jump in Quantum Error Correction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.5079","snapshot_observed_at":"2026-08-01T15:11:07.110668Z","title":"Dimensional jump in quantum er- ror correction","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:07.110668Z"},"links":{"cited_paper":"/paper/1412.5079","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:7061dc92aecdbad5a2aec8957205a5a13f0e5439ffaf61c2fff1296992d5ee0c","observation_id":"4a710234-9051-4901-9417-a8a61c78b16c","resolution":{"observed_at":"2026-08-01T15:11:07.110668Z","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-21T19:59:11.404378Z","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-01T15:11:07.281214Z","title":"Univer- sal fault-tolerant quantum computation with only transversal gates and error correction","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:07.281214Z"},"links":{"cited_paper":"/paper/1304.3709","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:f358995a78a1a55cf00374b5f9605420b5da5041613a572ebc50de031c0d2bdf","observation_id":"c25522a5-1000-475a-9352-cdf84ed9f95b","resolution":{"observed_at":"2026-08-01T15:11:07.281214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.0069","last_updated":"2014-09-30T22:35:07Z","snapshot_observed_at":"2026-08-20T03:36:48.844976Z","submitted_at":"2014-09-30T22:35:07Z","title":"Universal transversal gates with color codes - a simplified approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.0069","snapshot_observed_at":"2026-08-01T15:11:07.425359Z","title":"Universal transversal gates with color codes - a simplified approach","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:07.425359Z"},"links":{"cited_paper":"/paper/1410.0069","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:287c7f4a5240a848615acb2fe530881c017728b1d343385c8969b09fe28027e6","observation_id":"ebfddeaf-f8cf-4f06-88bd-362c14f37f44","resolution":{"observed_at":"2026-08-01T15:11:07.425359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.02211","last_updated":"2021-01-06T19:00:01Z","snapshot_observed_at":"2026-08-16T18:53:53.026383Z","submitted_at":"2021-01-06T19:00:01Z","title":"The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.02211","snapshot_observed_at":"2026-08-01T15:11:07.518129Z","title":"The cost of universality: A com- parative study of the overhead of state distillation and code switching with color codes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:07.518129Z"},"links":{"cited_paper":"/paper/2101.02211","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:f5bbe9b7a0e34b06e6b8b0eaab8babdf6b99ab679f6794e086d811dd2c30d12e","observation_id":"aa72f486-cacf-41b8-9208-e4ad69a74f29","resolution":{"observed_at":"2026-08-01T15:11:07.518129Z","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-01T15:11:07.664318Z","title":"Non- clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate ho- mological quantum ldpc codes via higher sym- metries","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:07.664318Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:c796a06d1dfb9a4227d033a7acb9a05dd211e0cf6e42901e2fe64291e20148cb","observation_id":"7c2fff03-50bd-43d6-94db-984f632843de","resolution":{"observed_at":"2026-08-01T15:11:07.664318Z","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-01T15:11:07.814177Z","title":"Transversal dimension jump for product qldpc codes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:07.814177Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:fe0b8ab12da708125bd7110525a0ce2aa6d5ba506564fbe705ff69133b8fb023","observation_id":"3d1bd14e-29fc-4f3b-8dd4-697ae3b3afb0","resolution":{"observed_at":"2026-08-01T15:11:07.814177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.03049","last_updated":"2020-03-06T06:24:02Z","snapshot_observed_at":"2026-08-19T23:44:12.117400Z","submitted_at":"2020-03-06T06:24:02Z","title":"Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.03049","snapshot_observed_at":"2026-08-01T15:11:07.972749Z","title":"Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:07.972749Z"},"links":{"cited_paper":"/paper/2003.03049","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:a4543c5c5b4b6490198b7089314131c81b6b43d82d98d958197f6dbdd84b0a19","observation_id":"84d077f1-39cf-49b7-909c-b9ccc3f40155","resolution":{"observed_at":"2026-08-01T15:11:07.972749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00813","last_updated":"2022-12-01T19:00:02Z","snapshot_observed_at":"2026-08-17T00:01:43.906663Z","submitted_at":"2022-12-01T19:00:02Z","title":"Fault-tolerant Post-Selection for Low Overhead Magic State Preparation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.00813","snapshot_observed_at":"2026-08-01T15:11:08.142283Z","title":"Fault-tolerant post- selection for low overhead magic state prepa- ration","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:08.142283Z"},"links":{"cited_paper":"/paper/2212.00813","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:dc7f0c152acadb4a67c1f2efc1a014f1d5c3cdeb809f378ef0c6c5e93918a17d","observation_id":"4bd6690f-46ae-4207-b663-8c6bcae4826b","resolution":{"observed_at":"2026-08-01T15:11:08.142283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-01T15:11:08.278232Z","title":"Magic state cultivation: growing t states as cheap as cnot gates","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:08.278232Z"},"links":{"cited_paper":"/paper/2409.17595","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:1339a95ccc32e18fe067aa9400f863b0238ec5ce3c0ad45cbdbeb25c4e786c8a","observation_id":"5f8c4ffd-3a1c-4ddb-a9de-165a6e850194","resolution":{"observed_at":"2026-08-01T15:11:08.278232Z","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-01T15:11:08.366837Z","title":"Magic state cultivation on a superconducting quantum processor","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:08.366837Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:f4e017e9cf35c842e554a3764893c13a6aee9535f5e15afd256b5ba055b0db27","observation_id":"563d12a7-719f-4567-affc-44165e5f1141","resolution":{"observed_at":"2026-08-01T15:11:08.366837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.09571","last_updated":"2018-10-22T21:44:52Z","snapshot_observed_at":"2026-08-19T19:10:59.810432Z","submitted_at":"2018-10-22T21:44:52Z","title":"2D quantum computation with 3D topological codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.09571","snapshot_observed_at":"2026-08-01T15:11:08.486653Z","title":"2d quantum computation with 3d topological codes","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:08.486653Z"},"links":{"cited_paper":"/paper/1810.09571","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:e1be51883335e8d044a2ff190a291c047504024c98e9ba519085c02d183afba9","observation_id":"1116bf41-0731-46f5-8fdb-20162ab534d8","resolution":{"observed_at":"2026-08-01T15:11:08.486653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.11634","last_updated":"2021-04-16T23:28:13Z","snapshot_observed_at":"2026-08-19T06:05:40.465027Z","submitted_at":"2019-03-27T18:18:16Z","title":"A fault-tolerant non-Clifford gate for the surface code in two dimensions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.11634","snapshot_observed_at":"2026-08-01T15:11:08.644980Z","title":"A fault-tolerant non-clifford gate for the surface code in two dimensions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:08.644980Z"},"links":{"cited_paper":"/paper/1903.11634","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:9e7d622444eff64f0a8307469dc915996d64e619b4e22a1c85337a0b19ced91b","observation_id":"be68bd5c-2039-4fb7-ab9b-024dc5484a69","resolution":{"observed_at":"2026-08-01T15:11:08.644980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-19T19:24:58.491018Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-08-01T15:11:08.775040Z","title":"Universal fault tolerant quantum computing in 2d without getting tied in knots","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:08.775040Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:095de213020bee1e128db484064cdd52d162203fb60e3b7ece69fa0e02e2b8dd","observation_id":"5767a3be-b338-44b4-9a37-e2e785115404","resolution":{"observed_at":"2026-08-01T15:11:08.775040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12119","last_updated":"2025-03-18T02:56:16Z","snapshot_observed_at":"2026-08-20T12:35:57.794767Z","submitted_at":"2024-03-18T18:00:00Z","title":"Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12119","snapshot_observed_at":"2026-08-01T15:11:08.942978Z","title":"Low-overhead non-clifford topo- logical fault-tolerant circuits for all non-chiral abelian topological phases","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:08.942978Z"},"links":{"cited_paper":"/paper/2403.12119","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:cf05c0ce71f52276e4288d55182f82e9eb97cb29338120daaec3175d718ea835","observation_id":"ccad375d-325d-4c07-b00e-5134a1156308","resolution":{"observed_at":"2026-08-01T15:11:08.942978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.05175","last_updated":"2026-07-17T21:06:24Z","snapshot_observed_at":"2026-08-22T02:47:27.874523Z","submitted_at":"2025-05-08T12:23:22Z","title":"Planar fault-tolerant circuits for non-Clifford gates on the 2D color code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.05175","snapshot_observed_at":"2026-08-01T15:11:09.005420Z","title":"Planar fault-tolerant circuits for non- clifford gates on the 2d color code","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.005420Z"},"links":{"cited_paper":"/paper/2505.05175","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:ef9ac3859d5ef4a6154268f1ee2f63030cfec5968c11aa1319248eef68bc7862","observation_id":"a78ed6cb-8928-4bab-9141-5a5ba3e6f020","resolution":{"observed_at":"2026-08-01T15:11:09.005420Z","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-01T15:11:09.009719Z","title":"High-threshold decoding of non-pauli codes for 2d universal- ity","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.009719Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:bcc15c311e791addb81655cc9f67221c60f015a3844cf907abd486c67926fef9","observation_id":"8bebee5a-a1f3-4130-bfc1-f690127bcc56","resolution":{"observed_at":"2026-08-01T15:11:09.009719Z","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-01T15:11:09.014057Z","title":"Non-abelian qldpc: Tqft formalism, ad- dressable gauging measurement and application to magic state fountain on 2d product codes","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.014057Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:82dd522b95c799d9d004dccc275352ebd737bd831925f6065672564e1729fbd0","observation_id":"7c93ab87-adc2-4952-8001-d38d7c2fa2e2","resolution":{"observed_at":"2026-08-01T15:11:09.014057Z","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-01T15:11:09.018156Z","title":"Fast magic state prepa- ration by gauging higher-form transversal gates in parallel","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.018156Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:2f261bbb73b9371ff1bca51aec86778cfd6ee2315e669dc06b65af3c572f17d3","observation_id":"f91f297f-d26d-4a5b-9d52-de7614ca9d3b","resolution":{"observed_at":"2026-08-01T15:11:09.018156Z","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-01T15:11:09.022137Z","title":"Non-abelian quantum low-density parity check codes and non-clifford op- erations from gauging logical gates via measure- ments","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.022137Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:174cc59284c6890b6bc71604c9cf6b64d7053c7826d4cc9ee085204005110532","observation_id":"f4505dfc-e0ec-4109-a2f1-11c69b89b1b8","resolution":{"observed_at":"2026-08-01T15:11:09.022137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16250","last_updated":"2025-12-27T21:52:26Z","snapshot_observed_at":"2026-08-18T14:31:14.141222Z","submitted_at":"2024-10-21T17:53:17Z","title":"Cups and Gates I: Cohomology invariants and logical quantum operations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16250","snapshot_observed_at":"2026-08-01T15:11:09.026353Z","title":"Cups and gates i: Cohomol- ogy invariants and logical quantum opera- tions","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.026353Z"},"links":{"cited_paper":"/paper/2410.16250","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:8b48b8c113452a1060e8592140edec268ae5b278c203c57335a22dd281cb84e8","observation_id":"c88a1792-35f6-443c-a7ac-e643809a4574","resolution":{"observed_at":"2026-08-01T15:11:09.026353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14631","last_updated":"2024-10-18T17:31:19Z","snapshot_observed_at":"2026-08-19T04:15:44.905708Z","submitted_at":"2024-10-18T17:31:19Z","title":"Transversal non-Clifford gates for quantum LDPC codes on sheaves","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14631","snapshot_observed_at":"2026-08-01T15:11:09.030960Z","title":"Transversal non-clifford gates for quantum ldpc codes on sheaves","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.030960Z"},"links":{"cited_paper":"/paper/2410.14631","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:58f63d4d0357c5b744cf53814c4db29183d9be9ff3a9ea1e0dfbe272fa4f66f2","observation_id":"d164a4fa-cfb9-4d9a-9287-3f66e2c84e23","resolution":{"observed_at":"2026-08-01T15:11:09.030960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.01874","last_updated":"2026-07-02T17:00:07Z","snapshot_observed_at":"2026-08-21T10:50:20.015660Z","submitted_at":"2026-04-02T10:30:00Z","title":"Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.01874","snapshot_observed_at":"2026-08-01T15:11:09.035190Z","title":"Transver- sal non-clifford gates on almost-good quantum ldpc and quantum locally testable codes","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.035190Z"},"links":{"cited_paper":"/paper/2604.01874","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:5411ddbfcd4cc13c2d6ed7fee9237f9d042c0612ee589d07c77d526deff27ab3","observation_id":"332506af-3094-4f04-9a4d-cadd9d5e4c44","resolution":{"observed_at":"2026-08-01T15:11:09.035190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02065","last_updated":"2015-03-06T20:51:01Z","snapshot_observed_at":"2026-08-16T04:26:21.166937Z","submitted_at":"2015-03-06T20:51:01Z","title":"Unfolding the color code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02065","snapshot_observed_at":"2026-08-01T15:11:09.039520Z","title":"Unfolding the color code","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.039520Z"},"links":{"cited_paper":"/paper/1503.02065","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:ce714dc40d31403dc46af84d647c1b7d3ce4571bde42ab4fdb0ae0d74ced3ae3","observation_id":"5358a8e0-a0bf-43db-be3f-2222355e78b0","resolution":{"observed_at":"2026-08-01T15:11:09.039520Z","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-01T15:11:09.044142Z","title":"url:https://github.com/ andibau13/diagonal-gate-finder","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.044142Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:eb6e301fdd2a084295f0f67387a71f1a509efd184700776dcb703b648b23752d","observation_id":"1412c022-4456-4375-8781-34ef1c2cf6c6","resolution":{"observed_at":"2026-08-01T15:11:09.044142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.02832","last_updated":"2018-05-30T22:41:28Z","snapshot_observed_at":"2026-08-18T09:51:02.391948Z","submitted_at":"2017-09-08T18:50:40Z","title":"Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.02832","snapshot_observed_at":"2026-08-01T15:11:09.048696Z","title":"Codes and protocols for distillingt, controlled- s, and toffoli gates","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.048696Z"},"links":{"cited_paper":"/paper/1709.02832","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:1f056fd6217afdf967a029273d404b4dd167a0ff8f3b57f05f56cef561a65ba1","observation_id":"1f44a883-fb47-4ec9-8a8d-1a7853745c81","resolution":{"observed_at":"2026-08-01T15:11:09.048696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15615","last_updated":"2023-04-26T10:22:37Z","snapshot_observed_at":"2026-08-16T19:08:37.177054Z","submitted_at":"2023-03-27T21:49:37Z","title":"Transversal Diagonal Logical Operators for Stabiliser Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15615","snapshot_observed_at":"2026-08-01T15:11:09.053225Z","title":"Transversal diagonal logical operators for stabiliser codes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.053225Z"},"links":{"cited_paper":"/paper/2303.15615","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:207626bf0ac602002f49af895e6b49b5873ecb2dd1a839d0d1103999f16abe3b","observation_id":"97c7cb19-3750-426b-a56a-5325252ba9d5","resolution":{"observed_at":"2026-08-01T15:11:09.053225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.00310","last_updated":"2021-08-18T19:32:22Z","snapshot_observed_at":"2026-08-14T16:10:13.216507Z","submitted_at":"2019-06-30T03:22:02Z","title":"Logical Clifford Synthesis for Stabilizer Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.00310","snapshot_observed_at":"2026-08-01T15:11:09.058951Z","title":"Logical clifford synthesis for stabilizer codes","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.058951Z"},"links":{"cited_paper":"/paper/1907.00310","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:e00dc10bbb4bde5f99a95b60ca150adecaa12494ef90b2385128fd29b7c4adf3","observation_id":"198dea95-a273-44b6-ab71-965d5707122e","resolution":{"observed_at":"2026-08-01T15:11:09.058951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-16T13:15:00.392284Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-01T15:11:09.063964Z","title":"Fault-tolerant logical clifford gates from code au- tomorphisms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.063964Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:be484b752d5edabe8ec240f02e8b6fb972f4696608137110f2278b4e098639aa","observation_id":"3f6ba2e6-b1aa-4368-8720-a4cfff498c3d","resolution":{"observed_at":"2026-08-01T15:11:09.063964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.02482","last_updated":"2026-07-02T17:49:54Z","snapshot_observed_at":"2026-08-16T09:06:10.474658Z","submitted_at":"2026-07-02T17:49:54Z","title":"Automated logical Clifford gadgets for heterogeneous architectures via chain maps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.02482","snapshot_observed_at":"2026-08-01T15:11:09.068979Z","title":"Au- tomated logical clifford gadgets for heteroge- neous architectures via chain maps","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.068979Z"},"links":{"cited_paper":"/paper/2607.02482","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:1598f4f0583ea624c2ef603a4c330b98d75c0ad603ed2a903a89a6504321130b","observation_id":"110e4f72-3998-47c6-ae91-6360d0e831bb","resolution":{"observed_at":"2026-08-01T15:11:09.068979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9908010","last_updated":"1999-08-02T21:36:39Z","snapshot_observed_at":"2026-07-07T07:29:28.939129Z","submitted_at":"1999-08-02T21:36:39Z","title":"Quantum Teleportation is a Universal Computational Primitive","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9908010","snapshot_observed_at":"2026-08-01T15:11:09.073187Z","title":"Quan- tum teleportation is a universal computational primitive","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.073187Z"},"links":{"cited_paper":"/paper/quant-ph/9908010","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:c712d9b4b542e9ba6b01fcba6667eff227d469feefe5681d860bef896c65ea4d","observation_id":"8b320b0b-5865-46ce-8ff7-f340ddb12d55","resolution":{"observed_at":"2026-08-01T15:11:09.073187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.06596","last_updated":"2016-08-23T18:07:52Z","snapshot_observed_at":"2026-08-14T21:43:04.756316Z","submitted_at":"2016-08-23T18:07:52Z","title":"Diagonal gates in the Clifford hierarchy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.06596","snapshot_observed_at":"2026-08-01T15:11:09.077573Z","title":"Diagonal gates in the clifford hierarchy","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.077573Z"},"links":{"cited_paper":"/paper/1608.06596","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:ec1d1af810170d1de2350969590a01eabfd76387146e2571cf486c5d673a6d0c","observation_id":"adce76ec-ed95-4fbd-b9b2-7c4acfc2ae2c","resolution":{"observed_at":"2026-08-01T15:11:09.077573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1007.2477","last_updated":"2010-07-15T05:17:01Z","snapshot_observed_at":"2026-08-15T05:13:50.821082Z","submitted_at":"2010-07-15T05:17:01Z","title":"Solving linear equations over finitely generated abelian groups","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1007.2477","snapshot_observed_at":"2026-08-01T15:11:09.082466Z","title":"Solving linear equations over finitely generated abelian groups","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.082466Z"},"links":{"cited_paper":"/paper/1007.2477","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:c2799680d4fc18e477d48c40c3eb3dddbde25f817f403dd7dee964355105fa7e","observation_id":"67c5fdcf-3465-43d2-94c0-9992b0762eab","resolution":{"observed_at":"2026-08-01T15:11:09.082466Z","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-01T15:11:09.087464Z","title":"Exact solution of linear equations using p-adic expansions","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.087464Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:77c0b0f92f42e12067af014c9cd1f34cf172ec186c8f523e52397511b8a77222","observation_id":"856924ee-44a0-412d-91a4-0332404ccc11","resolution":{"observed_at":"2026-08-01T15:11:09.087464Z","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-01T15:11:09.092331Z","title":"url:https://github.com/ andibau13/twogroup-linalg","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.092331Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:dd1a291c0b35baf74ab1005ebb837e043b7c685f808351c78ff74f61b873d437","observation_id":"eea632a4-1a38-4e72-a9e8-878d368847c1","resolution":{"observed_at":"2026-08-01T15:11:09.092331Z","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-01T15:11:09.096672Z","title":"url:https://github.com/ akissinger/bitgauss","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.096672Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:00133d529fa931939b7ce5fc3f482140f6179998df1f5379822355568ba27700","observation_id":"5b3fa3c3-f981-4bac-b26a-cbc55af0ddec","resolution":{"observed_at":"2026-08-01T15:11:09.096672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.07915","last_updated":"2024-02-21T00:30:47Z","snapshot_observed_at":"2026-08-16T15:08:18.351628Z","submitted_at":"2023-08-15T17:55:12Z","title":"High-threshold and low-overhead fault-tolerant quantum memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.07915","snapshot_observed_at":"2026-08-01T15:11:09.101518Z","title":"High-threshold and low- overhead fault-tolerant quantum memory","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.101518Z"},"links":{"cited_paper":"/paper/2308.07915","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:e6ac9140d7bdc21a428b4da417031ad4128a7fb166e40c162b57c64686eb96e8","observation_id":"766f3175-ed9b-4927-9367-74c2434eef4f","resolution":{"observed_at":"2026-08-01T15:11:09.101518Z","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-01T15:11:09.106399Z","title":"Picturing quan- tum processes: A first course in quantum theory and diagrammatic reasoning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.106399Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:a388b44c60c97daeeaa693c9edc80104e5cb5960d8624f4c9a7c19202b28d700","observation_id":"0b75326d-626a-4a74-b0e0-3781977fc278","resolution":{"observed_at":"2026-08-01T15:11:09.106399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13966","last_updated":"2020-12-27T15:54:25Z","snapshot_observed_at":"2026-08-18T07:31:32.477651Z","submitted_at":"2020-12-27T15:54:25Z","title":"ZX-calculus for the working quantum computer scientist","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13966","snapshot_observed_at":"2026-08-01T15:11:09.110582Z","title":"Zx-calculus for the working quantum computer scientist","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.110582Z"},"links":{"cited_paper":"/paper/2012.13966","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:ed98e60f90f7fd9d26dfbcd866d1aad5164fb44aff66d5cec7db9588311da1a9","observation_id":"f9b2712f-4fee-4f27-ba6a-dc1648a5a306","resolution":{"observed_at":"2026-08-01T15:11:09.110582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.14038","last_updated":"2022-04-29T12:17:51Z","snapshot_observed_at":"2026-08-20T12:51:19.244453Z","submitted_at":"2022-04-29T12:17:51Z","title":"Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.14038","snapshot_observed_at":"2026-08-01T15:11:09.115879Z","title":"Phase-free zx diagrams are css codes (...or how to graphically grok the surface code)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.115879Z"},"links":{"cited_paper":"/paper/2204.14038","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:a89a82b1d8655a32e7ae35d0d0a2591274a7c2b5d8a74bcdabd5a28606ab8cf0","observation_id":"0aa20231-ec09-41d4-a3be-bdea7a56e2f5","resolution":{"observed_at":"2026-08-01T15:11:09.115879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16405","last_updated":"2024-03-12T21:28:11Z","snapshot_observed_at":"2026-08-16T15:44:32.177868Z","submitted_at":"2023-03-29T02:32:18Z","title":"Topological error correcting processes from fixed-point path integrals","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16405","snapshot_observed_at":"2026-08-01T15:11:09.120553Z","title":"Topological error correcting pro- cesses from fixed-point path integrals","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.120553Z"},"links":{"cited_paper":"/paper/2303.16405","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:7373de894cc181e113a90f42edda5933dfc62197b18ce5bc448a02a6d4bd057b","observation_id":"848e8bf1-810f-4cf0-a2b0-347e8bfc3538","resolution":{"observed_at":"2026-08-01T15:11:09.120553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08829","last_updated":"2024-06-12T14:36:11Z","snapshot_observed_at":"2026-08-16T15:47:55.207144Z","submitted_at":"2023-03-15T18:00:00Z","title":"Unifying flavors of fault tolerance with the ZX calculus","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08829","snapshot_observed_at":"2026-08-01T15:11:09.125339Z","title":"Unify- ing flavors of fault tolerance with the zx calcu- lus","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.125339Z"},"links":{"cited_paper":"/paper/2303.08829","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:0be2effc5bdee78017ce1e03f15d75400819d1f48acd347a143740877b75d0bc","observation_id":"7e7df78e-119d-4998-9873-fff9262dd009","resolution":{"observed_at":"2026-08-01T15:11:09.125339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07265","last_updated":"2025-03-17T02:06:09Z","snapshot_observed_at":"2026-08-16T13:26:36.073408Z","submitted_at":"2024-08-14T03:15:08Z","title":"The x+y Floquet code: A simple example for topological quantum computation in the path integral approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.07265","snapshot_observed_at":"2026-08-01T15:11:09.130646Z","title":"The x+y floquet code: A simple example for topological quantum computation in the path integral approach","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.130646Z"},"links":{"cited_paper":"/paper/2408.07265","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:2dee79bd4e84e0ebd7b2cecf72ab5d1835410fd39824326a9343f017ffe63e3b","observation_id":"64d84881-1388-4225-9cc8-bc59dc6dce5e","resolution":{"observed_at":"2026-08-01T15:11:09.130646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1206.1609","last_updated":"2012-06-07T20:38:35Z","snapshot_observed_at":"2026-08-15T04:17:32.302591Z","submitted_at":"2012-06-07T20:38:35Z","title":"Classification of topologically protected gates for local stabilizer codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.1609","snapshot_observed_at":"2026-08-01T15:11:09.135010Z","title":"Classification of topologically protected gates for local stabilizer codes","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.135010Z"},"links":{"cited_paper":"/paper/1206.1609","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:6164e4bc0c3bb68343037ebd69f8221add2fe01181073e9d049fde100821cc72","observation_id":"a2971d9a-1a77-4870-aa55-8cae1864de77","resolution":{"observed_at":"2026-08-01T15:11:09.135010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.8320","last_updated":"2014-09-29T20:43:19Z","snapshot_observed_at":"2026-08-14T23:17:38.952621Z","submitted_at":"2014-09-29T20:43:19Z","title":"Classification of transversal gates in qubit stabilizer codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.8320","snapshot_observed_at":"2026-08-01T15:11:09.139506Z","title":"Classification of transversal gates in qubit stabi- lizer codes","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.139506Z"},"links":{"cited_paper":"/paper/1409.8320","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:223b21a1f9becec66cc9e170f6539e6f2569d96de20b8f68a75d7b34e98af7b4","observation_id":"77778f2a-a4ea-4251-9d87-e3dcdef32daf","resolution":{"observed_at":"2026-08-01T15:11:09.139506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.07256","last_updated":"2017-10-19T17:25:32Z","snapshot_observed_at":"2026-08-17T00:37:33.443788Z","submitted_at":"2017-10-19T17:25:32Z","title":"The disjointness of stabilizer codes and limitations on fault-tolerant logical gates","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.07256","snapshot_observed_at":"2026-08-01T15:11:09.144842Z","title":"The disjointness of stabi- lizer codes and limitations on fault-tolerant log- ical gates","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.144842Z"},"links":{"cited_paper":"/paper/1710.07256","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:cf607718e83360cc1108ff2022ad61cbec118e6b330f1e1ed1b3204fc30428be","observation_id":"1238e6e2-a894-414d-bbf5-13802d174ddb","resolution":{"observed_at":"2026-08-01T15:11:09.144842Z","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-01T15:11:09.149154Z","title":"Quadratic ten- sors as a unification of clifford, gaussian, and free- fermion physics","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.149154Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:37b04b1a3e0949444ce1ec4d767cc2324e032eea993057f28a0a0a9d4a8995e4","observation_id":"cbc847ba-f3b4-46d7-b01d-35e0addfc9e2","resolution":{"observed_at":"2026-08-01T15:11:09.149154Z","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-01T15:11:09.154592Z","title":"Solving sparse linear equations over finite fields","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.154592Z"},"links":{"citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:af46ccb5366f692a2e52e4f57c2c21b53ada5ac4f5035c3a4000551fec7397bb","observation_id":"7aad8442-01df-45ba-a6b0-410ed6e1fec9","resolution":{"observed_at":"2026-08-01T15:11:09.154592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1204.1063","last_updated":"2013-05-30T05:16:33Z","snapshot_observed_at":"2026-08-19T16:37:46.773696Z","submitted_at":"2012-04-04T20:00:58Z","title":"Commuting Pauli Hamiltonians as maps between free modules","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1204.1063","snapshot_observed_at":"2026-08-01T15:11:09.158880Z","title":"Commuting pauli hamiltonians as maps between free modules","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.158880Z"},"links":{"cited_paper":"/paper/1204.1063","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:4ddc918b1d9e4c4833d9ff66031b009add6df0ffab08b3d6ab50a78933a968a9","observation_id":"9d4dca4b-37da-4ebb-a419-dcfe38066c8f","resolution":{"observed_at":"2026-08-01T15:11:09.158880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T22:08:26.539378Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":53,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":53},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2607.26477."}