{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FKD32HESOLXJJSOHLUWLCFPJSD","short_pith_number":"pith:FKD32HES","canonical_record":{"source":{"id":"1710.00389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-01T18:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"630b01c45ef193a4ecd3f3803eda232a588aeb46e1a0d4f07760bc0ed95ae011","abstract_canon_sha256":"de563b8df5d735b0f5ef51dc73cf3338510fbfc9fd74ec2583f6a3233c3fb8ec"},"schema_version":"1.0"},"canonical_sha256":"2a87bd1c9272ee94c9c75d2cb115e990e8f4117f8de4ea91a511116214154597","source":{"kind":"arxiv","id":"1710.00389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00389","created_at":"2026-05-18T00:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00389v2","created_at":"2026-05-18T00:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00389","created_at":"2026-05-18T00:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"FKD32HESOLXJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKD32HESOLXJJSOH","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKD32HES","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FKD32HESOLXJJSOHLUWLCFPJSD","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-01T18:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"630b01c45ef193a4ecd3f3803eda232a588aeb46e1a0d4f07760bc0ed95ae011","abstract_canon_sha256":"de563b8df5d735b0f5ef51dc73cf3338510fbfc9fd74ec2583f6a3233c3fb8ec"},"schema_version":"1.0"},"canonical_sha256":"2a87bd1c9272ee94c9c75d2cb115e990e8f4117f8de4ea91a511116214154597","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:24.274499Z","signature_b64":"HBCoocBoX5qROIcV1DPJQrbhfAXuCLtLuOZY+AEnTYeTS1ViY46ZtjGDjWEq5qS3By3MFfbgsSKhQjEsO/gzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a87bd1c9272ee94c9c75d2cb115e990e8f4117f8de4ea91a511116214154597","last_reissued_at":"2026-05-18T00:20:24.274043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:24.274043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00389","source_version":2,"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-18T00:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oR5NT6Zk83pVehSl1b4qxb+4zZOMFcKd5bL4p2HP2AKJyvwKNLnK/0vk1Ev6pSdHQKplJrwr3M1MwloidK+cAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:03:26.162761Z"},"content_sha256":"369f5f8bfae8ec7614155fce69243acf28df4fd8637a0a796794b1b7638b5e92","schema_version":"1.0","event_id":"sha256:369f5f8bfae8ec7614155fce69243acf28df4fd8637a0a796794b1b7638b5e92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FKD32HESOLXJJSOHLUWLCFPJSD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ching-Yi Lai, Todd A. Brun, Yi-Cong Zheng","submitted_at":"2017-10-01T18:47:41Z","abstract_excerpt":"Fault-tolerant quantum computation (FTQC) schemes that use multi-qubit large block codes can potentially reduce the resource overhead to a great extent. A major obstacle is the requirement of a large number of clean ancilla states of different types without correlated errors inside each block. These ancilla states are usually logical stabilizer states of the data code blocks, which are generally difficult to prepare if the code size is large. Previously we have proposed an ancilla distillation protocol for Calderbank-Shor-Steane (CSS) codes by classical error-correcting codes. It was assumed t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00389","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"},"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-18T00:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87ppmRhSaCPvicOeCUWWiMBI0f0OUlp0XIm0jQsIMVtruEqarehbQTWLHVyh+GkQilYpof8xrPo5So7/5IKcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:03:26.163278Z"},"content_sha256":"d9fe4289a093cae3e057dc68650bbfe9f346718badd234021a9b0adefa465a02","schema_version":"1.0","event_id":"sha256:d9fe4289a093cae3e057dc68650bbfe9f346718badd234021a9b0adefa465a02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKD32HESOLXJJSOHLUWLCFPJSD/bundle.json","state_url":"https://pith.science/pith/FKD32HESOLXJJSOHLUWLCFPJSD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKD32HESOLXJJSOHLUWLCFPJSD/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-05-26T16:03:26Z","links":{"resolver":"https://pith.science/pith/FKD32HESOLXJJSOHLUWLCFPJSD","bundle":"https://pith.science/pith/FKD32HESOLXJJSOHLUWLCFPJSD/bundle.json","state":"https://pith.science/pith/FKD32HESOLXJJSOHLUWLCFPJSD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKD32HESOLXJJSOHLUWLCFPJSD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FKD32HESOLXJJSOHLUWLCFPJSD","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":"de563b8df5d735b0f5ef51dc73cf3338510fbfc9fd74ec2583f6a3233c3fb8ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-01T18:47:41Z","title_canon_sha256":"630b01c45ef193a4ecd3f3803eda232a588aeb46e1a0d4f07760bc0ed95ae011"},"schema_version":"1.0","source":{"id":"1710.00389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00389","created_at":"2026-05-18T00:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00389v2","created_at":"2026-05-18T00:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00389","created_at":"2026-05-18T00:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"FKD32HESOLXJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKD32HESOLXJJSOH","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKD32HES","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:d9fe4289a093cae3e057dc68650bbfe9f346718badd234021a9b0adefa465a02","target":"graph","created_at":"2026-05-18T00:20:24Z","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":"Fault-tolerant quantum computation (FTQC) schemes that use multi-qubit large block codes can potentially reduce the resource overhead to a great extent. A major obstacle is the requirement of a large number of clean ancilla states of different types without correlated errors inside each block. These ancilla states are usually logical stabilizer states of the data code blocks, which are generally difficult to prepare if the code size is large. Previously we have proposed an ancilla distillation protocol for Calderbank-Shor-Steane (CSS) codes by classical error-correcting codes. It was assumed t","authors_text":"Ching-Yi Lai, Todd A. Brun, Yi-Cong Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-01T18:47:41Z","title":"Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00389","kind":"arxiv","version":2},"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:369f5f8bfae8ec7614155fce69243acf28df4fd8637a0a796794b1b7638b5e92","target":"record","created_at":"2026-05-18T00:20:24Z","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":"de563b8df5d735b0f5ef51dc73cf3338510fbfc9fd74ec2583f6a3233c3fb8ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-01T18:47:41Z","title_canon_sha256":"630b01c45ef193a4ecd3f3803eda232a588aeb46e1a0d4f07760bc0ed95ae011"},"schema_version":"1.0","source":{"id":"1710.00389","kind":"arxiv","version":2}},"canonical_sha256":"2a87bd1c9272ee94c9c75d2cb115e990e8f4117f8de4ea91a511116214154597","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a87bd1c9272ee94c9c75d2cb115e990e8f4117f8de4ea91a511116214154597","first_computed_at":"2026-05-18T00:20:24.274043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:24.274043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HBCoocBoX5qROIcV1DPJQrbhfAXuCLtLuOZY+AEnTYeTS1ViY46ZtjGDjWEq5qS3By3MFfbgsSKhQjEsO/gzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:24.274499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:369f5f8bfae8ec7614155fce69243acf28df4fd8637a0a796794b1b7638b5e92","sha256:d9fe4289a093cae3e057dc68650bbfe9f346718badd234021a9b0adefa465a02"],"state_sha256":"b523a1c1abc106c6d6db941339ede58d822ba1e67fbd213ef97c4961cff15618"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41rZmkmf43NYw9kcx5d0e2sW7fj3VcxmpZUu+E79SMgUFRckrLJVmS32oS7XlJipMUt+yX8FmCY2IkrVF0t5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:03:26.166773Z","bundle_sha256":"3587b5bc2eeea85e069d93761357eb6dfacda7237e961a0a3917d8c16ad650db"}}