{"as_of":"2026-08-15T16:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09dcb2e58ee7eec54ed3b5fb50b5f39b7589a3fc0cc4af8dc9c3dc90984fc74a","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T10:54:32.984573Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.27153/citation-record","integrity":"/paper/2607.27153/integrity","json":"/paper/2607.27153/citation-record.json","paper":"/paper/2607.27153"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T10:54:32.762076Z","title":"Quantum accuracy threshold for concatenated distance-3 codes.Quantum Information & Computation, 6(2):97–165, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.762076Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:0e64ac7910e351498ea4e235dc8a9c7f3002b46f3a9ffbaedafb7ed4a895bcdd","observation_id":"85b6e6cb-5239-4544-b91b-9a365a754fb9","resolution":{"observed_at":"2026-07-30T10:54:32.762076Z","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-07-30T10:54:32.768985Z","title":"Operator quantum error-correcting subsystems for self-correcting quantum memories.Physical Review A—Atomic, Molecular, and Optical Physics, 73(1):012340, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.768985Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:542f2189e37ebc59a87daadf27b294652a1c44a3179d9b304b75683924aff64d","observation_id":"54897ab5-87d4-4bb9-847f-03ea9e2dab7b","resolution":{"observed_at":"2026-07-30T10:54:32.768985Z","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-07-30T10:54:32.776728Z","title":"Efficient estimation of free energy differences from Monte Carlo data","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.776728Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:0a12c11f9742de7ec42016ea29207988d41020020333187182cfe2d3656e2978","observation_id":"7dd7f352-d564-4114-9c45-976bb775b1b9","resolution":{"observed_at":"2026-07-30T10:54:32.776728Z","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-07-30T10:54:32.784039Z","title":"Fail fast: techniques to probe rare events in quantum error correction.arXiv preprint arXiv:2511.15177, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.784039Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:3c7240e75e324ad1b7ddc48d3d421ff60c7d5f6a8c37eb88ec500d206c927970","observation_id":"ed729b59-096c-408e-8096-fa83b7c4a092","resolution":{"observed_at":"2026-07-30T10:54:32.784039Z","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-07-30T10:54:32.795825Z","title":"Simulation of rare events in quantum error correc- tion.Physical Review A—Atomic, Molecular, and Optical Physics, 88(6):062308, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.795825Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:4a147463c20e63966acefd4a5538b609b7e3bba668c6992358ecae70edb2d48b","observation_id":"444f11f0-2de3-4a2d-b48c-db63d25b3269","resolution":{"observed_at":"2026-07-30T10:54:32.795825Z","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-07-30T10:54:32.804746Z","title":"Topological quantum memory.Journal of Mathematical Physics, 43(9):4452–4505, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.804746Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:71a6ce8d9d654a935847cfc4094229623acd9899218eea5d855b3c7b7334217c","observation_id":"575608b0-4797-4a05-a26b-a626753e2a33","resolution":{"observed_at":"2026-07-30T10:54:32.804746Z","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-07-30T10:54:32.844911Z","title":"Hybrid Monte Carlo.Physics letters B, 195(2):216–222, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.844911Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:391dbd9de85b58ce029a1e086dadce27f8c7b6fb513e068439e99cb9b296463b","observation_id":"0b1a49f5-45f9-4263-99b4-68a7f7bf063b","resolution":{"observed_at":"2026-07-30T10:54:32.844911Z","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-07-30T10:54:32.894756Z","title":"Inference from simulations and monitoring conver- gence","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.894756Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:4c12aecc08f270bc38fed905da37f51b72d724555e1808b43218acd5454f0dfe","observation_id":"22395fac-d8bd-4e28-8aa5-0c6bd2665441","resolution":{"observed_at":"2026-07-30T10:54:32.894756Z","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-07-30T10:54:32.909124Z","title":"Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images.IEEE Transactions on pattern analysis and machine intelligence, (6):721–741, 1984","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.909124Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:a4b31ca595514dbd8d58aa70f1440d586669994aec15a942b67400c88e9457dd","observation_id":"e11cc213-926f-437d-9d93-02079329ecdb","resolution":{"observed_at":"2026-07-30T10:54:32.909124Z","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-07-30T10:54:32.918443Z","title":"Introduction to Markov chain Monte Carlo","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.918443Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:69378dd331d27b1279bfba6d4a8f6d9e03814acf1f28fc4e9720c2f5f71772c0","observation_id":"0ba15114-f5a1-4a9a-938a-bca16de5e80b","resolution":{"observed_at":"2026-07-30T10:54:32.918443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15917","last_updated":"2025-05-21T18:11:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-21T18:11:44Z","title":"How to factor 2048 bit RSA integers with less than a million noisy qubits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15917","snapshot_observed_at":"2026-07-30T10:54:32.926488Z","title":"How to factor 2048 bit rsa integers with less than a million noisy qubits","venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.926488Z"},"links":{"cited_paper":"/paper/2505.15917","citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:17920dec1adc01e9818828629a6e5f72b3ba3b74183dad1b9ae9adcd59a94622","observation_id":"41037cc3-ecf5-40b2-8fda-ac8416c9ea57","resolution":{"observed_at":"2026-07-30T10:54:32.926488Z","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-07-30T10:54:32.933559Z","title":"Monte Carlo sampling methods using markov chains and their appli- cations","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.933559Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:c8f52282581e6542634c93fdef0231218c103e8449838917a882ed144005d5ad","observation_id":"dd2ae6cf-bf8f-4b82-8cf3-ef3997e86205","resolution":{"observed_at":"2026-07-30T10:54:32.933559Z","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-07-30T10:54:32.942362Z","title":"Dynamical subset sampling of quantum error-correcting protocols.Physical Review Research, 6(1):013177, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.942362Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:46c0529bb72b1110120d593a2cc2cd277ac576d646a92dfa023d0df8f53b1b1a","observation_id":"1deeb78b-f2b0-4b6e-a2f6-246093543a06","resolution":{"observed_at":"2026-07-30T10:54:32.942362Z","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-07-30T10:54:32.948667Z","title":"Blossom v: a new implementation of a minimum cost perfect matching algorithm.Mathematical Programming Computation, 1(1):43–67, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.948667Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:5bc5fcbb13b20686d6c56f3983a7ce53df808f3adca004515252e303a118be8b","observation_id":"a205dcdc-2e8c-494d-b317-23e9fe2b8bc9","resolution":{"observed_at":"2026-07-30T10:54:32.948667Z","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-07-30T10:54:32.955818Z","title":"Even more efficient quantum computations of chem- istry through tensor hypercontraction.PRX quantum, 2(3):030305, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.955818Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:a31b3a5a1bacbc5ac77ab71088297bd21e16bed4fc3444b6226d2d706e7dbc5e","observation_id":"139cf9dd-d18a-495c-aba4-7907d0e8828b","resolution":{"observed_at":"2026-07-30T10:54:32.955818Z","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-07-30T10:54:32.962770Z","title":"Rare event simulation of quantum error-correcting circuits.arXiv preprint arXiv:2509.13678, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.962770Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:6aa7fa190ffe997709457c9112a2551124f5b2455f2c3cbebf22cc2f974e4ab1","observation_id":"802553f4-af76-47ce-ab1d-428b14e8e859","resolution":{"observed_at":"2026-07-30T10:54:32.962770Z","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-07-30T10:54:32.969453Z","title":"Equation of state calculations by fast computing machines.The journal of chemical physics, 21(6):1087–1092, 1953","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.969453Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:7fae720f31d6ec8c40fb53e329104adfa0c30470b541dade84e40ac42df56863","observation_id":"a48457cc-9908-473b-bf47-64f78c79f039","resolution":{"observed_at":"2026-07-30T10:54:32.969453Z","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-07-30T10:54:32.977857Z","title":"Slice sampling.The Annals of Statistics, 31(3):705–767, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.977857Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:664d5175d69668dc60c7a9c9b3bd375509661ab4462d4cbb3baa2c01a5ce0349","observation_id":"8ecc2c66-31c8-40ff-82dc-be59cbd934a2","resolution":{"observed_at":"2026-07-30T10:54:32.977857Z","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-07-30T10:54:32.984573Z","title":"Revisiting the Gelman-Rubin diagnostic.Statistical Science, 36(4):518 – 529, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T10:54:32.984573Z"},"links":{"citing_paper":"/paper/2607.27153"},"observation_digest":"sha256:ed7d11c148c3c765ba9cecf309e55519e3e86a1099e900879ba04ca65e6b24f3","observation_id":"4cccf4cf-c17b-4bbd-a6a1-216f83c90001","resolution":{"observed_at":"2026-07-30T10:54:32.984573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27153","last_updated":"2026-07-29T17:32:21Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T11:12:02.217190Z","submitted_at":"2026-07-29T17:32:21Z","title":"Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":19},"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 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2607.27153."}