{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:XMA7BYTWPNADCJUEJM44OPEVGG","short_pith_number":"pith:XMA7BYTW","canonical_record":{"source":{"id":"2308.13377","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-25T13:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"1017a5c71b3900cfe55d2c64cdb5d50cd1dd6516d40c0681207d335650ec853a","abstract_canon_sha256":"8542f92b231c8a02d1fe2a36234c7e4fc1e09214b4ba52bdb195aa4a4d189882"},"schema_version":"1.0"},"canonical_sha256":"bb01f0e2767b403126844b39c73c9531a51663dc99628de99913844032330ae5","source":{"kind":"arxiv","id":"2308.13377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13377","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13377v1","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13377","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"XMA7BYTWPNAD","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"pith_short_16","alias_value":"XMA7BYTWPNADCJUE","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"pith_short_8","alias_value":"XMA7BYTW","created_at":"2026-07-05T06:44:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:XMA7BYTWPNADCJUEJM44OPEVGG","target":"record","payload":{"canonical_record":{"source":{"id":"2308.13377","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-25T13:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"1017a5c71b3900cfe55d2c64cdb5d50cd1dd6516d40c0681207d335650ec853a","abstract_canon_sha256":"8542f92b231c8a02d1fe2a36234c7e4fc1e09214b4ba52bdb195aa4a4d189882"},"schema_version":"1.0"},"canonical_sha256":"bb01f0e2767b403126844b39c73c9531a51663dc99628de99913844032330ae5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:42.991023Z","signature_b64":"LvABpgIERc6hu+D0PbefKrbAucFpsgL7XQhlnK7VwLFoWQAbCcRyMeb7BK7X2VWkVhOyeb6G/hj67xqN/W8yCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb01f0e2767b403126844b39c73c9531a51663dc99628de99913844032330ae5","last_reissued_at":"2026-07-05T06:44:42.990528Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:42.990528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.13377","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-05T06:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMMtnaxb4iQ37v3VO6sIfABUdRX3mf1GWV4tKyw01XFQMytCiOSsgTslYcZdoSJXBbZXTJ3JAug79Cj7ANk1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:15:28.665303Z"},"content_sha256":"a63734db2828d58ed44fda40f6863c609ac046468debde0567e3963b2bac9d53","schema_version":"1.0","event_id":"sha256:a63734db2828d58ed44fda40f6863c609ac046468debde0567e3963b2bac9d53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:XMA7BYTWPNADCJUEJM44OPEVGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Layered Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francisco Garcia-Herrero, Javier Valls, Julien du Crest, Mehdi Mhalla, Valentin Savin","submitted_at":"2023-08-25T13:37:56Z","abstract_excerpt":"We address the problem of performing message-passing-based decoding of quantum LDPC codes under hardware latency limitations. We propose a novel way to do layered decoding that suits quantum constraints and outperforms flooded scheduling, the usual scheduling on parallel architectures. A generic construction is given to construct layers of hypergraph product codes. In the process, we introduce two new notions, t-covering layers which is a generalization of the usual layer decomposition, and a new scheduling called random order scheduling. Numerical simulations show that the random ordering is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13377","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/2308.13377/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-05T06:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4YNoalfxr6ogVf8dNGKpnwfXqPeo5nK2YVKfLUcfIT4H0awGXM+KWZBSoDuld4mnpIPeSkT/HweV10Vo7YOuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:15:28.665732Z"},"content_sha256":"87636ade22bab59995d202d8debad4c34e08ee73942f5af539b45beee1cc560e","schema_version":"1.0","event_id":"sha256:87636ade22bab59995d202d8debad4c34e08ee73942f5af539b45beee1cc560e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/bundle.json","state_url":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMA7BYTWPNADCJUEJM44OPEVGG/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-12T23:15:28Z","links":{"resolver":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG","bundle":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/bundle.json","state":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMA7BYTWPNADCJUEJM44OPEVGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XMA7BYTWPNADCJUEJM44OPEVGG","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":"8542f92b231c8a02d1fe2a36234c7e4fc1e09214b4ba52bdb195aa4a4d189882","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-25T13:37:56Z","title_canon_sha256":"1017a5c71b3900cfe55d2c64cdb5d50cd1dd6516d40c0681207d335650ec853a"},"schema_version":"1.0","source":{"id":"2308.13377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13377","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13377v1","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13377","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"XMA7BYTWPNAD","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"pith_short_16","alias_value":"XMA7BYTWPNADCJUE","created_at":"2026-07-05T06:44:42Z"},{"alias_kind":"pith_short_8","alias_value":"XMA7BYTW","created_at":"2026-07-05T06:44:42Z"}],"graph_snapshots":[{"event_id":"sha256:87636ade22bab59995d202d8debad4c34e08ee73942f5af539b45beee1cc560e","target":"graph","created_at":"2026-07-05T06:44:42Z","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/2308.13377/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the problem of performing message-passing-based decoding of quantum LDPC codes under hardware latency limitations. We propose a novel way to do layered decoding that suits quantum constraints and outperforms flooded scheduling, the usual scheduling on parallel architectures. A generic construction is given to construct layers of hypergraph product codes. In the process, we introduce two new notions, t-covering layers which is a generalization of the usual layer decomposition, and a new scheduling called random order scheduling. Numerical simulations show that the random ordering is ","authors_text":"Francisco Garcia-Herrero, Javier Valls, Julien du Crest, Mehdi Mhalla, Valentin Savin","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-25T13:37:56Z","title":"Layered Decoding of Quantum LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13377","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:a63734db2828d58ed44fda40f6863c609ac046468debde0567e3963b2bac9d53","target":"record","created_at":"2026-07-05T06:44:42Z","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":"8542f92b231c8a02d1fe2a36234c7e4fc1e09214b4ba52bdb195aa4a4d189882","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-25T13:37:56Z","title_canon_sha256":"1017a5c71b3900cfe55d2c64cdb5d50cd1dd6516d40c0681207d335650ec853a"},"schema_version":"1.0","source":{"id":"2308.13377","kind":"arxiv","version":1}},"canonical_sha256":"bb01f0e2767b403126844b39c73c9531a51663dc99628de99913844032330ae5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb01f0e2767b403126844b39c73c9531a51663dc99628de99913844032330ae5","first_computed_at":"2026-07-05T06:44:42.990528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:44:42.990528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LvABpgIERc6hu+D0PbefKrbAucFpsgL7XQhlnK7VwLFoWQAbCcRyMeb7BK7X2VWkVhOyeb6G/hj67xqN/W8yCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:44:42.991023Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.13377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a63734db2828d58ed44fda40f6863c609ac046468debde0567e3963b2bac9d53","sha256:87636ade22bab59995d202d8debad4c34e08ee73942f5af539b45beee1cc560e"],"state_sha256":"0170e05df7bf34d1999b9c7885cb504a1e455c81cfbee05aa8a33eff37c60698"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pj36CugNNFtm8AnaV2jy4mC9pY05cxuVgQAzVsoAE6ZreBrOHevXF+WpVbO/UBC12FbSyo60H4MWQBe3uf35Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:15:28.668288Z","bundle_sha256":"0e2c3098d50a56b20adbdf5a2137d315e3a73f30d903494b7c92fbb13745d534"}}