{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PBFR7QUREM4BMRQ7FDCMDVCBLZ","short_pith_number":"pith:PBFR7QUR","canonical_record":{"source":{"id":"2301.13738","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T16:17:25Z","cross_cats_sorted":[],"title_canon_sha256":"b6ebdef09918a0e5a232da4960b7215d947c4c2ae518d413844fc9e60dbcdfc0","abstract_canon_sha256":"b1a6d3933accc5b5c95a7d1a7ac593164b1e41577ac46265732a2d84ee6dfa8a"},"schema_version":"1.0"},"canonical_sha256":"784b1fc291233816461f28c4c1d4415e72a29931ae9c5068d84b52a037664e68","source":{"kind":"arxiv","id":"2301.13738","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.13738","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"2301.13738v6","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13738","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"PBFR7QUREM4B","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"pith_short_16","alias_value":"PBFR7QUREM4BMRQ7","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"pith_short_8","alias_value":"PBFR7QUR","created_at":"2026-07-05T08:18:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PBFR7QUREM4BMRQ7FDCMDVCBLZ","target":"record","payload":{"canonical_record":{"source":{"id":"2301.13738","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T16:17:25Z","cross_cats_sorted":[],"title_canon_sha256":"b6ebdef09918a0e5a232da4960b7215d947c4c2ae518d413844fc9e60dbcdfc0","abstract_canon_sha256":"b1a6d3933accc5b5c95a7d1a7ac593164b1e41577ac46265732a2d84ee6dfa8a"},"schema_version":"1.0"},"canonical_sha256":"784b1fc291233816461f28c4c1d4415e72a29931ae9c5068d84b52a037664e68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:40.408109Z","signature_b64":"uJLRUr+xxaElEutv7Wq6naC5wP4dI+vHSxhBGJIyr4bZ7k2evcbIRYQecLSF9LiC54dk+DQeB4h9Bc8cJzGzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"784b1fc291233816461f28c4c1d4415e72a29931ae9c5068d84b52a037664e68","last_reissued_at":"2026-07-05T08:18:40.407629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:40.407629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.13738","source_version":6,"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-07-05T08:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JONE/98E8fh14R60SiEgDeQS4BelPgesb5RYuS+2m3hHwYnyh3Zyi2Wx1TzQdlD3AZDalHi/YoRk6rbLR0fcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T04:31:47.051756Z"},"content_sha256":"280bfbb3b9e5ce50039d4934c10a069ea2c736661aaca83f02abd3fa8f2028d6","schema_version":"1.0","event_id":"sha256:280bfbb3b9e5ce50039d4934c10a069ea2c736661aaca83f02abd3fa8f2028d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PBFR7QUREM4BMRQ7FDCMDVCBLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CSS code surgery as a universal construction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Cowtan, Simon Burton","submitted_at":"2023-01-31T16:17:25Z","abstract_excerpt":"We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes, and describe code surgery between such codes using a specific colimit in the category of chain complexes. As well as describing a surgery operation, this gives a general recipe for new codes. As an application we describe how to `merge' and `split' along a shared $\\overline{X}$ or $\\overline{Z}$ operator between arbitrary CSS codes in a fault-tolerant manner, so long as certain technical conditions concerning gauge fixing and code distance are satisfied. We prove that such merges and splits on LD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13738","kind":"arxiv","version":6},"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/2301.13738/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"},"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-07-05T08:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s9QaU9M30uoPoNfmR8txT2FF2cjI66gmO0FF5GLONieIII9N9ork5Q6dlpyf7lo/3HW6gXeW16gbNtvmbDHoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T04:31:47.052233Z"},"content_sha256":"0f7200d102c6ab12c80b2f9df564dbedaf1ca7b072b9fbca6d2b403463f02d4e","schema_version":"1.0","event_id":"sha256:0f7200d102c6ab12c80b2f9df564dbedaf1ca7b072b9fbca6d2b403463f02d4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBFR7QUREM4BMRQ7FDCMDVCBLZ/bundle.json","state_url":"https://pith.science/pith/PBFR7QUREM4BMRQ7FDCMDVCBLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBFR7QUREM4BMRQ7FDCMDVCBLZ/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-08-03T04:31:47Z","links":{"resolver":"https://pith.science/pith/PBFR7QUREM4BMRQ7FDCMDVCBLZ","bundle":"https://pith.science/pith/PBFR7QUREM4BMRQ7FDCMDVCBLZ/bundle.json","state":"https://pith.science/pith/PBFR7QUREM4BMRQ7FDCMDVCBLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBFR7QUREM4BMRQ7FDCMDVCBLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PBFR7QUREM4BMRQ7FDCMDVCBLZ","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":"b1a6d3933accc5b5c95a7d1a7ac593164b1e41577ac46265732a2d84ee6dfa8a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T16:17:25Z","title_canon_sha256":"b6ebdef09918a0e5a232da4960b7215d947c4c2ae518d413844fc9e60dbcdfc0"},"schema_version":"1.0","source":{"id":"2301.13738","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.13738","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"2301.13738v6","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13738","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"PBFR7QUREM4B","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"pith_short_16","alias_value":"PBFR7QUREM4BMRQ7","created_at":"2026-07-05T08:18:40Z"},{"alias_kind":"pith_short_8","alias_value":"PBFR7QUR","created_at":"2026-07-05T08:18:40Z"}],"graph_snapshots":[{"event_id":"sha256:0f7200d102c6ab12c80b2f9df564dbedaf1ca7b072b9fbca6d2b403463f02d4e","target":"graph","created_at":"2026-07-05T08:18:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.13738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes, and describe code surgery between such codes using a specific colimit in the category of chain complexes. As well as describing a surgery operation, this gives a general recipe for new codes. As an application we describe how to `merge' and `split' along a shared $\\overline{X}$ or $\\overline{Z}$ operator between arbitrary CSS codes in a fault-tolerant manner, so long as certain technical conditions concerning gauge fixing and code distance are satisfied. We prove that such merges and splits on LD","authors_text":"Alexander Cowtan, Simon Burton","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T16:17:25Z","title":"CSS code surgery as a universal construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13738","kind":"arxiv","version":6},"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:280bfbb3b9e5ce50039d4934c10a069ea2c736661aaca83f02abd3fa8f2028d6","target":"record","created_at":"2026-07-05T08:18:40Z","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":"b1a6d3933accc5b5c95a7d1a7ac593164b1e41577ac46265732a2d84ee6dfa8a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T16:17:25Z","title_canon_sha256":"b6ebdef09918a0e5a232da4960b7215d947c4c2ae518d413844fc9e60dbcdfc0"},"schema_version":"1.0","source":{"id":"2301.13738","kind":"arxiv","version":6}},"canonical_sha256":"784b1fc291233816461f28c4c1d4415e72a29931ae9c5068d84b52a037664e68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"784b1fc291233816461f28c4c1d4415e72a29931ae9c5068d84b52a037664e68","first_computed_at":"2026-07-05T08:18:40.407629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:18:40.407629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uJLRUr+xxaElEutv7Wq6naC5wP4dI+vHSxhBGJIyr4bZ7k2evcbIRYQecLSF9LiC54dk+DQeB4h9Bc8cJzGzBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:18:40.408109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.13738","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:280bfbb3b9e5ce50039d4934c10a069ea2c736661aaca83f02abd3fa8f2028d6","sha256:0f7200d102c6ab12c80b2f9df564dbedaf1ca7b072b9fbca6d2b403463f02d4e"],"state_sha256":"0f43d079ca9b58c5d948255629652ac6c2266200b4d1b9c89c4ebeb32ab73a30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLVZS5xStUT8ot/8jvPdNfRdZ3ILoU0bqyFx+saN8pxn4uJYsHfZFU82+NhiFpoocE2kCWIr4H7+Nfgw3XNhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T04:31:47.055936Z","bundle_sha256":"753415c6f38823ead34c6c6d500efb63870d111ab030dd148729c9398d33abe4"}}