{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SYJ7I3BOJ4TOJEIHTHJIOIMR7N","short_pith_number":"pith:SYJ7I3BO","canonical_record":{"source":{"id":"2412.21171","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-30T18:48:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ef9f7ebc0d2a93cbc97cdb44629a7d375f3a368e7118148a1a22d26f80a964c1","abstract_canon_sha256":"f82eae5e447ce4116ea22fc101cad931763864c423b1de517afbad43e909488f"},"schema_version":"1.0"},"canonical_sha256":"9613f46c2e4f26e4910799d2872191fb6b6213617ae0fdb6a751ff06d0d83198","source":{"kind":"arxiv","id":"2412.21171","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.21171","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"2412.21171v4","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.21171","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"SYJ7I3BOJ4TO","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"pith_short_16","alias_value":"SYJ7I3BOJ4TOJEIH","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"pith_short_8","alias_value":"SYJ7I3BO","created_at":"2026-05-26T01:03:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SYJ7I3BOJ4TOJEIHTHJIOIMR7N","target":"record","payload":{"canonical_record":{"source":{"id":"2412.21171","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-30T18:48:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ef9f7ebc0d2a93cbc97cdb44629a7d375f3a368e7118148a1a22d26f80a964c1","abstract_canon_sha256":"f82eae5e447ce4116ea22fc101cad931763864c423b1de517afbad43e909488f"},"schema_version":"1.0"},"canonical_sha256":"9613f46c2e4f26e4910799d2872191fb6b6213617ae0fdb6a751ff06d0d83198","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:10.444187Z","signature_b64":"+5yeBDg7QLFoSXhrVl2k5u+6w9wwQ7Hn3CIVjoS2MHyTk4axpPvClfO+e7wSur8J1bb5IaVdJlh8Tet/vE4EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9613f46c2e4f26e4910799d2872191fb6b6213617ae0fdb6a751ff06d0d83198","last_reissued_at":"2026-05-26T01:03:10.443238Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:10.443238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.21171","source_version":4,"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-26T01:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k23oD7LezCabvnK/Al0UT6SYC+GiOkh/S1DLECh4NicJvboUhrTyqvZjci/Yr3lgYB2doAfnmbX47hG23BeHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:21:09.055490Z"},"content_sha256":"5974f79839707b6557c3426324520278e5d5084679c42c6dbb8768086e339590","schema_version":"1.0","event_id":"sha256:5974f79839707b6557c3426324520278e5d5084679c42c6dbb8768086e339590"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SYJ7I3BOJ4TOJEIHTHJIOIMR7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Error Correction near the Coding Theoretical Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Daiki Komoto, Kenta Kasai","submitted_at":"2024-12-30T18:48:54Z","abstract_excerpt":"Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits, necessitating highly scalable quantum error correction. In classical information theory, low-density parity-check (LDPC) codes can approach channel capacity efficiently. Yet, no quantum error-correcting codes with efficient decoding have been shown to approach the hashing bound - a fundamental limit on quantum capacity - despite decades of research. Here, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.21171","kind":"arxiv","version":4},"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/2412.21171/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-05-26T01:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UlvDrxtBq1H7FPmUSJW6z628HCYnhlOL8V39LqrfPUHW4EoiLgiPjRndUXgQDork5RTsl8JP4LcNYsl7YxRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:21:09.056130Z"},"content_sha256":"479a28ef075b1b0d04ba88eb3b952e38802b296b255625d15e39b69e0e33ee93","schema_version":"1.0","event_id":"sha256:479a28ef075b1b0d04ba88eb3b952e38802b296b255625d15e39b69e0e33ee93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/bundle.json","state_url":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/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-31T10:21:09Z","links":{"resolver":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N","bundle":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/bundle.json","state":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SYJ7I3BOJ4TOJEIHTHJIOIMR7N","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":"f82eae5e447ce4116ea22fc101cad931763864c423b1de517afbad43e909488f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-30T18:48:54Z","title_canon_sha256":"ef9f7ebc0d2a93cbc97cdb44629a7d375f3a368e7118148a1a22d26f80a964c1"},"schema_version":"1.0","source":{"id":"2412.21171","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.21171","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"2412.21171v4","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.21171","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"SYJ7I3BOJ4TO","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"pith_short_16","alias_value":"SYJ7I3BOJ4TOJEIH","created_at":"2026-05-26T01:03:10Z"},{"alias_kind":"pith_short_8","alias_value":"SYJ7I3BO","created_at":"2026-05-26T01:03:10Z"}],"graph_snapshots":[{"event_id":"sha256:479a28ef075b1b0d04ba88eb3b952e38802b296b255625d15e39b69e0e33ee93","target":"graph","created_at":"2026-05-26T01:03:10Z","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/2412.21171/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits, necessitating highly scalable quantum error correction. In classical information theory, low-density parity-check (LDPC) codes can approach channel capacity efficiently. Yet, no quantum error-correcting codes with efficient decoding have been shown to approach the hashing bound - a fundamental limit on quantum capacity - despite decades of research. Here, we","authors_text":"Daiki Komoto, Kenta Kasai","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-30T18:48:54Z","title":"Quantum Error Correction near the Coding Theoretical Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.21171","kind":"arxiv","version":4},"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:5974f79839707b6557c3426324520278e5d5084679c42c6dbb8768086e339590","target":"record","created_at":"2026-05-26T01:03:10Z","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":"f82eae5e447ce4116ea22fc101cad931763864c423b1de517afbad43e909488f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-30T18:48:54Z","title_canon_sha256":"ef9f7ebc0d2a93cbc97cdb44629a7d375f3a368e7118148a1a22d26f80a964c1"},"schema_version":"1.0","source":{"id":"2412.21171","kind":"arxiv","version":4}},"canonical_sha256":"9613f46c2e4f26e4910799d2872191fb6b6213617ae0fdb6a751ff06d0d83198","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9613f46c2e4f26e4910799d2872191fb6b6213617ae0fdb6a751ff06d0d83198","first_computed_at":"2026-05-26T01:03:10.443238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:10.443238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+5yeBDg7QLFoSXhrVl2k5u+6w9wwQ7Hn3CIVjoS2MHyTk4axpPvClfO+e7wSur8J1bb5IaVdJlh8Tet/vE4EBw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:10.444187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.21171","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5974f79839707b6557c3426324520278e5d5084679c42c6dbb8768086e339590","sha256:479a28ef075b1b0d04ba88eb3b952e38802b296b255625d15e39b69e0e33ee93"],"state_sha256":"c435ae9c6969a108a0263f567e6ba79fd10234c04001d3bd2a341bdb5ac652c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yI9h1iI0+s811Kndv3FzPOOpyn6PjyGrsIQUJtdVZ4ILi5Qk367jCF2Z/FYazFtV2JJQQMudd8MCVJfFld+vDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:21:09.060108Z","bundle_sha256":"ce3a2660758985ca6515b2387fb5af0f72522c09531d3545693e16b90318cd12"}}