{"as_of":"2026-08-10T09:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a441f6cc56e1d5e9248de43559747529def54b1954958997d77e0eb709f76182","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:03:59.936263Z","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-02T13:06:59.386788Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-08-09T17:03:59.936263Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.00998","last_updated":"2025-07-01T16:37:44Z","snapshot_observed_at":"2026-08-09T22:10:12.695524Z","submitted_at":"2025-02-03T02:38:32Z","title":"Generating logical magic states with the aid of non-Abelian topological order","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-09T17:03:59.936263Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2502.00998"},"observation_digest":"sha256:f017c334a6e0920fd21e518c54b3dc14a0431f998d07a24417de27298ea86ce7","observation_id":"9bf59e42-d84d-4a60-a679-52a5ad26aacc","resolution":{"observed_at":"2026-08-09T17:03:59.936263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-08-07T14:41:26.377056Z","title":"Davydova, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18265","last_updated":"2025-05-23T18:01:38Z","snapshot_observed_at":"2026-08-09T00:06:28.092983Z","submitted_at":"2025-05-23T18:01:38Z","title":"Non-Clifford gates between stabilizer codes via non-Abelian topological order","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:41:26.377056Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2505.18265"},"observation_digest":"sha256:d9c88c47cfa24fa3f3897e5d4b4f55c9744aa2577d8228b3cb6a29b49892a87a","observation_id":"26ea688a-7287-4620-965a-7038f53fe974","resolution":{"observed_at":"2026-08-07T14:41:26.377056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":"2503.15751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-07-28T02:23:14.208035Z","title":"Davydova, A","venue":null,"work_id":"94fe9db1-39c7-4cfe-9f49-a7bfb3b27c9f","year":2025},"citing_paper":{"arxiv_id":"2507.16152","last_updated":"2026-05-14T19:04:15Z","snapshot_observed_at":"2026-08-02T13:41:34.734206Z","submitted_at":"2025-07-22T01:59:25Z","title":"Practical blueprint for low-depth photonic quantum computing with quantum dots","version":2},"reference_index":107,"source":"pdf_text","source_observed_at":"2026-05-22T00:31:44.691800Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2507.16152"},"observation_digest":"sha256:e6d0079261238f38ff7a2dc1f68fb13521098246f5c4b58b853654d772f9b22f","observation_id":"6dc01c6d-8e83-4692-9a08-390bac54cbb7","resolution":{"observed_at":"2026-07-28T02:23:14.208035Z","resolver_source":"arxiv_id","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":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":"2503.15751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-07-28T02:23:14.208035Z","title":"Davydova, A","venue":null,"work_id":"94fe9db1-39c7-4cfe-9f49-a7bfb3b27c9f","year":2025},"citing_paper":{"arxiv_id":"2511.02900","last_updated":"2026-05-19T22:25:24Z","snapshot_observed_at":"2026-08-06T19:18:39.022814Z","submitted_at":"2025-11-04T19:00:00Z","title":"Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-21T19:14:49.965519Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2511.02900"},"observation_digest":"sha256:7a0816573ed487100175a8eedb2ea255ca21c9b9231e9e9811dcffbe0cbc5954","observation_id":"ee56e70b-9d9a-43a6-9dc1-c9141cbb9c8c","resolution":{"observed_at":"2026-07-28T02:23:14.208035Z","resolver_source":"arxiv_id","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":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-08-03T16:32:53.841614Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.13777","last_updated":"2026-06-03T13:47:30Z","snapshot_observed_at":"2026-08-03T16:32:52.300365Z","submitted_at":"2025-12-15T19:00:00Z","title":"Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T16:32:53.841614Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2512.13777"},"observation_digest":"sha256:307eba359ea0fa4da0dd7f2fa0c8381eb264ce3c10bc2546c3d726946198ce8d","observation_id":"3693bdd0-a7ac-4b43-a0a6-9387a4804104","resolution":{"observed_at":"2026-08-03T16:32:53.841614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-08-03T13:41:13.187994Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots,","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-08T11:02:07.503105Z","submitted_at":"2025-12-29T19:00:05Z","title":"Efficient simulation of logical magic state preparation protocols","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T13:41:13.187994Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2512.23799"},"observation_digest":"sha256:bae818f1cf5fde565b4e395c591c9e749a7ed2c3610486c84ce56fd20d871ca8","observation_id":"0a4098d8-6d4c-46b4-9412-7efa7ba29179","resolution":{"observed_at":"2026-08-03T13:41:13.187994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":"2503.15751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-07-28T02:23:14.208035Z","title":"Davydova, A","venue":null,"work_id":"94fe9db1-39c7-4cfe-9f49-a7bfb3b27c9f","year":2025},"citing_paper":{"arxiv_id":"2601.10964","last_updated":"2026-04-27T19:17:44Z","snapshot_observed_at":"2026-08-08T14:08:48.873856Z","submitted_at":"2026-01-16T03:06:56Z","title":"Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-16T14:28:03.493301Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2601.10964"},"observation_digest":"sha256:2739bfe2ca6be308df418facedc6b3ed3d200c4b7ee2cf79c8892c29f8e97499","observation_id":"7f505898-d7ce-490d-9925-4dec48158312","resolution":{"observed_at":"2026-07-28T02:23:14.208035Z","resolver_source":"arxiv_id","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":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":"2503.15751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-07-28T02:23:14.208035Z","title":"Davydova, A","venue":null,"work_id":"94fe9db1-39c7-4cfe-9f49-a7bfb3b27c9f","year":2025},"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":2,"source":"pdf_text","source_observed_at":"2026-05-15T16:06:44.792360Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2603.05429"},"observation_digest":"sha256:8472af23a7e733342857ced3894ed89342bbbe9a280960f46d7d6cc91d72f8f7","observation_id":"c3ed4ba8-952f-448e-a9eb-2f7c54612e39","resolution":{"observed_at":"2026-07-28T02:23:14.208035Z","resolver_source":"arxiv_id","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":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":"2503.15751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-07-28T02:23:14.208035Z","title":"Davydova, A","venue":null,"work_id":"94fe9db1-39c7-4cfe-9f49-a7bfb3b27c9f","year":2025},"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":20,"source":"pdf_text","source_observed_at":"2026-06-28T01:33:57.976337Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2606.05664"},"observation_digest":"sha256:7542be31916abed80f79a0bbda7ebb0dad47df79e565f048cc64e2ee253370d3","observation_id":"ce5df6bf-a179-4729-a8a9-836389b72a8d","resolution":{"observed_at":"2026-07-28T02:23:14.208035Z","resolver_source":"arxiv_id","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":"2503.15751","last_updated":"2025-05-15T17:06:46Z","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15751","snapshot_observed_at":"2026-08-01T15:11:08.775040Z","title":"Universal fault tolerant quantum computing in 2d without getting tied in knots","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-05T14:13:31.414027Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:08.775040Z"},"links":{"cited_paper":"/paper/2503.15751","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:1be9e56d0e360a21e50ea831f6987ba5c093dbf5a707cfa82eb066087853bac7","observation_id":"5767a3be-b338-44b4-9a37-e2e785115404","resolution":{"observed_at":"2026-08-01T15:11:08.775040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.15751/citation-record","integrity":"/paper/2503.15751/integrity","json":"/paper/2503.15751/citation-record.json","paper":"/paper/2503.15751"},"outbound":[],"paper":{"arxiv_id":"2503.15751","last_updated":"2025-05-15T17:06:46Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T16:50:24.920068Z","submitted_at":"2025-03-19T23:59:46Z","title":"Universal fault tolerant quantum computation in 2D without getting tied in knots"},"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-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 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2503.15751."}