{"as_of":"2026-08-06T04:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd411121324b86a79585313c340588256d42b607e0393a76fb9e35adff255a34","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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-05T06:32:48.257954+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:53:43.495936Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":3,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2410.10194","last_updated":"2026-04-17T13:13:04Z","snapshot_observed_at":"2026-07-06T19:32:51.287674Z","submitted_at":"2024-10-14T06:27:09Z","title":"Wire Codes","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-23T19:09:00.776743Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2410.10194"},"observation_digest":"sha256:243f1e4d6b0df4e93efe34b3482db6672596edfb3e1e02475aeaad7df01571f6","observation_id":"deb2a887-3e5b-47ac-9814-36172ab5241b","resolution":{"observed_at":"2026-05-23T19:15:47.682261Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2503.05003","last_updated":"2026-01-22T18:18:17Z","snapshot_observed_at":"2026-07-06T20:48:13.849680Z","submitted_at":"2025-03-06T22:05:52Z","title":"Parallel Logical Measurements via Quantum Code Surgery","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-23T00:29:29.522530Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2503.05003"},"observation_digest":"sha256:f1461166d484cbbde11f0f7364e3e6018cb07eb14f81626186dccd7b542cb957","observation_id":"7d1b8baa-f95c-4000-9864-682e85b58207","resolution":{"observed_at":"2026-05-23T00:32:18.109477Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2503.05003","last_updated":"2026-01-22T18:18:17Z","snapshot_observed_at":"2026-07-06T20:48:13.849680Z","submitted_at":"2025-03-06T22:05:52Z","title":"Parallel Logical Measurements via Quantum Code Surgery","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-23T00:29:29.522530Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2503.05003"},"observation_digest":"sha256:1765ae814045e81f2965b2821e002ef91fc4a4f56a1e877294bede9b8383f1b3","observation_id":"0b581236-536a-4aff-8268-a3ce6a27dcd9","resolution":{"observed_at":"2026-05-23T00:32:18.340793Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2508.10714","last_updated":"2025-11-06T19:03:24Z","snapshot_observed_at":"2026-07-06T22:13:00.029560Z","submitted_at":"2025-08-14T14:56:50Z","title":"Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-05-18T22:51:30.133403Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2508.10714"},"observation_digest":"sha256:feca7689224810c985e0a8ae499e64b7fd601ede112eac02fa798a3df8ce5239","observation_id":"d0070981-bac4-4dcc-8b74-eac126d26f4f","resolution":{"observed_at":"2026-05-18T22:51:53.008837Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2510.19442","last_updated":"2026-04-11T13:17:53Z","snapshot_observed_at":"2026-08-02T23:20:24.028067Z","submitted_at":"2025-10-22T10:15:40Z","title":"Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-18T05:16:35.002960Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2510.19442"},"observation_digest":"sha256:1812d8844d84381e84b31643bf703ca8a243508c9d783d97bba6a7d3cda7176b","observation_id":"ccca1bf0-f2e7-4e7b-82a5-78f805a91231","resolution":{"observed_at":"2026-05-18T05:20:54.505598Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2511.02900","last_updated":"2026-05-19T22:25:24Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-11-04T19:00:00Z","title":"Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T19:14:49.965519Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2511.02900"},"observation_digest":"sha256:68d66ee48084c9f3f6816d5d6013bc9935c67b51de4ab36e194b0b4a917ac26b","observation_id":"d3abfe20-6482-4040-a6bf-a8ce24d481fc","resolution":{"observed_at":"2026-05-21T19:15:31.078236Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2511.04430","last_updated":"2026-05-06T23:02:15Z","snapshot_observed_at":"2026-07-06T22:35:02.737645Z","submitted_at":"2025-11-06T15:05:17Z","title":"Symmetry-enriched topological order and quasifractonic behavior in $\\mathbb{Z}_N$ stabilizer codes","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-18T01:01:08.043585Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2511.04430"},"observation_digest":"sha256:68395f755bbb0410284d2f5f13e44245a27ce388616ec19c540f55e809b00d18","observation_id":"e8ea5a74-99ee-4640-a6d6-86b9014ae26b","resolution":{"observed_at":"2026-05-18T01:02:15.444471Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-03T21:53:43.495936Z","title":"Low-overhead fault-tolerant quantum computation by gaug- ing logical operators","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.13560","last_updated":"2026-06-19T13:50:26Z","snapshot_observed_at":"2026-08-03T21:53:39.997731Z","submitted_at":"2025-11-17T16:26:15Z","title":"Sequences of Bivariate Bicycle Codes from Covering Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T21:53:43.495936Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2511.13560"},"observation_digest":"sha256:da3a7406b60b0e86e5fd211a8641baf864e1c52148f699b693298923b4998a2a","observation_id":"5bde35ef-0bde-47de-be74-01f5ab404578","resolution":{"observed_at":"2026-08-03T21:53:43.495936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-03T08:00:03.699144Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.18879","last_updated":"2026-05-24T01:40:16Z","snapshot_observed_at":"2026-08-03T11:12:49.778747Z","submitted_at":"2026-01-26T19:00:03Z","title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T08:00:03.699144Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2601.18879"},"observation_digest":"sha256:3faf8b1b5bc1f09a823ceb82fd1fdce232a16b38c1cb1b4e57370c2dc0d735c8","observation_id":"5944f1ea-539c-41dd-a659-2f13eb09524b","resolution":{"observed_at":"2026-08-03T08:00:03.699144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2602.11457","last_updated":"2026-05-05T14:58:57Z","snapshot_observed_at":"2026-07-06T22:45:34.674215Z","submitted_at":"2026-02-12T00:30:48Z","title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-16T05:27:23.269152Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2602.11457"},"observation_digest":"sha256:c1491b7e3015b1a2b1e2c3df43edbd79194e4f85d6e0aeec5cea4bf305b3f8fa","observation_id":"7d461709-1e37-4b6d-929b-559c926f4349","resolution":{"observed_at":"2026-05-09T03:06:06.502233Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-02T21:28:01.173011Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.20546","last_updated":"2026-06-02T15:13:30Z","snapshot_observed_at":"2026-08-02T21:27:53.468174Z","submitted_at":"2026-02-24T04:57:42Z","title":"Distilling Magic States in the Bicycle Architecture","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:01.173011Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2602.20546"},"observation_digest":"sha256:23e4f8ed3fab064d7c98d76e05e49003b06bc092c1622161174fb3558b264384","observation_id":"4d0b5acf-1dc5-4d91-a6e9-188007045564","resolution":{"observed_at":"2026-08-02T21:28:01.173011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-02T20:44:36.342151Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22770","last_updated":"2026-06-08T17:16:15Z","snapshot_observed_at":"2026-08-02T20:44:31.689074Z","submitted_at":"2026-02-26T09:00:20Z","title":"A matching decoder for bivariate bicycle codes","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-02T20:44:36.342151Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2602.22770"},"observation_digest":"sha256:0198b028c2a92f79f0a1ed650ccf44e27840607c1662568da8638c3d71f196fc","observation_id":"fa9f2412-0916-478a-aea2-a65e2e125e00","resolution":{"observed_at":"2026-08-02T20:44:36.342151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2603.05429","last_updated":"2026-03-05T17:51:50Z","snapshot_observed_at":"2026-07-06T22:47:59.530407Z","submitted_at":"2026-03-05T17:51:50Z","title":"Constant depth magic state cultivation with Clifford measurements by gauging","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-15T16:06:44.792360Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2603.05429"},"observation_digest":"sha256:b1b131e15abffabd2453f2cee2ff5fbd80a9b8125c8eaf950e076ecb38c19629","observation_id":"9ecd6b40-bb51-4d96-af55-3540fbedecf9","resolution":{"observed_at":"2026-05-15T16:10:09.370310Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2604.16209","last_updated":"2026-06-26T21:06:12Z","snapshot_observed_at":"2026-08-02T13:05:05.240699Z","submitted_at":"2026-04-17T16:19:55Z","title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-10T09:09:21.862128Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2604.16209"},"observation_digest":"sha256:65b1bf09465085e3d51e041a76ac157d02d4fd2d4119eb3216c3336804039835","observation_id":"fd66381a-ee8b-49e5-a022-e5129d46e8e9","resolution":{"observed_at":"2026-05-10T09:13:30.128513Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2605.21746","last_updated":"2026-05-20T21:17:42Z","snapshot_observed_at":"2026-07-06T23:32:10.472558Z","submitted_at":"2026-05-20T21:17:42Z","title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2605.21746"},"observation_digest":"sha256:cb21d9a820e3baadd08c37f4145a1292c3d16ce1298af19c895b04ce6d4438bf","observation_id":"b2df47ae-bd2b-4d42-95cd-67ed935e6a42","resolution":{"observed_at":"2026-05-22T08:41:16.839263Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2605.23738","last_updated":"2026-05-22T15:13:36Z","snapshot_observed_at":"2026-07-06T23:33:53.870540Z","submitted_at":"2026-05-22T15:13:36Z","title":"Optimizing Parallel Execution of Commuting Pauli Product Rotations","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T04:06:07.966799Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2605.23738"},"observation_digest":"sha256:be938ebac117ae19da420d74337e4dc7f62f09c829b3135fcf8736ff485385b4","observation_id":"72d819dc-9f32-4e9d-9c61-a6827d857b6a","resolution":{"observed_at":"2026-05-25T04:06:36.818152Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":"2410.02213","doi":"10.1038/s41567-026-03220-8","metadata_source":"pith","pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","venue":"quant-ph","work_id":"e4c82816-8078-4ad0-bdce-c49e1eb75923","year":2024},"citing_paper":{"arxiv_id":"2606.05664","last_updated":"2026-06-04T03:47:21Z","snapshot_observed_at":"2026-08-03T14:40:03.253413Z","submitted_at":"2026-06-04T03:47:21Z","title":"Gauging the Spacetime Code","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-28T01:33:57.976337Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2606.05664"},"observation_digest":"sha256:1ec02d59195b086cc8810a0593b06baae963bfab4219d6c5c416e424665e1537","observation_id":"f6cd5ace-5bac-42a9-af45-fc335f46256b","resolution":{"observed_at":"2026-07-02T13:06:59.383270Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.254334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02213","snapshot_observed_at":"2026-07-31T02:25:48.725439Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28605","last_updated":"2026-07-30T17:55:34Z","snapshot_observed_at":"2026-08-05T02:53:40.264343Z","submitted_at":"2026-07-30T17:55:34Z","title":"Logical computation with canonical lifted product codes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T02:25:48.725439Z"},"links":{"cited_paper":"/paper/2410.02213","citing_paper":"/paper/2607.28605"},"observation_digest":"sha256:2149d5608ac4ebbdce8a80ac61312055fe9f017b7990092c523f3ccce1b4489a","observation_id":"f5d89b9d-eb29-461c-8db2-7e1800173942","resolution":{"observed_at":"2026-07-31T02:25:48.725439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.02213/citation-record","integrity":"/paper/2410.02213/integrity","json":"/paper/2410.02213/citation-record.json","paper":"/paper/2410.02213"},"outbound":[],"paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2410.02213."}