{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ENJXVLNBGKGF26SL6GXAXXYKEP","short_pith_number":"pith:ENJXVLNB","schema_version":"1.0","canonical_sha256":"23537aada1328c5d7a4bf1ae0bdf0a23f71d2fdf362ff1618fed34080dc66d47","source":{"kind":"arxiv","id":"1410.4478","version":2},"attestation_state":"computed","paper":{"title":"Improved HDRG decoders for qudit and non-Abelian quantum error correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adrian Hutter, Daniel Loss, James R. Wootton","submitted_at":"2014-10-16T16:05:03Z","abstract_excerpt":"Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strenghts of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size $L$ from $\\Theta(L^{2/3})$ to $\\Omega(L^{1-\\epsi"},"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":"1410.4478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-16T16:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"b97a121b9a672f0259b13978c6888f6544e88834656fdb4003eb645669d30418","abstract_canon_sha256":"47377672ef532ae8f0cf87c2ef6c107d10af4b721e7a1a1e30028b62eba4c3f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:44.309792Z","signature_b64":"R/0BBJ/Hw2rkkSJKPD5wejJ/zYIR86iEN7Cb6A0D/YPayvvwDlv+YyUbVp3Y2PRVjHTzIHlmaUjTQhJt7LDfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23537aada1328c5d7a4bf1ae0bdf0a23f71d2fdf362ff1618fed34080dc66d47","last_reissued_at":"2026-05-18T01:41:44.308892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:44.308892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved HDRG decoders for qudit and non-Abelian quantum error correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adrian Hutter, Daniel Loss, James R. Wootton","submitted_at":"2014-10-16T16:05:03Z","abstract_excerpt":"Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strenghts of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size $L$ from $\\Theta(L^{2/3})$ to $\\Omega(L^{1-\\epsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4478","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1410.4478","created_at":"2026-05-18T01:41:44.309179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4478v2","created_at":"2026-05-18T01:41:44.309179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4478","created_at":"2026-05-18T01:41:44.309179+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENJXVLNBGKGF","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENJXVLNBGKGF26SL","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENJXVLNB","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP","json":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP.json","graph_json":"https://pith.science/api/pith-number/ENJXVLNBGKGF26SL6GXAXXYKEP/graph.json","events_json":"https://pith.science/api/pith-number/ENJXVLNBGKGF26SL6GXAXXYKEP/events.json","paper":"https://pith.science/paper/ENJXVLNB"},"agent_actions":{"view_html":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP","download_json":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP.json","view_paper":"https://pith.science/paper/ENJXVLNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4478&json=true","fetch_graph":"https://pith.science/api/pith-number/ENJXVLNBGKGF26SL6GXAXXYKEP/graph.json","fetch_events":"https://pith.science/api/pith-number/ENJXVLNBGKGF26SL6GXAXXYKEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP/action/storage_attestation","attest_author":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP/action/author_attestation","sign_citation":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP/action/citation_signature","submit_replication":"https://pith.science/pith/ENJXVLNBGKGF26SL6GXAXXYKEP/action/replication_record"}},"created_at":"2026-05-18T01:41:44.309179+00:00","updated_at":"2026-05-18T01:41:44.309179+00:00"}