{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:Z2JVEHIUR6A5JUQJPVW4D3UTUW","short_pith_number":"pith:Z2JVEHIU","canonical_record":{"source":{"id":"2004.07935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-16T20:36:28Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"3f46481488a542f8685daef457aef207ac9a9c91ecd599002eae731e781f8d1e","abstract_canon_sha256":"f5121ba5fd68f85f3ccfa1986ccb5fc7dd23f8607f4a159daf5687f94e96a4d2"},"schema_version":"1.0"},"canonical_sha256":"ce93521d148f81d4d2097d6dc1ee93a5bd6ffeec6070b03edb19ec31b677e395","source":{"kind":"arxiv","id":"2004.07935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07935","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07935v1","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07935","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"Z2JVEHIUR6A5","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"pith_short_16","alias_value":"Z2JVEHIUR6A5JUQJ","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"pith_short_8","alias_value":"Z2JVEHIU","created_at":"2026-07-05T00:55:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:Z2JVEHIUR6A5JUQJPVW4D3UTUW","target":"record","payload":{"canonical_record":{"source":{"id":"2004.07935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-16T20:36:28Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"3f46481488a542f8685daef457aef207ac9a9c91ecd599002eae731e781f8d1e","abstract_canon_sha256":"f5121ba5fd68f85f3ccfa1986ccb5fc7dd23f8607f4a159daf5687f94e96a4d2"},"schema_version":"1.0"},"canonical_sha256":"ce93521d148f81d4d2097d6dc1ee93a5bd6ffeec6070b03edb19ec31b677e395","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:48.578516Z","signature_b64":"7nOKD1HQp5WQ3lL80q5Y8suBZRZmxflxfzDx7z/utXDVvB0sYVzShdr/dXmVxjkQtKdQntZaMq19H1RWMj07Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce93521d148f81d4d2097d6dc1ee93a5bd6ffeec6070b03edb19ec31b677e395","last_reissued_at":"2026-07-05T00:55:48.578168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:48.578168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.07935","source_version":1,"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-05T00:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rh+YDhqlmEjYHxU4zAmaNsrSpSQ/Y56iWuCu3Htrd16A3qL2LT78U/pnG8y9joALbDCZyKbSB9vtJLQup+VWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T09:58:57.711658Z"},"content_sha256":"bf4bb1f9347269b6e64ae58451d6b076a35eaf8b85bbf19561cc871817788987","schema_version":"1.0","event_id":"sha256:bf4bb1f9347269b6e64ae58451d6b076a35eaf8b85bbf19561cc871817788987"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:Z2JVEHIUR6A5JUQJPVW4D3UTUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decodable quantum LDPC codes beyond the $\\sqrt{n}$ distance barrier using high dimensional expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"quant-ph","authors_text":"Gilles Z\\'emor, Shai Evra, Tali Kaufman","submitted_at":"2020-04-16T20:36:28Z","abstract_excerpt":"Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in particular Ramanujan complexes. These naturally give rise to very unbalanced quantum error correcting codes that have a large $X$-distance but a much smaller $Z$-distance. However, together with a classical expander LDPC code and a tensoring method that generalises a construction of Hastings and also the Tillich-Zemor construction of quantum code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07935","kind":"arxiv","version":1},"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/2004.07935/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-05T00:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ymWzH/k1PARnmlSyJ1wXdrbeYrBTu96srgGNaYG/Fp4/yOpP+CFa6hNFDWTbg38sBbi7/sghTzbnv+xt89dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T09:58:57.712393Z"},"content_sha256":"c66d2f5386f54f7db6aa88692a291c1f043d1e2dff3acad87f37135fe61206c0","schema_version":"1.0","event_id":"sha256:c66d2f5386f54f7db6aa88692a291c1f043d1e2dff3acad87f37135fe61206c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2JVEHIUR6A5JUQJPVW4D3UTUW/bundle.json","state_url":"https://pith.science/pith/Z2JVEHIUR6A5JUQJPVW4D3UTUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2JVEHIUR6A5JUQJPVW4D3UTUW/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-22T09:58:57Z","links":{"resolver":"https://pith.science/pith/Z2JVEHIUR6A5JUQJPVW4D3UTUW","bundle":"https://pith.science/pith/Z2JVEHIUR6A5JUQJPVW4D3UTUW/bundle.json","state":"https://pith.science/pith/Z2JVEHIUR6A5JUQJPVW4D3UTUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2JVEHIUR6A5JUQJPVW4D3UTUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:Z2JVEHIUR6A5JUQJPVW4D3UTUW","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":"f5121ba5fd68f85f3ccfa1986ccb5fc7dd23f8607f4a159daf5687f94e96a4d2","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-16T20:36:28Z","title_canon_sha256":"3f46481488a542f8685daef457aef207ac9a9c91ecd599002eae731e781f8d1e"},"schema_version":"1.0","source":{"id":"2004.07935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07935","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07935v1","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07935","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"Z2JVEHIUR6A5","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"pith_short_16","alias_value":"Z2JVEHIUR6A5JUQJ","created_at":"2026-07-05T00:55:48Z"},{"alias_kind":"pith_short_8","alias_value":"Z2JVEHIU","created_at":"2026-07-05T00:55:48Z"}],"graph_snapshots":[{"event_id":"sha256:c66d2f5386f54f7db6aa88692a291c1f043d1e2dff3acad87f37135fe61206c0","target":"graph","created_at":"2026-07-05T00:55:48Z","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/2004.07935/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in particular Ramanujan complexes. These naturally give rise to very unbalanced quantum error correcting codes that have a large $X$-distance but a much smaller $Z$-distance. However, together with a classical expander LDPC code and a tensoring method that generalises a construction of Hastings and also the Tillich-Zemor construction of quantum code","authors_text":"Gilles Z\\'emor, Shai Evra, Tali Kaufman","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-16T20:36:28Z","title":"Decodable quantum LDPC codes beyond the $\\sqrt{n}$ distance barrier using high dimensional expanders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07935","kind":"arxiv","version":1},"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:bf4bb1f9347269b6e64ae58451d6b076a35eaf8b85bbf19561cc871817788987","target":"record","created_at":"2026-07-05T00:55:48Z","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":"f5121ba5fd68f85f3ccfa1986ccb5fc7dd23f8607f4a159daf5687f94e96a4d2","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-16T20:36:28Z","title_canon_sha256":"3f46481488a542f8685daef457aef207ac9a9c91ecd599002eae731e781f8d1e"},"schema_version":"1.0","source":{"id":"2004.07935","kind":"arxiv","version":1}},"canonical_sha256":"ce93521d148f81d4d2097d6dc1ee93a5bd6ffeec6070b03edb19ec31b677e395","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce93521d148f81d4d2097d6dc1ee93a5bd6ffeec6070b03edb19ec31b677e395","first_computed_at":"2026-07-05T00:55:48.578168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:55:48.578168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7nOKD1HQp5WQ3lL80q5Y8suBZRZmxflxfzDx7z/utXDVvB0sYVzShdr/dXmVxjkQtKdQntZaMq19H1RWMj07Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:55:48.578516Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.07935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf4bb1f9347269b6e64ae58451d6b076a35eaf8b85bbf19561cc871817788987","sha256:c66d2f5386f54f7db6aa88692a291c1f043d1e2dff3acad87f37135fe61206c0"],"state_sha256":"e8acd5f2e3dcd484a25c9cbf6abbcab25d37970d941c2202fc9d661b535546ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kplEo/iGMFI1CUT5QckoHm015/KwtKdy6J2I8APF6o+l3WPTp/KePnwwpT0x7W9Yg3U1rXq9uap795q8P3W7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T09:58:57.720947Z","bundle_sha256":"1b0b12014a689133e4cd0417dedb15b496086d54c43547633cf6f43fa7842772"}}