{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7V56NT2IRJKPIM6NI63K2USASS","short_pith_number":"pith:7V56NT2I","schema_version":"1.0","canonical_sha256":"fd7be6cf488a54f433cd47b6ad524094be7031580b8915d2d3c645fdf4b28b25","source":{"kind":"arxiv","id":"1708.09286","version":1},"attestation_state":"computed","paper":{"title":"Renormalization group decoder for a four-dimensional toric code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara M. Terhal, Kasper Duivenvoorden, Nikolas P. Breuckmann","submitted_at":"2017-08-30T14:12:01Z","abstract_excerpt":"We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We use this algorithm to correct errors occurring in a four-dimensional variant of the toric code, having open as opposed to periodic boundaries. For a phenomenological error model which includes measurement errors we use a five-dimensional version of our algorithm, achieving a threshold of $4.35\\pm0.1\\%$. For this error model, this is the highest known thresho"},"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":"1708.09286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-30T14:12:01Z","cross_cats_sorted":[],"title_canon_sha256":"c37a9aaf30319d43fdf223c80b58447b31e0c75d865b1392bc607c2791bdcf4a","abstract_canon_sha256":"2863c0ca8cfd95b392ba7e8e44010867d0bb4bc0d2e9785891a993c95d215571"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:52.127364Z","signature_b64":"IvFJt0Q9D73ztPMwhnV6y+8fRfFIB+GWxE7aiujm0nzHOUxXLntuQore6AAi0OxTdVuDMntzZ04A10HPWa/DBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7be6cf488a54f433cd47b6ad524094be7031580b8915d2d3c645fdf4b28b25","last_reissued_at":"2026-05-17T23:53:52.126633Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:52.126633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Renormalization group decoder for a four-dimensional toric code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara M. Terhal, Kasper Duivenvoorden, Nikolas P. Breuckmann","submitted_at":"2017-08-30T14:12:01Z","abstract_excerpt":"We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We use this algorithm to correct errors occurring in a four-dimensional variant of the toric code, having open as opposed to periodic boundaries. For a phenomenological error model which includes measurement errors we use a five-dimensional version of our algorithm, achieving a threshold of $4.35\\pm0.1\\%$. For this error model, this is the highest known thresho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09286","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":""},"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":"1708.09286","created_at":"2026-05-17T23:53:52.126760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09286v1","created_at":"2026-05-17T23:53:52.126760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09286","created_at":"2026-05-17T23:53:52.126760+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V56NT2IRJKP","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V56NT2IRJKPIM6N","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V56NT2I","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS","json":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS.json","graph_json":"https://pith.science/api/pith-number/7V56NT2IRJKPIM6NI63K2USASS/graph.json","events_json":"https://pith.science/api/pith-number/7V56NT2IRJKPIM6NI63K2USASS/events.json","paper":"https://pith.science/paper/7V56NT2I"},"agent_actions":{"view_html":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS","download_json":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS.json","view_paper":"https://pith.science/paper/7V56NT2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09286&json=true","fetch_graph":"https://pith.science/api/pith-number/7V56NT2IRJKPIM6NI63K2USASS/graph.json","fetch_events":"https://pith.science/api/pith-number/7V56NT2IRJKPIM6NI63K2USASS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS/action/storage_attestation","attest_author":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS/action/author_attestation","sign_citation":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS/action/citation_signature","submit_replication":"https://pith.science/pith/7V56NT2IRJKPIM6NI63K2USASS/action/replication_record"}},"created_at":"2026-05-17T23:53:52.126760+00:00","updated_at":"2026-05-17T23:53:52.126760+00:00"}