{"as_of":"2026-08-19T03:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:210ef220b6aa496c341f9b3bbf0445e3c41bdac0e73d39b473872dbdbc766a04","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T10:06:04.795745Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-16T00:35:18.079997Z","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-16T00:35:19.176307Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"cited_work":{"arxiv_id":"2606.22594","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.22594","snapshot_observed_at":"2026-08-16T00:35:19.176307Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","venue":"quant-ph","work_id":"78a9557f-2729-440b-bea1-881197778737","year":2026},"citing_paper":{"arxiv_id":"2608.11719","last_updated":"2026-08-12T06:58:59Z","snapshot_observed_at":"2026-08-19T00:28:21.242972Z","submitted_at":"2026-08-12T06:58:59Z","title":"Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:35:18.079997Z"},"links":{"cited_paper":"/paper/2606.22594","citing_paper":"/paper/2608.11719"},"observation_digest":"sha256:8fa669ec1e3ed7e122c68c3b05d28d9ff739eaf7dc5930ca366fbdd9ca126c27","observation_id":"cdad69e9-1b8b-4c7d-9e59-c2c419c9f840","resolution":{"observed_at":"2026-08-16T00:35:19.182185Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2606.22594/citation-record","integrity":"/paper/2606.22594/integrity","json":"/paper/2606.22594/citation-record.json","paper":"/paper/2606.22594"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T10:06:04.795745Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:be6d416d6ed18f6ba4dc6405b1a8daa6e278b62e42c01aab408eac0aad18f177","observation_id":"c4ac02ff-331d-423e-a077-4c20cd88201a","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"Similarly, for each primitive errore Z ∈f Z, PZ ◦S f(eZ) =e Z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:0729a524a89a60fdfa699e1032882a3dc2684cf7e8706776ecfe57f8f8030627","observation_id":"69ca175d-5103-4c4e-bb64-4859e1d5cfc8","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"For everygX ⊂ fX,κ,S f(gX)⊂f κ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:cd634ad738d12a4146d27e3ce01554a731c559eac4fc33b1a9cd2b4f3406697e","observation_id":"ece390a0-3871-4d95-9e91-84bc6c5b53af","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"For everyg Z ⊂ fZ,κ,S f(gZ)⊂f κ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:b596c1780f35fe9398ea442b57ab23a5266f6b4751c7380d892471ad6cbfea7b","observation_id":"423cb46d-1c68-4581-872a-70498d8ce870","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:a89386978561094172c85897a603082d5cdf9b13459d2887fccc27bf9a47a65b","observation_id":"76107a6c-bc8d-498e-af1e-4f9c1546937e","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"Every error configuration inF g has a weight at leastd0|g|/2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:045fa89a64116737f2ca478a6c3575caa35f7f6ad278fdc684111207c191ef05","observation_id":"33d22408-0fe2-4d8f-b428-43c00d8b078a","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"Then, we can simply upper bound the size of any receptive zone byzmax","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:71cfc8ee6a37084793da827bf18b935222cd493afd05d7de2a62597b6beb9abb","observation_id":"b80f9926-e385-4996-b573-157fe8df9ffe","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:0a69a4013e08384ef7b594254788223bab9a16bd09cffe0753976ded8026e3da","observation_id":"7b866464-2010-4673-a929-e6bb1e530a49","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"Every level-1 layer has at mostd1 control qubits","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:be86073f87b2be706cfa8d892d3e1e899e69f47f81b125aa2b3205e02927ff9d","observation_id":"762f98bd-c4eb-407c-a36e-c67fc3ba0700","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:f3c2b803731082caaa213b72ea02e3a520620b261b3355382353daf8d7959f3e","observation_id":"9cc90c5f-c0a7-4707-a36a-1deb3986da57","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"Every level-1 layer has at mostd 1 target qubits","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:3ed88d8d7c57d08ef0cd12be21fb4fb2cba70e63a419c5180732eb7abbdde7c3","observation_id":"87c856de-79ee-4d36-9139-c450093bfc8d","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"We now describe the level-0 implementation of anH- transformed readout gadget","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:da2fcfecc048383e93d11bc5d652bf95df915220bc85b42d10378ad465aafa9d","observation_id":"e654c276-ac2a-4df6-8aa2-cbe93b3ed4c4","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:55c7f6e550ddda605d91e96f255038f3bdfc2a1f63fe9a7717f8511bb5d8ade7","observation_id":"234da7b5-efd7-4ef6-b335-5ef9507c3ca8","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"The level-0 implementation of anHS-transformed read- out gadget mostly follows from that of anH-transformed readout gadget","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:5fef2ce844b03b7bcac666762d403d0f0af0b75dae063c8f831880f72b5d4480","observation_id":"9dc5b2cf-7108-456b-bc49-47cda11f2e92","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"whereaandbare non-negative fitting parameters","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:3a5905ca25e304e82c63ae0f18e8763420f04137cc24bd94ba4ede19a4cf1cd3","observation_id":"61442910-8c78-498b-bf14-c27b7d9d6cf6","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"The HLP is run as a memory for ten level-1 SE rounds","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:485613fef6be1e3798c8ddc56f4a1131fcfacb763b42b95b060232eed41cb4ec","observation_id":"204f8486-29d6-4d4d-9fc2-ef3fa5efdd4c","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","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-06-26T10:06:04.795745Z","title":"We simulate only five level-1 SE rounds on the HLP, since circuit-level simulation is costly at this scale","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T10:06:04.795745Z"},"links":{"citing_paper":"/paper/2606.22594"},"observation_digest":"sha256:55718279d3437698a752df1cf9aa04f20969d55b1a22a2e1c2eee7211bc58510","observation_id":"0dce1932-5eed-425c-936d-ee8f73c7d606","resolution":{"observed_at":"2026-06-26T10:06:04.795745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.22594","last_updated":"2026-06-21T17:03:15Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T05:19:08.418313Z","submitted_at":"2026-06-21T17:03:15Z","title":"Hierarchical Logical Processor on the Rotated Surface Code with Shuttle Buses"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 1 inbound Pith citation observation for arXiv:2606.22594."}