{"as_of":"2026-07-16T01:34:00Z","canonical_paper_id":"1302.2669","canonical_url":"https://pith.science/paper/1302.2669/integrity","context_digest":"sha256:d8f47390d81875debc63eaaec21e61d42ba2920d0b10bd25c13b10f4ccbbbc16","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/1302.2669","bundle_json":"/pith/G3EPVDXA7NR3O6CTNIJRYR2XKF/bundle.json","citation_record":"/paper/1302.2669/citation-record","evidence":"/evidence","html":"/paper/1302.2669/integrity","integrity_json":"/paper/1302.2669/integrity.json","json":"/paper/1302.2669/integrity.json","legacy_integrity_json":"/pith/1302.2669/integrity.json","paper":"/paper/1302.2669","reference_changes":"/flags?citing=1302.2669"},"paper":{"arxiv_id":"1302.2669","latest_version":2,"primary_cat":"quant-ph","title":"An efficient Markov chain Monte Carlo algorithm for the surface code"},"pith_number":"pith:2013:G3EPVDXA7NR3O6CTNIJRYR2XKF","pith_short":"G3EPVDXA7NR3O6CTNIJRYR2XKF","record":{"arxiv_id":"1302.2669","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1302.2669. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}