{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2GTYELNXNUHLQBDVEVWNKIGKE5","short_pith_number":"pith:2GTYELNX","canonical_record":{"source":{"id":"2207.08826","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-18T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"758dea366dfe3e1d2d8133ec7725267b63f580843ebbb1c7234678ae8df55777","abstract_canon_sha256":"825cccaa9e4475f6b169f53135014430cfcb5de11f6f88224f1f43a7f6089b27"},"schema_version":"1.0"},"canonical_sha256":"d1a7822db76d0eb80475256cd520ca276ad2625c3cf1fa1d5e28a825a4378c3e","source":{"kind":"arxiv","id":"2207.08826","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.08826","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2207.08826v3","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08826","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"2GTYELNXNUHL","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"2GTYELNXNUHLQBDV","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"2GTYELNX","created_at":"2026-07-05T10:06:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2GTYELNXNUHLQBDVEVWNKIGKE5","target":"record","payload":{"canonical_record":{"source":{"id":"2207.08826","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-18T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"758dea366dfe3e1d2d8133ec7725267b63f580843ebbb1c7234678ae8df55777","abstract_canon_sha256":"825cccaa9e4475f6b169f53135014430cfcb5de11f6f88224f1f43a7f6089b27"},"schema_version":"1.0"},"canonical_sha256":"d1a7822db76d0eb80475256cd520ca276ad2625c3cf1fa1d5e28a825a4378c3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:00.561491Z","signature_b64":"7EOrDWddengqyaNJdsXI4iP1klUUd/+/mTjoJ9VgeBK2/nljmybSq/G/LY8rfMV0j0A/JNYxzEEVKXe96O9jDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1a7822db76d0eb80475256cd520ca276ad2625c3cf1fa1d5e28a825a4378c3e","last_reissued_at":"2026-07-05T10:06:00.560988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:00.560988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.08826","source_version":3,"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-05T10:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MkiyA2H+NR++ZJ6NPXMOKUt+YBUNDG0jhchGvtFTsfxdLOLzrLly/WsNvfRVuqhA1cng4BuoQ3rzK9ficdwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:46:42.290327Z"},"content_sha256":"ac8fc3d17ee6b33dc4f2ed26990de5d36920bdf48fe79f24c25378844e777e4f","schema_version":"1.0","event_id":"sha256:ac8fc3d17ee6b33dc4f2ed26990de5d36920bdf48fe79f24c25378844e777e4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2GTYELNXNUHLQBDVEVWNKIGKE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hayata Yamasaki, Masato Koashi","submitted_at":"2022-07-18T18:00:00Z","abstract_excerpt":"Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits for each logical qubit. A more recent protocol using quantum analogues of low-density parity-check codes needs only a constant space overhead that does not grow with the number of logical qubits. However, the overhead in the processing time required to implement this protocol grows polynomially with the number of computational steps. To address these problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.08826","kind":"arxiv","version":3},"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/2207.08826/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-05T10:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0DlF/8ErqpQ9lg2q2+H/AM6BKCMyNPLHih6HyZ+2NGZTvLAypcNzvDr5u8u3b8jKV2FYQc2HLF2cUF1r6LiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:46:42.290903Z"},"content_sha256":"fa5d24f2e3d0c00c61b14fbb34c78a716519db523bf61cfdb1bc38a38b56134c","schema_version":"1.0","event_id":"sha256:fa5d24f2e3d0c00c61b14fbb34c78a716519db523bf61cfdb1bc38a38b56134c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GTYELNXNUHLQBDVEVWNKIGKE5/bundle.json","state_url":"https://pith.science/pith/2GTYELNXNUHLQBDVEVWNKIGKE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GTYELNXNUHLQBDVEVWNKIGKE5/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-08T20:46:42Z","links":{"resolver":"https://pith.science/pith/2GTYELNXNUHLQBDVEVWNKIGKE5","bundle":"https://pith.science/pith/2GTYELNXNUHLQBDVEVWNKIGKE5/bundle.json","state":"https://pith.science/pith/2GTYELNXNUHLQBDVEVWNKIGKE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GTYELNXNUHLQBDVEVWNKIGKE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2GTYELNXNUHLQBDVEVWNKIGKE5","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":"825cccaa9e4475f6b169f53135014430cfcb5de11f6f88224f1f43a7f6089b27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-18T18:00:00Z","title_canon_sha256":"758dea366dfe3e1d2d8133ec7725267b63f580843ebbb1c7234678ae8df55777"},"schema_version":"1.0","source":{"id":"2207.08826","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.08826","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2207.08826v3","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08826","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"2GTYELNXNUHL","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"2GTYELNXNUHLQBDV","created_at":"2026-07-05T10:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"2GTYELNX","created_at":"2026-07-05T10:06:00Z"}],"graph_snapshots":[{"event_id":"sha256:fa5d24f2e3d0c00c61b14fbb34c78a716519db523bf61cfdb1bc38a38b56134c","target":"graph","created_at":"2026-07-05T10:06:00Z","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/2207.08826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits for each logical qubit. A more recent protocol using quantum analogues of low-density parity-check codes needs only a constant space overhead that does not grow with the number of logical qubits. However, the overhead in the processing time required to implement this protocol grows polynomially with the number of computational steps. To address these problems","authors_text":"Hayata Yamasaki, Masato Koashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-18T18:00:00Z","title":"Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.08826","kind":"arxiv","version":3},"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:ac8fc3d17ee6b33dc4f2ed26990de5d36920bdf48fe79f24c25378844e777e4f","target":"record","created_at":"2026-07-05T10:06:00Z","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":"825cccaa9e4475f6b169f53135014430cfcb5de11f6f88224f1f43a7f6089b27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-18T18:00:00Z","title_canon_sha256":"758dea366dfe3e1d2d8133ec7725267b63f580843ebbb1c7234678ae8df55777"},"schema_version":"1.0","source":{"id":"2207.08826","kind":"arxiv","version":3}},"canonical_sha256":"d1a7822db76d0eb80475256cd520ca276ad2625c3cf1fa1d5e28a825a4378c3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1a7822db76d0eb80475256cd520ca276ad2625c3cf1fa1d5e28a825a4378c3e","first_computed_at":"2026-07-05T10:06:00.560988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:06:00.560988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7EOrDWddengqyaNJdsXI4iP1klUUd/+/mTjoJ9VgeBK2/nljmybSq/G/LY8rfMV0j0A/JNYxzEEVKXe96O9jDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:06:00.561491Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.08826","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac8fc3d17ee6b33dc4f2ed26990de5d36920bdf48fe79f24c25378844e777e4f","sha256:fa5d24f2e3d0c00c61b14fbb34c78a716519db523bf61cfdb1bc38a38b56134c"],"state_sha256":"96e4b987e9e84cd9806838ddf070d48168c278a3fb0c30fc9a16f148bc643fd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9JCqN/YFbenasofP/CPJzvxMTiVgVwcABvwligFcons9Yvsj7/OHMX50VxAW9h1n3+/HzhJdgQ/LBBf2IT3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:46:42.294666Z","bundle_sha256":"45ddaf2f719144d2903201827e0a1d3028c32274e24745341324e3879769c39b"}}