{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:73YRZRE7E7YTAP4V6R56WPVYWR","short_pith_number":"pith:73YRZRE7","schema_version":"1.0","canonical_sha256":"fef11cc49f27f1303f95f47beb3eb8b4645c14f77b23cd0bfd584aa26201a924","source":{"kind":"arxiv","id":"1402.3037","version":1},"attestation_state":"computed","paper":{"title":"Efficient fault-tolerant decoding of topological color codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley M. Stephens","submitted_at":"2014-02-13T06:05:14Z","abstract_excerpt":"Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum computation. Recently, several efficient algorithms for decoding the syndrome of color codes were proposed. Here, we modify one of these algorithms to account for errors affecting the syndrome, applying it to the family of triangular 4.8.8 color codes encoding one logical qubit. For a three-dimensional bit-flip channel, we report a threshold error rate of 0.0208"},"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":"1402.3037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-13T06:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"d6e75ed42766c61d76df7673642c75de2e8fecf86237539046688aff75124cbd","abstract_canon_sha256":"b26db6f24a542ea48e078ee06d257259997d3619fca0dabd8b8e13945ae8250f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:08.004573Z","signature_b64":"78swaXrrQgc4esqdmnGf8P/j/stEDZsN+Z7SwM5MXdMW2uKGv1XWm1SzfruKtB4J8B3mER6UUnFR3Qdx/Yb9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fef11cc49f27f1303f95f47beb3eb8b4645c14f77b23cd0bfd584aa26201a924","last_reissued_at":"2026-05-18T02:59:08.003854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:08.003854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient fault-tolerant decoding of topological color codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley M. Stephens","submitted_at":"2014-02-13T06:05:14Z","abstract_excerpt":"Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum computation. Recently, several efficient algorithms for decoding the syndrome of color codes were proposed. Here, we modify one of these algorithms to account for errors affecting the syndrome, applying it to the family of triangular 4.8.8 color codes encoding one logical qubit. For a three-dimensional bit-flip channel, we report a threshold error rate of 0.0208"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3037","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":"1402.3037","created_at":"2026-05-18T02:59:08.003971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3037v1","created_at":"2026-05-18T02:59:08.003971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3037","created_at":"2026-05-18T02:59:08.003971+00:00"},{"alias_kind":"pith_short_12","alias_value":"73YRZRE7E7YT","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"73YRZRE7E7YTAP4V","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"73YRZRE7","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":129,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17339","citing_title":"Fault-Tolerant Cut-Cat State Syndrome Extraction for Quantum Codes","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR","json":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR.json","graph_json":"https://pith.science/api/pith-number/73YRZRE7E7YTAP4V6R56WPVYWR/graph.json","events_json":"https://pith.science/api/pith-number/73YRZRE7E7YTAP4V6R56WPVYWR/events.json","paper":"https://pith.science/paper/73YRZRE7"},"agent_actions":{"view_html":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR","download_json":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR.json","view_paper":"https://pith.science/paper/73YRZRE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3037&json=true","fetch_graph":"https://pith.science/api/pith-number/73YRZRE7E7YTAP4V6R56WPVYWR/graph.json","fetch_events":"https://pith.science/api/pith-number/73YRZRE7E7YTAP4V6R56WPVYWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR/action/storage_attestation","attest_author":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR/action/author_attestation","sign_citation":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR/action/citation_signature","submit_replication":"https://pith.science/pith/73YRZRE7E7YTAP4V6R56WPVYWR/action/replication_record"}},"created_at":"2026-05-18T02:59:08.003971+00:00","updated_at":"2026-05-18T02:59:08.003971+00:00"}