{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IBT7LJI3J2LKA7CYUKUHFXP7HW","short_pith_number":"pith:IBT7LJI3","canonical_record":{"source":{"id":"1308.6207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-28T16:31:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"73659e0351541b453dc00e1eee0fb60f96ad9086dacf7de746903f1ad483e4b6","abstract_canon_sha256":"a9f4b66e0c39cc244b2c3486c2dcbf0e8de7e894a1a34dc1bf09cccafdd4e02f"},"schema_version":"1.0"},"canonical_sha256":"4067f5a51b4e96a07c58a2a872ddff3d9cd66fa04c3f4200e7c0e7b851e7d1fb","source":{"kind":"arxiv","id":"1308.6207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6207","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6207v1","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6207","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"IBT7LJI3J2LK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IBT7LJI3J2LKA7CY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IBT7LJI3","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IBT7LJI3J2LKA7CYUKUHFXP7HW","target":"record","payload":{"canonical_record":{"source":{"id":"1308.6207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-28T16:31:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"73659e0351541b453dc00e1eee0fb60f96ad9086dacf7de746903f1ad483e4b6","abstract_canon_sha256":"a9f4b66e0c39cc244b2c3486c2dcbf0e8de7e894a1a34dc1bf09cccafdd4e02f"},"schema_version":"1.0"},"canonical_sha256":"4067f5a51b4e96a07c58a2a872ddff3d9cd66fa04c3f4200e7c0e7b851e7d1fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:35.532790Z","signature_b64":"X9HPuTUBDAARmsMWJ0qXY+P+W6xlEiDxjWlETnwaQWvRLcdqD8/FqjliZ8GR8fPuY526eJEbbagl/h1q+AJMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4067f5a51b4e96a07c58a2a872ddff3d9cd66fa04c3f4200e7c0e7b851e7d1fb","last_reissued_at":"2026-05-18T03:01:35.532322Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:35.532322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.6207","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnBwZSbwApDjfndJ9SJFwcfcnIrfiZRdvRJMBUUY2ZsKLBvMrUjTcUL2wnP9s3rx66OG7FCt/3e76jZDYE+1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T05:36:28.851278Z"},"content_sha256":"5cde50542204878b1d47708b82ccf36bc31450cf651f4bc9d0cfbcec199aa5ff","schema_version":"1.0","event_id":"sha256:5cde50542204878b1d47708b82ccf36bc31450cf651f4bc9d0cfbcec199aa5ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IBT7LJI3J2LKA7CYUKUHFXP7HW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding color codes by projection onto surface codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Nicolas Delfosse","submitted_at":"2013-08-28T16:31:38Z","abstract_excerpt":"We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes. Applying this idea to a family of hexagonal color codes, with the perfect matching decoding algorithm for the three corresponding surface codes, we find a phase error threshold of approximately 8.7%. Finally, our approach enables us to establish a general lower bound on the error threshold of a family of color codes depending on the threshold of the three c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6207","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxnKkYSIeuCHOzW0xMmEs/52JWGD3Ptw+fvyVgrliQWvSxM9D6ly3TVGT3R9fWmVmLpVvcd3Q/DlaM7V07PAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T05:36:28.851678Z"},"content_sha256":"98d98a7391d143b2ae741049fba0da5ef0a384686aafd6e1908bc0bcbc31dd46","schema_version":"1.0","event_id":"sha256:98d98a7391d143b2ae741049fba0da5ef0a384686aafd6e1908bc0bcbc31dd46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBT7LJI3J2LKA7CYUKUHFXP7HW/bundle.json","state_url":"https://pith.science/pith/IBT7LJI3J2LKA7CYUKUHFXP7HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBT7LJI3J2LKA7CYUKUHFXP7HW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T05:36:28Z","links":{"resolver":"https://pith.science/pith/IBT7LJI3J2LKA7CYUKUHFXP7HW","bundle":"https://pith.science/pith/IBT7LJI3J2LKA7CYUKUHFXP7HW/bundle.json","state":"https://pith.science/pith/IBT7LJI3J2LKA7CYUKUHFXP7HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBT7LJI3J2LKA7CYUKUHFXP7HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IBT7LJI3J2LKA7CYUKUHFXP7HW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a9f4b66e0c39cc244b2c3486c2dcbf0e8de7e894a1a34dc1bf09cccafdd4e02f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-28T16:31:38Z","title_canon_sha256":"73659e0351541b453dc00e1eee0fb60f96ad9086dacf7de746903f1ad483e4b6"},"schema_version":"1.0","source":{"id":"1308.6207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6207","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6207v1","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6207","created_at":"2026-05-18T03:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"IBT7LJI3J2LK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IBT7LJI3J2LKA7CY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IBT7LJI3","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:98d98a7391d143b2ae741049fba0da5ef0a384686aafd6e1908bc0bcbc31dd46","target":"graph","created_at":"2026-05-18T03:01:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes. Applying this idea to a family of hexagonal color codes, with the perfect matching decoding algorithm for the three corresponding surface codes, we find a phase error threshold of approximately 8.7%. Finally, our approach enables us to establish a general lower bound on the error threshold of a family of color codes depending on the threshold of the three c","authors_text":"Nicolas Delfosse","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-28T16:31:38Z","title":"Decoding color codes by projection onto surface codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6207","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5cde50542204878b1d47708b82ccf36bc31450cf651f4bc9d0cfbcec199aa5ff","target":"record","created_at":"2026-05-18T03:01:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a9f4b66e0c39cc244b2c3486c2dcbf0e8de7e894a1a34dc1bf09cccafdd4e02f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-28T16:31:38Z","title_canon_sha256":"73659e0351541b453dc00e1eee0fb60f96ad9086dacf7de746903f1ad483e4b6"},"schema_version":"1.0","source":{"id":"1308.6207","kind":"arxiv","version":1}},"canonical_sha256":"4067f5a51b4e96a07c58a2a872ddff3d9cd66fa04c3f4200e7c0e7b851e7d1fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4067f5a51b4e96a07c58a2a872ddff3d9cd66fa04c3f4200e7c0e7b851e7d1fb","first_computed_at":"2026-05-18T03:01:35.532322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:35.532322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X9HPuTUBDAARmsMWJ0qXY+P+W6xlEiDxjWlETnwaQWvRLcdqD8/FqjliZ8GR8fPuY526eJEbbagl/h1q+AJMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:35.532790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cde50542204878b1d47708b82ccf36bc31450cf651f4bc9d0cfbcec199aa5ff","sha256:98d98a7391d143b2ae741049fba0da5ef0a384686aafd6e1908bc0bcbc31dd46"],"state_sha256":"1b2d5660c64978296f5d20d4860a222eef19d5515dec5eaeb1d4809ff7f7e24b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TbztXTi6d++oEEXqMA8KHiYu0GVRek5e+mPfAVBSHS/YSck3SLn1APBIJZQdQsziUPi6F9khxHAngNM/j3QxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T05:36:28.854023Z","bundle_sha256":"f68c14a15f789db6c7eb8f61053a00d876eb8dc10a076b3ee0c5766026095a70"}}