{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:XEU7GSGCJ5YGXP3NT36KYESGID","short_pith_number":"pith:XEU7GSGC","canonical_record":{"source":{"id":"2303.04798","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-08T18:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"f66868305a88f1375ceab77f696e185ae6d8eef9cacf615632021db6278fa064","abstract_canon_sha256":"b2e56d6e219969f4e9c354e5627f08b4a7988e05dce48120bb0a68cbd37ad982"},"schema_version":"1.0"},"canonical_sha256":"b929f348c24f706bbf6d9efcac124640e0956d1c8b0885752ee85f31ecce9c9d","source":{"kind":"arxiv","id":"2303.04798","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.04798","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"2303.04798v2","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.04798","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"XEU7GSGCJ5YG","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"pith_short_16","alias_value":"XEU7GSGCJ5YGXP3N","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"pith_short_8","alias_value":"XEU7GSGC","created_at":"2026-07-05T10:58:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:XEU7GSGCJ5YGXP3NT36KYESGID","target":"record","payload":{"canonical_record":{"source":{"id":"2303.04798","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-08T18:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"f66868305a88f1375ceab77f696e185ae6d8eef9cacf615632021db6278fa064","abstract_canon_sha256":"b2e56d6e219969f4e9c354e5627f08b4a7988e05dce48120bb0a68cbd37ad982"},"schema_version":"1.0"},"canonical_sha256":"b929f348c24f706bbf6d9efcac124640e0956d1c8b0885752ee85f31ecce9c9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:57.693895Z","signature_b64":"+dq2B9Tfb9sJ16DmTLgd3OuTx48LfSjbNQT4n1m3aHgTtljnj6lnSZBDcqHGSQohUO5G50MKH5d9mSK7KjZSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b929f348c24f706bbf6d9efcac124640e0956d1c8b0885752ee85f31ecce9c9d","last_reissued_at":"2026-07-05T10:58:57.693398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:57.693398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.04798","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-07-05T10:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bF/krNdNiJEDC2t/sfpDUfswnoTm7ZAYmF9+DPd3LY9ucZdYZm3KCRO6PONSO/rpr5Qsej9KN0navasJiRyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:46:44.635975Z"},"content_sha256":"b45211f038a42e729dd7bd405d4b436d806ebeeaa980b1489f7bd029cd4e1bca","schema_version":"1.0","event_id":"sha256:b45211f038a42e729dd7bd405d4b436d806ebeeaa980b1489f7bd029cd4e1bca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:XEU7GSGCJ5YGXP3NT36KYESGID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical memories: Simulating quantum LDPC codes with local gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anirudh Krishna, Christopher A. Pattison, John Preskill","submitted_at":"2023-03-08T18:48:12Z","abstract_excerpt":"Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of $[[N,K,D]]$ codes, referred to as hierarchical codes, that encode a number of logical qubits $K = \\Omega(N/\\log(N)^2)$. The N-th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code; nearest-neighbor gates in two dimensions are sufficient t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.04798","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.04798/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:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osgSu1Bm/gzxPom9gq/4peRLSHFJ5bcsAZvwz+qJCrD0LerFDiZHrFzSNmS5+qR2KButEjqESdACvq+sIuFUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:46:44.636542Z"},"content_sha256":"9e8ddb2700c4bf7afa1e6605c8027b9f85807c1ebfadf8e3d681ae57a044f899","schema_version":"1.0","event_id":"sha256:9e8ddb2700c4bf7afa1e6605c8027b9f85807c1ebfadf8e3d681ae57a044f899"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEU7GSGCJ5YGXP3NT36KYESGID/bundle.json","state_url":"https://pith.science/pith/XEU7GSGCJ5YGXP3NT36KYESGID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEU7GSGCJ5YGXP3NT36KYESGID/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-07T16:46:44Z","links":{"resolver":"https://pith.science/pith/XEU7GSGCJ5YGXP3NT36KYESGID","bundle":"https://pith.science/pith/XEU7GSGCJ5YGXP3NT36KYESGID/bundle.json","state":"https://pith.science/pith/XEU7GSGCJ5YGXP3NT36KYESGID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEU7GSGCJ5YGXP3NT36KYESGID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XEU7GSGCJ5YGXP3NT36KYESGID","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":"b2e56d6e219969f4e9c354e5627f08b4a7988e05dce48120bb0a68cbd37ad982","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-08T18:48:12Z","title_canon_sha256":"f66868305a88f1375ceab77f696e185ae6d8eef9cacf615632021db6278fa064"},"schema_version":"1.0","source":{"id":"2303.04798","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.04798","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"2303.04798v2","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.04798","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"XEU7GSGCJ5YG","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"pith_short_16","alias_value":"XEU7GSGCJ5YGXP3N","created_at":"2026-07-05T10:58:57Z"},{"alias_kind":"pith_short_8","alias_value":"XEU7GSGC","created_at":"2026-07-05T10:58:57Z"}],"graph_snapshots":[{"event_id":"sha256:9e8ddb2700c4bf7afa1e6605c8027b9f85807c1ebfadf8e3d681ae57a044f899","target":"graph","created_at":"2026-07-05T10:58:57Z","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/2303.04798/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of $[[N,K,D]]$ codes, referred to as hierarchical codes, that encode a number of logical qubits $K = \\Omega(N/\\log(N)^2)$. The N-th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code; nearest-neighbor gates in two dimensions are sufficient t","authors_text":"Anirudh Krishna, Christopher A. Pattison, John Preskill","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-08T18:48:12Z","title":"Hierarchical memories: Simulating quantum LDPC codes with local gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.04798","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:b45211f038a42e729dd7bd405d4b436d806ebeeaa980b1489f7bd029cd4e1bca","target":"record","created_at":"2026-07-05T10:58:57Z","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":"b2e56d6e219969f4e9c354e5627f08b4a7988e05dce48120bb0a68cbd37ad982","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-08T18:48:12Z","title_canon_sha256":"f66868305a88f1375ceab77f696e185ae6d8eef9cacf615632021db6278fa064"},"schema_version":"1.0","source":{"id":"2303.04798","kind":"arxiv","version":2}},"canonical_sha256":"b929f348c24f706bbf6d9efcac124640e0956d1c8b0885752ee85f31ecce9c9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b929f348c24f706bbf6d9efcac124640e0956d1c8b0885752ee85f31ecce9c9d","first_computed_at":"2026-07-05T10:58:57.693398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:58:57.693398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+dq2B9Tfb9sJ16DmTLgd3OuTx48LfSjbNQT4n1m3aHgTtljnj6lnSZBDcqHGSQohUO5G50MKH5d9mSK7KjZSBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:58:57.693895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.04798","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b45211f038a42e729dd7bd405d4b436d806ebeeaa980b1489f7bd029cd4e1bca","sha256:9e8ddb2700c4bf7afa1e6605c8027b9f85807c1ebfadf8e3d681ae57a044f899"],"state_sha256":"adae021d6aa077b3af897a9e4ddea7019d89b1fe40ae05da575f6d7fcb210ac6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cw8/ri1V+cN1nMW4xPYMRxs342oHfXN7qXqsgNW+p+EsnXNpyHfRxpRQoB6kzFB2VJ6Yg+uV9DTBgdKyUorfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T16:46:44.640947Z","bundle_sha256":"9731b73cb92a38be27bb7127f7833f58ce754ff68386babfe0dee95c93afe2da"}}