{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UVP2AQR4PRI3RAOVAPBWIZKKLN","short_pith_number":"pith:UVP2AQR4","schema_version":"1.0","canonical_sha256":"a55fa0423c7c51b881d503c364654a5b7e250ae172dc736ed812b15dbcc26ebf","source":{"kind":"arxiv","id":"2309.12165","version":1},"attestation_state":"computed","paper":{"title":"Analysis of the Error-Correcting Radius of a Renormalisation Decoder for Kitaev's Toric Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Gilles Z\\'emor, Wouter Rozendaal","submitted_at":"2023-09-21T15:23:41Z","abstract_excerpt":"Kitaev's toric code is arguably the most studied quantum code and is expected to be implemented in future generations of quantum computers. The renormalisation decoders introduced by Duclos-Cianci and Poulin exhibit one of the best trade-offs between efficiency and speed, but one question that was left open is how they handle worst-case or adversarial errors, i.e. what is the order of magnitude of the smallest weight of an error pattern that will be wrongly decoded. We initiate such a study involving a simple hard-decision and deterministic version of a renormalisation decoder. We exhibit an u"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.12165","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-21T15:23:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cb99683c691685e7f4882987aa5b3254d9e579c02c4b09382a4ae513123f3ba7","abstract_canon_sha256":"aeab23a2998c519db28e72aa50b45ce14411454ef0215a58887f6da95281656f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:59.511178Z","signature_b64":"P5eQqZhIgDp3uWDvM9i5SeUervVwgjnTP+WJ0JnU30UIfLBDPL4xB7Ycn49ToGqwgk9JqxHS0K3JMN10KznkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a55fa0423c7c51b881d503c364654a5b7e250ae172dc736ed812b15dbcc26ebf","last_reissued_at":"2026-07-05T06:52:59.510706Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:59.510706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of the Error-Correcting Radius of a Renormalisation Decoder for Kitaev's Toric Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Gilles Z\\'emor, Wouter Rozendaal","submitted_at":"2023-09-21T15:23:41Z","abstract_excerpt":"Kitaev's toric code is arguably the most studied quantum code and is expected to be implemented in future generations of quantum computers. The renormalisation decoders introduced by Duclos-Cianci and Poulin exhibit one of the best trade-offs between efficiency and speed, but one question that was left open is how they handle worst-case or adversarial errors, i.e. what is the order of magnitude of the smallest weight of an error pattern that will be wrongly decoded. We initiate such a study involving a simple hard-decision and deterministic version of a renormalisation decoder. We exhibit an u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.12165","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.12165/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.12165","created_at":"2026-07-05T06:52:59.510763+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.12165v1","created_at":"2026-07-05T06:52:59.510763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.12165","created_at":"2026-07-05T06:52:59.510763+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVP2AQR4PRI3","created_at":"2026-07-05T06:52:59.510763+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVP2AQR4PRI3RAOV","created_at":"2026-07-05T06:52:59.510763+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVP2AQR4","created_at":"2026-07-05T06:52:59.510763+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21237","citing_title":"(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN","json":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN.json","graph_json":"https://pith.science/api/pith-number/UVP2AQR4PRI3RAOVAPBWIZKKLN/graph.json","events_json":"https://pith.science/api/pith-number/UVP2AQR4PRI3RAOVAPBWIZKKLN/events.json","paper":"https://pith.science/paper/UVP2AQR4"},"agent_actions":{"view_html":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN","download_json":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN.json","view_paper":"https://pith.science/paper/UVP2AQR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.12165&json=true","fetch_graph":"https://pith.science/api/pith-number/UVP2AQR4PRI3RAOVAPBWIZKKLN/graph.json","fetch_events":"https://pith.science/api/pith-number/UVP2AQR4PRI3RAOVAPBWIZKKLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN/action/storage_attestation","attest_author":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN/action/author_attestation","sign_citation":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN/action/citation_signature","submit_replication":"https://pith.science/pith/UVP2AQR4PRI3RAOVAPBWIZKKLN/action/replication_record"}},"created_at":"2026-07-05T06:52:59.510763+00:00","updated_at":"2026-07-05T06:52:59.510763+00:00"}