{"as_of":"2026-08-10T13:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d0f22d1bdcad0b7a9e744f4dc322a510d75364dde6492b2384cab7f98901e26","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:56:10.577267Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-06T23:56:10.299570Z","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-06T23:56:11.025404Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"cited_work":{"arxiv_id":"2506.15905","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.15905","snapshot_observed_at":"2026-08-06T23:56:11.025404Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","venue":"quant-ph","work_id":"bb529791-9d34-433e-8e03-bbfc55db25ae","year":2025},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.299570Z"},"links":{"cited_paper":"/paper/2506.15905","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:c6fb4963b27e78a9a374cd50fb062667d77e811c920a7b700541635a80c5543b","observation_id":"f044c018-ec32-4d7a-ac80-29357c29387e","resolution":{"observed_at":"2026-08-06T23:56:11.030381Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.15905/citation-record","integrity":"/paper/2506.15905/integrity","json":"/paper/2506.15905/citation-record.json","paper":"/paper/2506.15905"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:11.530091Z","title":"1 applies, giving a net phase gate of P 2wi q","venue":null,"work_id":"b07f78cf-dcd3-414d-acfb-295a61fb3a8a","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.306652Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:6c3299408277fcd29ce9755b7bda632010171e351ba010d4e95ac9f7b1b00375","observation_id":"18989d02-bd6b-4192-8670-a1b3e78aa3d5","resolution":{"observed_at":"2026-08-06T23:56:11.534403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.501667Z","title":null,"venue":null,"work_id":"7cea8e28-d9c9-403c-9018-7f6e1cc1d80a","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.317844Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:1e45e0b530ce7388bf4eb96ee404badd74c90f3b481ee6124438faafc2c69b88","observation_id":"63aec17a-7254-48f8-bc76-5c1b4be75ae9","resolution":{"observed_at":"2026-08-06T23:56:11.505905Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.516156Z","title":null,"venue":null,"work_id":"c58dfb15-f569-45d1-a012-de6213d93cbf","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.312181Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:44b6b42237291273711ff3a53d45bfd1fae1e1a3d42487ce5003030a51df6a99","observation_id":"6f95929a-0609-4bb1-975c-d30f937c1243","resolution":{"observed_at":"2026-08-06T23:56:11.520490Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.472959Z","title":null,"venue":null,"work_id":"fef86d93-0ec0-444d-9999-a2bfa8107dee","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.327840Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:63b4276e4d524bf4d73b17b28f259cee6925befbe0288ad762150e5849034324","observation_id":"17c371c2-0f96-4a68-bf23-ac3f63865224","resolution":{"observed_at":"2026-08-06T23:56:11.477380Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.487107Z","title":null,"venue":null,"work_id":"cdd9833b-c50b-4113-b87b-5f15a4fe5da4","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.323035Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:f4609f1535240818c850c0bfe725300c37a9a6140153f1c239eb4f91ca00724b","observation_id":"ff903ec2-88f3-42bf-b293-9f1951365a5c","resolution":{"observed_at":"2026-08-06T23:56:11.491278Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.442318Z","title":"(We have these by Lemma 2.) At the end of step 3, every logical qubit of the ancilla block is in state |+⟩ except for qubit i, which is in the statePwi q |+⟩","venue":null,"work_id":"c8b171a3-73a6-485a-ae06-02678989a997","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.338868Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:808831e6962ad9c5c32b138f88f9275236e5d38a7326a3f388d96ad83293216b","observation_id":"9347e0cc-b12b-45f4-bbb0-ecb0e2d765c1","resolution":{"observed_at":"2026-08-06T23:56:11.447236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.458578Z","title":"5 = = P P† P 2 Figure 2","venue":null,"work_id":"1ef87cfb-d7d9-45c7-9e70-fcea40451d5b","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.333476Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:09adb019568061d4f939b0f277dedd6dc78e5963829b6f3ec3d5f2ccd64fad4d","observation_id":"38ba3455-e2b2-4677-9110-222b0e85a38c","resolution":{"observed_at":"2026-08-06T23:56:11.463129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.303938Z","title":"Eastin and E","venue":null,"work_id":"dc4edab0-91d3-4109-a0be-6e6fa873b311","year":2009},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.400201Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:cd53d9dff168901b9e26ffed2081b6cb3650b42bc0990bd5cf2971361c63fecd","observation_id":"13220b9b-c8ce-4665-b1b8-76c2cd786604","resolution":{"observed_at":"2026-08-06T23:56:11.308458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.426250Z","title":null,"venue":null,"work_id":"29391042-c205-4d20-a574-7c6c2afaef78","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.343953Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:1ab072c104ab30f7c8096201b89fb78d6dc1d28bad1c4b67dcfcf392dd2a7969","observation_id":"23b8e4fc-d0ec-4a4d-b544-0f4258b9390a","resolution":{"observed_at":"2026-08-06T23:56:11.430749Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.411141Z","title":null,"venue":null,"work_id":"35e8060a-742b-42b5-9169-cc7799216129","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.348148Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:c2d4c91f7eb7f73eeb14e3d85e206f0e6b5cf96f1981452ace10eb371ecd78e5","observation_id":"bfb98f60-5b90-4258-b398-5eeab4bda6f5","resolution":{"observed_at":"2026-08-06T23:56:11.415635Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.392955Z","title":"intra-block gates inter-block gates [[n,k,d ]] code block Figure 3","venue":null,"work_id":"ed34bd49-1d6e-4296-9f72-d5757936964e","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.352534Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:2d1b2b90f067a2705d7946d39cc642d0592550f94b65acc2c699d89a330b7bdb","observation_id":"902fc66d-3031-49d1-9071-02729fb6690e","resolution":{"observed_at":"2026-08-06T23:56:11.400535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.378600Z","title":"local code","venue":null,"work_id":"e062108c-af0e-4d33-a3ee-161158e166ca","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.356979Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:03a831d05fa08841032605abe8ee191754f6d96bda9e382a0e9fa50a8ca04c04","observation_id":"9048ed13-e986-41c6-992a-f31e751bc697","resolution":{"observed_at":"2026-08-06T23:56:11.382740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1206.1609","last_updated":"2012-06-07T20:38:35Z","snapshot_observed_at":"2026-08-04T17:08:29.475497Z","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-06T23:56:10.427113Z","title":"Bravyi and R","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.427113Z"},"links":{"cited_paper":"/paper/1206.1609","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:a354120e7fd7551359db1f4903f987615575053c7ae40d010450f2af46cd652a","observation_id":"eeef8ae4-94ec-4f61-8cc1-56a4f37c51d9","resolution":{"observed_at":"2026-08-06T23:56:10.427113Z","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-06T23:56:10.367424Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.367424Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:3c8826dc5fa811b69a9ea3b94f2ebce3c06fda6fb9f2635b495b624b77429bda","observation_id":"46e1e043-1132-4fdb-95a0-4f99f1e4a612","resolution":{"observed_at":"2026-08-06T23:56:10.367424Z","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-06T23:56:11.339303Z","title":"Aliferis, D","venue":null,"work_id":"1f346957-2b91-4705-bbe2-38ee2c78b327","year":2006},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.371976Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:d216b2d8cde4bbbacfbc75e23151e51c9d8a4cfe1c6800d5556013408cb30dd6","observation_id":"4562a656-74b6-460c-96bf-738c8ba2b7d8","resolution":{"observed_at":"2026-08-06T23:56:11.343621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0610063","last_updated":"2007-03-29T00:48:54Z","snapshot_observed_at":"2026-07-07T07:23:58.737265Z","submitted_at":"2006-10-10T19:40:12Z","title":"Subsystem fault tolerance with the Bacon-Shor code","version":3},"cited_work":{"arxiv_id":"quant-ph/0610063","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0610063","snapshot_observed_at":"2026-08-06T23:56:11.003405Z","title":"Subsystem fault tolerance with the Bacon-Shor code","venue":"quant-ph","work_id":"e851bfb2-020c-49a0-9900-76025201be5c","year":2006},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.376271Z"},"links":{"cited_paper":"/paper/quant-ph/0610063","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:211d446b4016d6cd04f0495378de7c2203df7817cf62ac2f16dadb494abbd8cd","observation_id":"1eac2867-8aa0-460b-a698-a05190367517","resolution":{"observed_at":"2026-08-06T23:56:11.008536Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1106.2190","last_updated":"2013-04-12T19:44:10Z","snapshot_observed_at":"2026-07-06T02:29:08.520478Z","submitted_at":"2011-06-11T00:52:01Z","title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1106.2190","snapshot_observed_at":"2026-08-06T23:56:10.380812Z","title":"Paetznick and B","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.380812Z"},"links":{"cited_paper":"/paper/1106.2190","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:205b28fbcc7dacb8299e05455ea1b1afd51e3a7ea327c58e104444f265e9b256","observation_id":"a6b195d3-1a63-4ba8-9d48-1614512b94f7","resolution":{"observed_at":"2026-08-06T23:56:10.380812Z","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-06T23:56:10.385426Z","title":"Knill, Quantum computing with realistically noisy de- vices, Nature 434, 39 (2005)","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.385426Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:1a893aa840bddea278e1e60d18c9de1afe272b85264986b78a78b80105f5a193","observation_id":"a792c74e-b7f6-4a1a-a5a4-92455ff2b6cf","resolution":{"observed_at":"2026-08-06T23:56:10.385426Z","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-06T23:56:10.390562Z","title":"Dennis, A","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.390562Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:14bc2f8d26d34f0e0cc2c45dd93b5e333b14c6f60197924b6039f8a10a08e2f9","observation_id":"46311140-5b5e-410b-b8f5-768e66528cb6","resolution":{"observed_at":"2026-08-06T23:56:10.390562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.00510","last_updated":"2016-09-19T14:04:18Z","snapshot_observed_at":"2026-07-06T05:09:04.775009Z","submitted_at":"2016-09-02T09:08:10Z","title":"Local Decoders for the 2D and 4D Toric Code","version":2},"cited_work":{"arxiv_id":"1609.00510","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.00510","snapshot_observed_at":"2026-08-06T23:56:10.963259Z","title":"Local Decoders for the 2D and 4D Toric Code","venue":"quant-ph","work_id":"880a1535-684b-45f1-afb8-d6501b252fbb","year":2016},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.395067Z"},"links":{"cited_paper":"/paper/1609.00510","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:dc41907879300f54d4f207300779040335c7a470ccc481bb5a1e910686a553b4","observation_id":"f75193c8-d936-4d64-a0e6-a3453a7f7574","resolution":{"observed_at":"2026-08-06T23:56:10.968018Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"cited_work":{"arxiv_id":"2506.15905","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.15905","snapshot_observed_at":"2026-08-06T23:56:11.025404Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","venue":"quant-ph","work_id":"bb529791-9d34-433e-8e03-bbfc55db25ae","year":2025},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.299570Z"},"links":{"cited_paper":"/paper/2506.15905","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:c6fb4963b27e78a9a374cd50fb062667d77e811c920a7b700541635a80c5543b","observation_id":"f044c018-ec32-4d7a-ac80-29357c29387e","resolution":{"observed_at":"2026-08-06T23:56:11.030381Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0505030","last_updated":"2005-08-23T01:12:00Z","snapshot_observed_at":"2026-07-07T07:19:07.719177Z","submitted_at":"2005-05-06T00:55:45Z","title":"The Solovay-Kitaev algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0505030","snapshot_observed_at":"2026-08-06T23:56:10.405413Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.405413Z"},"links":{"cited_paper":"/paper/quant-ph/0505030","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:aca795ac0a36145f70d894e1a6e4875d4037d9bc3daf8c88af449e24e8bdae95","observation_id":"22b84a9a-9921-4ae8-88c5-456e09b802b2","resolution":{"observed_at":"2026-08-06T23:56:10.405413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1206.5236","last_updated":"2013-02-27T22:18:03Z","snapshot_observed_at":"2026-07-06T02:50:29.201528Z","submitted_at":"2012-06-22T19:46:24Z","title":"Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.5236","snapshot_observed_at":"2026-08-06T23:56:10.410767Z","title":"Kliuchnikov, D","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.410767Z"},"links":{"cited_paper":"/paper/1206.5236","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:343b3ee625a2f917e08fcac6370a9fe20d417a91d4b6126acc434968e40f2fe5","observation_id":"a780bf61-5992-40b0-9d83-7712ae1fa870","resolution":{"observed_at":"2026-08-06T23:56:10.410767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.03888","last_updated":"2015-10-13T20:40:05Z","snapshot_observed_at":"2026-08-01T22:07:45.584879Z","submitted_at":"2015-10-13T20:40:05Z","title":"A Framework for Approximating Qubit Unitaries","version":1},"cited_work":{"arxiv_id":"1510.03888","doi":null,"metadata_source":"pith","pith_arxiv_id":"1510.03888","snapshot_observed_at":"2026-08-06T23:56:10.894047Z","title":"A Framework for Approximating Qubit Unitaries","venue":"quant-ph","work_id":"24640785-be42-4ca8-bb5b-90b2f2f681ff","year":2015},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.417006Z"},"links":{"cited_paper":"/paper/1510.03888","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:8b3944b14e55355ca2b61d54502f2937404531353cb93ed310151ddc492ca16d","observation_id":"cac1431b-5fa1-432d-a24f-570ac04ad3a6","resolution":{"observed_at":"2026-08-06T23:56:10.899505Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.288660Z","title":null,"venue":null,"work_id":"46dfd914-da77-4302-b147-6cadb1a314ac","year":1997},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.422344Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:7b2d9da8e8f021c2a7f536215814565280c0753baeea9bb1a7f0220b33a83f47","observation_id":"4dbb1e5d-6405-4145-ac86-79288c326384","resolution":{"observed_at":"2026-08-06T23:56:11.293170Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.363448Z","title":"For the transpose Tanner codes of Section IV, assume that we have some initial code A0 which is an m×n matrix with row totals s and column totals c, meaning that ms = nc","venue":null,"work_id":"a80f9560-a4c1-40e4-81dd-edd0c8385a05","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.362650Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:bc93e4c177bfc611cdf329537c9dc909b62babb3557de8e6b4e2414229f4eaf8","observation_id":"1a1bb133-3838-46a0-80e7-73a4dad21bda","resolution":{"observed_at":"2026-08-06T23:56:11.368027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0909.5200","last_updated":"2009-09-28T20:17:31Z","snapshot_observed_at":"2026-08-02T00:20:44.117121Z","submitted_at":"2009-09-28T20:17:31Z","title":"Tradeoffs for reliable quantum information storage in 2D systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0909.5200","snapshot_observed_at":"2026-08-06T23:56:10.436695Z","title":"Bravyi, D","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.436695Z"},"links":{"cited_paper":"/paper/0909.5200","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:1f2dfedc715552c85befd0b8378d8af30e034cffa5632a7260674fcb3efd505d","observation_id":"9a87d3ce-822a-4429-969a-30b54a35bcbb","resolution":{"observed_at":"2026-08-06T23:56:10.436695Z","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-06T23:56:10.441917Z","title":"Bluvstein, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.441917Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:a1a20c2691a45fc69e3af4bb40d25526cbff9ff7a4b6eaa9bfbe3536864acf89","observation_id":"e631e742-11a8-496a-b54b-0222243d605d","resolution":{"observed_at":"2026-08-06T23:56:10.441917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0903.0566","last_updated":"2013-01-11T09:25:05Z","snapshot_observed_at":"2026-08-10T10:27:17.622654Z","submitted_at":"2009-03-03T16:41:00Z","title":"Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0903.0566","snapshot_observed_at":"2026-08-06T23:56:10.446760Z","title":"Tillich and G","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.446760Z"},"links":{"cited_paper":"/paper/0903.0566","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:9ec909a672b81acffef1998478f3e129ac989969a7090a518c7e9b05e648ce29","observation_id":"faa88061-f7f7-4870-a8b4-cd5480393db1","resolution":{"observed_at":"2026-08-06T23:56:10.446760Z","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-06T23:56:11.264393Z","title":null,"venue":null,"work_id":"fc640952-562c-4138-ac94-1332ea64ea57","year":2021},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.452940Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:91f85efefc26922f41bd75d929816ebdaa7b7759899b39f90c60084a22c96a77","observation_id":"91c1ffd2-5e96-4289-9089-3b2a7eeedbaa","resolution":{"observed_at":"2026-08-06T23:56:11.268665Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.03654","last_updated":"2022-01-21T17:59:32Z","snapshot_observed_at":"2026-08-05T22:22:26.059983Z","submitted_at":"2021-11-05T17:59:15Z","title":"Asymptotically Good Quantum and Locally Testable Classical LDPC Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.03654","snapshot_observed_at":"2026-08-06T23:56:10.457777Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.457777Z"},"links":{"cited_paper":"/paper/2111.03654","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:53aa3d06bce45213b47884e8fa91e1735d8628fd04fbab7ab00090d664f74e39","observation_id":"e0399cf0-ed60-4132-8112-fd972d45ca1f","resolution":{"observed_at":"2026-08-06T23:56:10.457777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.04068","last_updated":"2021-10-03T18:58:06Z","snapshot_observed_at":"2026-08-08T21:27:32.590144Z","submitted_at":"2020-12-07T21:20:53Z","title":"Quantum LDPC Codes with Almost Linear Minimum Distance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.04068","snapshot_observed_at":"2026-08-06T23:56:10.462888Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.462888Z"},"links":{"cited_paper":"/paper/2012.04068","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:a5280527f2b532d090b9dc1975b97d2107bf6f4f897be2c473e78d9796085a20","observation_id":"7e82fd74-f91a-4838-bbed-ef36f4b3c92a","resolution":{"observed_at":"2026-08-06T23:56:10.462888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-03T01:02:46.717170Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-08-06T23:56:10.467529Z","title":"Dinur, M.-H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.467529Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:2069deedc222d725aca5c1674cedb1f6044bc087b15b1f57f572e2b0e1b3f427","observation_id":"9b76f64b-81b3-4538-baa9-b477e985c311","resolution":{"observed_at":"2026-08-06T23:56:10.467529Z","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-06T23:56:11.249854Z","title":null,"venue":null,"work_id":"c9e2c8ce-1c45-4148-8b63-04b5822022ce","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.472274Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:b5250813ec4e04f66bdae613507cac7e55f7f31196c7d0b74f844fcce75ebbd3","observation_id":"0f5214d9-2712-450c-91c4-a36b0f46ac13","resolution":{"observed_at":"2026-08-06T23:56:11.254095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:10.476707Z","title":"Bravyi, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.476707Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:1be2280ad82b68d8d4d66cbe678b7af0a22c7151976c9bcc98079de85d40e43c","observation_id":"e35ee879-2755-4bee-a8fa-0d6211cec91d","resolution":{"observed_at":"2026-08-06T23:56:10.476707Z","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-10T07:11:14.081580Z","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-06T23:56:10.480968Z","title":"Gottesman, Fault-Tolerant Quantum Computation with Constant Overhead (2014), arXiv:1310.2984 [quant- ph]","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.480968Z"},"links":{"cited_paper":"/paper/1310.2984","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:75d2a4b1e461671a35a5376da90023918a0b35a2ff4fa82bac1756274c44099e","observation_id":"d4784fb2-1678-4ff3-bb07-33aaeb2df92e","resolution":{"observed_at":"2026-08-06T23:56:10.480968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1208.2317","last_updated":"2012-09-01T20:37:21Z","snapshot_observed_at":"2026-07-06T02:53:34.799380Z","submitted_at":"2012-08-11T07:24:25Z","title":"Fault-Tolerance of \"Bad\" Quantum Low-Density Parity Check Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1208.2317","snapshot_observed_at":"2026-08-06T23:56:10.486052Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.486052Z"},"links":{"cited_paper":"/paper/1208.2317","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:cb4ced9cf39e95ea7983bfc6e1b943b2d6cbfa55a4e6587a274c0a016b09b8bd","observation_id":"895d43ec-b9e3-4e78-8eb4-6ab672914965","resolution":{"observed_at":"2026-08-06T23:56:10.486052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.03821","last_updated":"2018-08-11T15:49:14Z","snapshot_observed_at":"2026-07-06T06:55:11.163406Z","submitted_at":"2018-08-11T15:49:14Z","title":"Constant overhead quantum fault-tolerance with quantum expander codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.03821","snapshot_observed_at":"2026-08-06T23:56:10.490845Z","title":"Fawzi, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.490845Z"},"links":{"cited_paper":"/paper/1808.03821","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:15d9cb1925d8ffe46504846d1d8c285969ccd941747942d749cad3660c4df6a4","observation_id":"98461286-8427-44c8-921c-f29827127e67","resolution":{"observed_at":"2026-08-06T23:56:10.490845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.05842","last_updated":"2020-12-10T17:34:42Z","snapshot_observed_at":"2026-08-08T19:18:01.761139Z","submitted_at":"2020-12-10T17:34:42Z","title":"Limitations on transversal gates for hypergraph product codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.05842","snapshot_observed_at":"2026-08-06T23:56:10.495656Z","title":"Burton and D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.495656Z"},"links":{"cited_paper":"/paper/2012.05842","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:79d776bbf592b385399ae1d952a0c69e1c98e6d87203130b182a3cbe0e254180","observation_id":"4276cc29-a609-4f0d-a474-c7dad3bd466c","resolution":{"observed_at":"2026-08-06T23:56:10.495656Z","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-06T23:56:11.226065Z","title":null,"venue":null,"work_id":"367d3877-9d6c-41f2-91b2-c0ac7ac45aca","year":2023},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.500142Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:589b586f2725bbfa673fb2c15d481ea3c28530d39ccd26ed227db5177dc105d3","observation_id":"2e2d6f7d-d077-4295-a697-066a0affcb20","resolution":{"observed_at":"2026-08-06T23:56:11.230398Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.210854Z","title":"Krishna and D","venue":null,"work_id":"1837c167-48ad-4500-a540-c213445608e0","year":2021},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.504410Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:e0d416515066816b339c437aae14cc7e84a8f40dbd334d419ac38363c4c46465","observation_id":"8f4580af-083b-4e93-9e68-1f557c9b0f11","resolution":{"observed_at":"2026-08-06T23:56:11.215149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14074","last_updated":"2025-02-07T17:57:58Z","snapshot_observed_at":"2026-07-06T14:10:12.547986Z","submitted_at":"2022-10-25T14:56:31Z","title":"Implementing Clifford Gates on Stabilizer Codes via Measurement","version":3},"cited_work":{"arxiv_id":"2210.14074","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.14074","snapshot_observed_at":"2026-08-06T23:56:10.698315Z","title":"Implementing Clifford Gates on Stabilizer Codes via Measurement","venue":"quant-ph","work_id":"d71a62b6-dd4c-4992-a21b-7bb2d5de6dff","year":2022},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.508357Z"},"links":{"cited_paper":"/paper/2210.14074","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:cdd8c248a78c902b6fad996f7d92d6beef0dc8e4272ce956f70cc017c0ca99ae","observation_id":"6d9f1404-f3a3-4df1-b6c3-2ba38a7c1359","resolution":{"observed_at":"2026-08-06T23:56:10.703974Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13679","last_updated":"2025-06-11T09:34:58Z","snapshot_observed_at":"2026-08-10T02:36:05.811495Z","submitted_at":"2025-05-19T19:26:53Z","title":"Demystifying the Balanced Product Code: A Review","version":2},"cited_work":{"arxiv_id":"2505.13679","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.13679","snapshot_observed_at":"2026-08-06T23:56:10.675849Z","title":"Demystifying the Balanced Product Code: A Review","venue":"quant-ph","work_id":"76514292-5790-425c-8eb2-fd76b8ab85ff","year":2025},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.512498Z"},"links":{"cited_paper":"/paper/2505.13679","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:4de3e9b103a6408fc48c50435316374352e242ee68b522c53f285e96a0ced98c","observation_id":"b5528966-ec07-4d7b-b8da-7df87c09f91c","resolution":{"observed_at":"2026-08-06T23:56:10.680631Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15615","last_updated":"2023-04-26T10:22:37Z","snapshot_observed_at":"2026-07-06T15:08:41.430154Z","submitted_at":"2023-03-27T21:49:37Z","title":"Transversal Diagonal Logical Operators for Stabiliser Codes","version":2},"cited_work":{"arxiv_id":"2303.15615","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.15615","snapshot_observed_at":"2026-08-06T23:56:10.653416Z","title":"Transversal Diagonal Logical Operators for Stabiliser Codes","venue":"quant-ph","work_id":"8b7ee964-d7d4-467a-bf0c-842791fb4a8b","year":2023},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.517807Z"},"links":{"cited_paper":"/paper/2303.15615","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:da3c1f767dc667b456e3c8774124b56b394a3b00fcd91c4266d8802cab35bf39","observation_id":"ae3d880f-f4e3-41f2-88bf-38fa2961a44c","resolution":{"observed_at":"2026-08-06T23:56:10.659442Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14066","last_updated":"2022-10-25T14:47:29Z","snapshot_observed_at":"2026-08-06T02:06:50.985145Z","submitted_at":"2022-10-25T14:47:29Z","title":"The Smallest Code with Transversal T","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.14066","snapshot_observed_at":"2026-08-06T23:56:10.522226Z","title":"Koutsioumpas, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.522226Z"},"links":{"cited_paper":"/paper/2210.14066","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:b20afebf95ad5e23e63f6372fd6639287be4bfb8c9278f79b158c018f0bfe30f","observation_id":"dc24fe83-a8a7-4dc4-acfb-2e09a36c46cd","resolution":{"observed_at":"2026-08-06T23:56:10.522226Z","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-06T23:56:10.526313Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.526313Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:5a51230ebc36cb64094561b2f52bd0413aacea3d2b07681d42ca0ffb471586d7","observation_id":"5c3bef83-232e-41cc-b704-b9c8dbaabf5a","resolution":{"observed_at":"2026-08-06T23:56:10.526313Z","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-06T23:56:11.185698Z","title":"Raussendorf and H","venue":null,"work_id":"9fb9e4ac-1b3b-4ca0-9b6c-f43f4bbd0951","year":2001},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.531045Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:ac81c2662e517c905525f2312281d8c54011e882157f29cd0b97bb10dd7c13d5","observation_id":"c8b001a0-3159-45f2-a274-dadee3494b87","resolution":{"observed_at":"2026-08-06T23:56:11.190120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.170947Z","title":null,"venue":null,"work_id":"eaa22099-4ada-41be-b91e-2e8bafb3e98a","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.535264Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:82fa3c2cd62514840bfd55d25b2178c829d89e16384d7a4e0dca3ddbd187864b","observation_id":"8660c5b4-a94c-4fb7-94d6-8eea03a7d595","resolution":{"observed_at":"2026-08-06T23:56:11.175786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:10.539650Z","title":"Tanner, A recursive approach to low complexity codes, IEEE Transactions on Information Theory27, 533 (1981)","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.539650Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:009fd4d80b920ed21677cc9e5f37e7141e549123ef15b5fc9895ca3a28172602","observation_id":"b64fbc10-ff17-46a5-91de-fb042fd89029","resolution":{"observed_at":"2026-08-06T23:56:10.539650Z","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-06T23:56:11.146007Z","title":"They could turn out just to be stabilizers and of no concern, but we will see this is not they case","venue":null,"work_id":"ef15f9f8-80bc-4c97-a345-b644dda2d813","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.543865Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:59193d400c85541ae34fc3e934ec62babcb54f9e893f3e882ffef00d0ccb6352","observation_id":"3fcd8106-34d5-4f76-b54a-10b16d6a9049","resolution":{"observed_at":"2026-08-06T23:56:11.150778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.130486Z","title":null,"venue":null,"work_id":"034569be-88cf-4c45-9138-d9eedfbcc0a0","year":1922},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.547925Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:8148513eb88660434da7101aa472464cf413fc1bef90562f8d04f324b34b1aa2","observation_id":"c8fd5acf-0f22-4467-bdb8-d507d650ffeb","resolution":{"observed_at":"2026-08-06T23:56:11.135431Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.17637/rh.29313224","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Kay and H","venue":"Royal Holloway, University of London","work_id":"d63f8987-a06c-4928-920b-fc5ff3695a30","year":2025},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.552554Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:30f325bb6e120ab179508b0e30cf5f728fabc92f493a9d369f325056d19d5c6e","observation_id":"ce936209-373a-479a-b862-35c6169e8350","resolution":{"observed_at":"2026-08-06T23:56:10.617426Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.115794Z","title":"This can be quite restrictive","venue":null,"work_id":"c2bd7f8d-8dfb-4d80-978b-59793b2a19c6","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.556669Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:f007ed24965f010289f6688e1d9433b15dcb7d71f97221be0424b7e1afe7f7cf","observation_id":"4ca96f73-94c6-4de9-a985-fc533c51d898","resolution":{"observed_at":"2026-08-06T23:56:11.120194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.100286Z","title":"Lubotzky, R","venue":null,"work_id":"d695ca3b-c62c-4d02-9425-b9b30fb6038e","year":1988},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.560562Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:b9f006dba8f55ed48a17b2344efd2afd0a739f3ece25d383362837e07f000ac3","observation_id":"8b3006cb-e573-4644-abce-17c7beb48167","resolution":{"observed_at":"2026-08-06T23:56:11.105028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.084976Z","title":null,"venue":null,"work_id":"385d4f16-4648-4893-8801-44e21a188366","year":2022},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.564702Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:c171a3c4166f042f78cf045ee661825bc07d391b923147115a81e178b5f092a8","observation_id":"658e44c6-63ef-476d-a6fa-7f6f3d7450af","resolution":{"observed_at":"2026-08-06T23:56:11.089260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.070575Z","title":null,"venue":null,"work_id":"7ba971a2-1e56-4e47-8546-34645ae75b26","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.568847Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:ada72567d5ec71d210ffa3a77820dab7c0f5c2f48101210cb3312ab5fab70993","observation_id":"26f8e208-500b-47b9-8c79-b4631bda2981","resolution":{"observed_at":"2026-08-06T23:56:11.075094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.056147Z","title":null,"venue":null,"work_id":"b33500a6-a992-43d7-a7f1-c6c8edbddeb7","year":null},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.572769Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:bdc049adf45b888c7c0c76a81365e33c06bb0084e9c53063cd02abc2f26c4a08","observation_id":"66a8cf5c-61be-414b-bcc8-6896aef608f9","resolution":{"observed_at":"2026-08-06T23:56:11.060502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T23:56:11.040994Z","title":"Yamasaki and M","venue":null,"work_id":"1e7417a5-2a85-4797-bc68-eaec743ee806","year":2024},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.577267Z"},"links":{"citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:68d47194a407647822e8b98ced509dcb48c6c517cf6c89a8b51aee22ab97c81d","observation_id":"2de5371f-54a4-4ed7-9736-3619546d5c7f","resolution":{"observed_at":"2026-08-06T23:56:11.045377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":36,"verified_exact":7,"verified_fuzzy":14},"total_outbound_references":58},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 1 inbound Pith citation observation for arXiv:2506.15905."}