{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:7NZZ4EOIBXNMIDCVZWHJLNRU5L","short_pith_number":"pith:7NZZ4EOI","canonical_record":{"source":{"id":"2106.00765","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T20:03:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5ef7641c8101e82fd90bbe0d0e7b5db5d8da4ade605c4d6e8bfdc7cf297bb425","abstract_canon_sha256":"38d928160b85106286fe9f082e14c51920e8ee1071348f71781bada44b674c48"},"schema_version":"1.0"},"canonical_sha256":"fb739e11c80ddac40c55cd8e95b634eacde80f38290ac421ca9f76e18b13c804","source":{"kind":"arxiv","id":"2106.00765","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00765","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00765v4","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00765","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"7NZZ4EOIBXNM","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"pith_short_16","alias_value":"7NZZ4EOIBXNMIDCV","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"pith_short_8","alias_value":"7NZZ4EOI","created_at":"2026-07-05T04:24:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:7NZZ4EOIBXNMIDCVZWHJLNRU5L","target":"record","payload":{"canonical_record":{"source":{"id":"2106.00765","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T20:03:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5ef7641c8101e82fd90bbe0d0e7b5db5d8da4ade605c4d6e8bfdc7cf297bb425","abstract_canon_sha256":"38d928160b85106286fe9f082e14c51920e8ee1071348f71781bada44b674c48"},"schema_version":"1.0"},"canonical_sha256":"fb739e11c80ddac40c55cd8e95b634eacde80f38290ac421ca9f76e18b13c804","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:09.403493Z","signature_b64":"huLYoSrf5VXjfsasN2yBkafULH/wi7hOcljE/PqmPCqZuellwh1bxGcOldpCt/ys8DDBLg3K+USK55Jzf2IVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb739e11c80ddac40c55cd8e95b634eacde80f38290ac421ca9f76e18b13c804","last_reissued_at":"2026-07-05T04:24:09.403063Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:09.403063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.00765","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-07-05T04:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgRVjgaA08pIxlyRx2DSQq1NUHl9cxNuUJYDhnEuNDi3iHkFtogxCrUyvYjl4cJqRAp08Njn94d5vSufHd4ZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:18:27.834129Z"},"content_sha256":"1aa1aeca01865057a84c4b9c9c46ef52480e31d9bbfa8cc4a0620e7d37164b5c","schema_version":"1.0","event_id":"sha256:1aa1aeca01865057a84c4b9c9c46ef52480e31d9bbfa8cc4a0620e7d37164b5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:7NZZ4EOIBXNMIDCVZWHJLNRU5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity constrains quantum codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anirudh Krishna, Nou\\'edyn Baspin","submitted_at":"2021-06-01T20:03:16Z","abstract_excerpt":"Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of qubits. Constructing quantum LDPC codes is challenging. It is an open problem to understand if there exist good quantum LDPC codes, i.e. with constant rate and relative distance. Furthermore, techniques to perform fault-tolerant gates are poorly understood. We present a unified way to address these problems. Our main results are a) a bound on the distance, b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00765","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/2106.00765/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-05T04:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7SH+FeJruSLrtMVSsMz1IyqQUhwKon2uEy/5X+8AbLZpqZx8gRZgGwNxtKTZrqf7ejE2AwjnDSR0jTF6rwqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:18:27.834621Z"},"content_sha256":"6def1efb8b9763620a1db897ce4971287be993bd2293f8fe13f52fc9719ec81b","schema_version":"1.0","event_id":"sha256:6def1efb8b9763620a1db897ce4971287be993bd2293f8fe13f52fc9719ec81b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NZZ4EOIBXNMIDCVZWHJLNRU5L/bundle.json","state_url":"https://pith.science/pith/7NZZ4EOIBXNMIDCVZWHJLNRU5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NZZ4EOIBXNMIDCVZWHJLNRU5L/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-09T15:18:27Z","links":{"resolver":"https://pith.science/pith/7NZZ4EOIBXNMIDCVZWHJLNRU5L","bundle":"https://pith.science/pith/7NZZ4EOIBXNMIDCVZWHJLNRU5L/bundle.json","state":"https://pith.science/pith/7NZZ4EOIBXNMIDCVZWHJLNRU5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NZZ4EOIBXNMIDCVZWHJLNRU5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:7NZZ4EOIBXNMIDCVZWHJLNRU5L","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":"38d928160b85106286fe9f082e14c51920e8ee1071348f71781bada44b674c48","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T20:03:16Z","title_canon_sha256":"5ef7641c8101e82fd90bbe0d0e7b5db5d8da4ade605c4d6e8bfdc7cf297bb425"},"schema_version":"1.0","source":{"id":"2106.00765","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00765","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00765v4","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00765","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"7NZZ4EOIBXNM","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"pith_short_16","alias_value":"7NZZ4EOIBXNMIDCV","created_at":"2026-07-05T04:24:09Z"},{"alias_kind":"pith_short_8","alias_value":"7NZZ4EOI","created_at":"2026-07-05T04:24:09Z"}],"graph_snapshots":[{"event_id":"sha256:6def1efb8b9763620a1db897ce4971287be993bd2293f8fe13f52fc9719ec81b","target":"graph","created_at":"2026-07-05T04:24:09Z","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/2106.00765/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of qubits. Constructing quantum LDPC codes is challenging. It is an open problem to understand if there exist good quantum LDPC codes, i.e. with constant rate and relative distance. Furthermore, techniques to perform fault-tolerant gates are poorly understood. We present a unified way to address these problems. Our main results are a) a bound on the distance, b","authors_text":"Anirudh Krishna, Nou\\'edyn Baspin","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T20:03:16Z","title":"Connectivity constrains quantum codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00765","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:1aa1aeca01865057a84c4b9c9c46ef52480e31d9bbfa8cc4a0620e7d37164b5c","target":"record","created_at":"2026-07-05T04:24:09Z","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":"38d928160b85106286fe9f082e14c51920e8ee1071348f71781bada44b674c48","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T20:03:16Z","title_canon_sha256":"5ef7641c8101e82fd90bbe0d0e7b5db5d8da4ade605c4d6e8bfdc7cf297bb425"},"schema_version":"1.0","source":{"id":"2106.00765","kind":"arxiv","version":4}},"canonical_sha256":"fb739e11c80ddac40c55cd8e95b634eacde80f38290ac421ca9f76e18b13c804","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb739e11c80ddac40c55cd8e95b634eacde80f38290ac421ca9f76e18b13c804","first_computed_at":"2026-07-05T04:24:09.403063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:24:09.403063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"huLYoSrf5VXjfsasN2yBkafULH/wi7hOcljE/PqmPCqZuellwh1bxGcOldpCt/ys8DDBLg3K+USK55Jzf2IVCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:24:09.403493Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.00765","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aa1aeca01865057a84c4b9c9c46ef52480e31d9bbfa8cc4a0620e7d37164b5c","sha256:6def1efb8b9763620a1db897ce4971287be993bd2293f8fe13f52fc9719ec81b"],"state_sha256":"7736e6fe4839eb04d47a62e5fe1c20fe74be85959b5ea9e61094099fe8147f64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20ULXjX1k/YmYJnczRZ2060xDzYUXhbMPiToWkdi5t6s8EhR/Jq0/rh39sLlijrjhNzrrG8eaGeE0XKjXmFPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:18:27.838273Z","bundle_sha256":"b35c5d375f56e93220f3b25abb9346fb060aa8958d9b25d7304421efdeeeb8db"}}