{"as_of":"2026-08-15T11:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d087a8aefe7a9d4972998b67b0e787edc9468108a87eb8434e11e5c041dca14e","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-15T06:32:42.880941+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-06T22:08:47.325649Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-05T01:30:37.189076Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-08-06T22:08:47.325649Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.22600","last_updated":"2025-06-27T19:51:44Z","snapshot_observed_at":"2026-08-09T15:47:06.975131Z","submitted_at":"2025-06-27T19:51:44Z","title":"Demonstration of measurement-free universal fault-tolerant quantum computation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:08:47.325649Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2506.22600"},"observation_digest":"sha256:bde6aa316973189ba33557c85217842b32feaa33c0866a54c81ff2861dc6ffd3","observation_id":"96484cd8-d499-4a0f-b4b5-8101a37eaf5b","resolution":{"observed_at":"2026-08-06T22:08:47.325649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-08-06T16:56:36.414440Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.12589","last_updated":"2025-07-16T19:16:49Z","snapshot_observed_at":"2026-08-13T19:28:55.734750Z","submitted_at":"2025-07-16T19:16:49Z","title":"Efficient Qudit Circuit for Quench Dynamics of $2+1$D Quantum Link Electrodynamics","version":1},"reference_index":114,"source":"pdf_text","source_observed_at":"2026-08-06T16:56:36.414440Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2507.12589"},"observation_digest":"sha256:e49ed004911edc00e8667033eff32d985eacabb1460a0cf6d7de8661dbb01c15","observation_id":"9ac07ba1-056d-446c-8e5f-0e76e60323a5","resolution":{"observed_at":"2026-08-06T16:56:36.414440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-08-05T16:10:09.351379Z","title":"Breakingevenwithmagic: demon- stration of a high-fidelity logical non-clifford gate.arXiv preprint arXiv:2506.14688, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19088","last_updated":"2026-08-08T15:31:15Z","snapshot_observed_at":"2026-08-13T23:10:37.595658Z","submitted_at":"2025-08-26T14:50:52Z","title":"Efficient and scalable inter-module switching for distributed quantum computing architectures","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T16:10:09.351379Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2508.19088"},"observation_digest":"sha256:807c7b686fd0582e799834109eadcca39332caecd5f232c48a72e0c63d17f17d","observation_id":"5933c797-132d-4a36-b114-d38e94621ca0","resolution":{"observed_at":"2026-08-05T16:10:09.351379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-08-04T23:45:17.749194Z","title":"Entangling Four Logical Qubits beyond Break-Even in a Nonlocal Code","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.06455","last_updated":"2025-09-08T09:00:09Z","snapshot_observed_at":"2026-08-10T04:16:54.299567Z","submitted_at":"2025-09-08T09:00:09Z","title":"Theoretical and experimental analysis of adaptive quantum computers","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T23:45:17.749194Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2509.06455"},"observation_digest":"sha256:1ea59f11e00f0e8ec26c01ded01ed025ed43a81255f92ad7f156a0045338b550","observation_id":"88e8c62f-c923-49b8-a124-2c0531815854","resolution":{"observed_at":"2026-08-04T23:45:17.749194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2509.25326","last_updated":"2025-09-29T18:00:03Z","snapshot_observed_at":"2026-08-11T00:19:23.767993Z","submitted_at":"2025-09-29T18:00:03Z","title":"Error detection without post-selection in adaptive quantum circuits","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-18T12:43:43.716616Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2509.25326"},"observation_digest":"sha256:9ea4a4aef29a182cde43f0e751894b67c23bf149729bba675feed30beab97a3a","observation_id":"2bbda463-a036-4afe-a8e7-5daa06c70a7d","resolution":{"observed_at":"2026-05-18T12:46:24.326798Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2511.05465","last_updated":"2025-11-07T18:09:25Z","snapshot_observed_at":"2026-07-06T22:35:13.699594Z","submitted_at":"2025-11-07T18:09:25Z","title":"Helios: A 98-qubit trapped-ion quantum computer","version":1},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-05-15T15:58:16.244075Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2511.05465"},"observation_digest":"sha256:c6c1d19d3703ee532326c24b17a21a2a35736ed3b431000dfa94cb1c77ee3664","observation_id":"d13e8a10-3712-45b0-bfac-f59a76b99a26","resolution":{"observed_at":"2026-05-15T15:58:16.370219Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-08-03T23:13:33.948450Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.07300","last_updated":"2026-06-11T11:21:43Z","snapshot_observed_at":"2026-08-13T15:26:14.407055Z","submitted_at":"2025-11-10T17:01:51Z","title":"Efficient certification of intractable quantum states with few Pauli measurements","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T23:13:33.948450Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2511.07300"},"observation_digest":"sha256:9ffc3f64918afeb168423ed4f008fb0a79d78cf678642e891aa31ba465a97e6b","observation_id":"4c4bc1ea-52f7-4f97-bdf4-edb3869b77d8","resolution":{"observed_at":"2026-08-03T23:13:33.948450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-08-03T13:41:13.077994Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.23799","last_updated":"2026-05-25T05:55:56Z","snapshot_observed_at":"2026-08-14T13:21:57.463438Z","submitted_at":"2025-12-29T19:00:05Z","title":"Efficient simulation of logical magic state preparation protocols","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T13:41:13.077994Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2512.23799"},"observation_digest":"sha256:cc558f9c0f92d7035bbe0feff882d6dcd4eb88a52a04da2b0a5d6e4a03b6c040","observation_id":"43edbbbe-dc7c-4fb1-a1ad-0e0f13d4a253","resolution":{"observed_at":"2026-08-03T13:41:13.077994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2604.05126","last_updated":"2026-04-06T19:40:46Z","snapshot_observed_at":"2026-08-11T08:24:44.712899Z","submitted_at":"2026-04-06T19:40:46Z","title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T18:57:36.013957Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2604.05126"},"observation_digest":"sha256:c0b19aa339cb72a6a0b63578618360b0b3946c19d11c92bae9a600c30585ab82","observation_id":"da9aa24d-25d1-4be4-9986-d8a7fe6c0bba","resolution":{"observed_at":"2026-05-10T23:40:51.015664Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2604.21468","last_updated":"2026-07-01T05:02:10Z","snapshot_observed_at":"2026-08-12T23:07:41.914974Z","submitted_at":"2026-04-23T09:28:19Z","title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-05T01:27:19.545404Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2604.21468"},"observation_digest":"sha256:85bd0005b579f6a4b2c3b29553a034cb7db1c3868d772dc0f6c25daba5bd29eb","observation_id":"5f19e798-e104-4add-82e3-883f5a5e4205","resolution":{"observed_at":"2026-07-05T01:30:37.191310Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2604.21472","last_updated":"2026-06-03T02:27:08Z","snapshot_observed_at":"2026-08-11T11:06:46.436887Z","submitted_at":"2026-04-23T09:30:00Z","title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-09T22:30:01.774437Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2604.21472"},"observation_digest":"sha256:cd29c3ac67be881403e01806a366c32a4a133afd8227296beb77eafc6ffd2dac","observation_id":"383abede-c199-4024-899e-365efb31f37e","resolution":{"observed_at":"2026-05-09T22:34:07.075051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2604.27058","last_updated":"2026-05-20T13:52:10Z","snapshot_observed_at":"2026-08-11T00:42:54.302725Z","submitted_at":"2026-04-29T18:00:10Z","title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-07T08:22:38.071410Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2604.27058"},"observation_digest":"sha256:bb8313a658a33478f823723ab1f4f82b9957bab59f0ca91f7cff8e691b11ee46","observation_id":"2a66ef22-0426-40d2-95ec-f1308e75b565","resolution":{"observed_at":"2026-05-12T10:01:28.661093Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2604.27058","last_updated":"2026-05-20T13:52:10Z","snapshot_observed_at":"2026-08-11T00:42:54.302725Z","submitted_at":"2026-04-29T18:00:10Z","title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-21T09:30:55.243056Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2604.27058"},"observation_digest":"sha256:1811e3082542f72512c9637c459ea759c39174409c51cd80098adee22c129045","observation_id":"b760ed28-d301-40de-86c5-f037bc186753","resolution":{"observed_at":"2026-05-21T09:34:05.715860Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2605.15266","last_updated":"2026-05-14T18:00:01Z","snapshot_observed_at":"2026-07-06T23:26:37.362117Z","submitted_at":"2026-05-14T18:00:01Z","title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-05-19T16:23:28.488465Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2605.15266"},"observation_digest":"sha256:6acb3348ae5f64a2b6e83fcc3369414a0b9863ce9f8e25b17d832b324120e66b","observation_id":"849c1703-5b71-409b-b76e-15529b686ea3","resolution":{"observed_at":"2026-05-19T16:27:39.714837Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2605.28536","last_updated":"2026-05-27T14:31:22Z","snapshot_observed_at":"2026-07-06T23:38:04.621658Z","submitted_at":"2026-05-27T14:31:22Z","title":"Trapped-Ion Multiqubit Gates are Compatible with Scalable Quantum Error Correction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T11:25:34.090626Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2605.28536"},"observation_digest":"sha256:109d7c7aa2cbb0fafd6b826c4bed3fbe3a7c7f72d915c2a3f40573ca57c4381d","observation_id":"f28fc8a4-736b-48e2-8bf9-863e03195d6a","resolution":{"observed_at":"2026-06-29T13:13:27.740417Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2605.28936","last_updated":"2026-05-27T18:00:02Z","snapshot_observed_at":"2026-08-05T01:22:45.138602Z","submitted_at":"2026-05-27T18:00:02Z","title":"Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits","version":1},"reference_index":198,"source":"pdf_text","source_observed_at":"2026-06-29T11:36:07.793957Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2605.28936"},"observation_digest":"sha256:11e305a87bc2ea0bba72224c05e68ad05fa80a3235f4ebec57eb1ca6fc0b325b","observation_id":"d3f97a56-c074-4cc0-9bb3-6f3750949bb3","resolution":{"observed_at":"2026-06-29T11:43:24.249422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2605.29674","last_updated":"2026-05-28T09:33:24Z","snapshot_observed_at":"2026-08-14T01:31:52.288810Z","submitted_at":"2026-05-28T09:33:24Z","title":"Error-corrected phase estimation averaged over variable grids on a trapped-ion quantum computer: hyperacuity spectra of a CO molecule adsorbed onto $\\chi$-Fe$_5$C$_2$","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T07:04:16.319979Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2605.29674"},"observation_digest":"sha256:881619d6311747c14a11b44a3992b087bcb045c99c743dbf8c27c387db3b4dab","observation_id":"a2ff02a6-1e68-44bf-9802-93bd84f6202c","resolution":{"observed_at":"2026-06-29T07:13:17.179948Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate","version":1},"cited_work":{"arxiv_id":"2506.14688","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14688","snapshot_observed_at":"2026-07-05T01:30:37.189076Z","title":"Break- ing even with magic: Demonstration of a high-fidelity logical non-Clifford gate","venue":null,"work_id":"3ddf1e52-f6b7-4b2e-a566-c00636c257d7","year":2025},"citing_paper":{"arxiv_id":"2605.29681","last_updated":"2026-05-28T09:42:33Z","snapshot_observed_at":"2026-08-05T20:34:36.017480Z","submitted_at":"2026-05-28T09:42:33Z","title":"Channel-agnostic finite-temperature phase estimation averaged over variable grids: reconstruction of Green's function for dynamical mean-field theory","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T07:01:12.430997Z"},"links":{"cited_paper":"/paper/2506.14688","citing_paper":"/paper/2605.29681"},"observation_digest":"sha256:4911eb23312bb15b808c19c23c72c1bcbade053c350e5fba5732047368790ed3","observation_id":"5182ad4b-9a62-4021-9891-7987eacb7a55","resolution":{"observed_at":"2026-06-29T07:03:12.741703Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.14688/citation-record","integrity":"/paper/2506.14688/integrity","json":"/paper/2506.14688/citation-record.json","paper":"/paper/2506.14688"},"outbound":[],"paper":{"arxiv_id":"2506.14688","last_updated":"2025-06-17T16:23:47Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T04:36:41.882898Z","submitted_at":"2025-06-17T16:23:47Z","title":"Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2506.14688."}