{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:Y5YGUV5U7HICLGISKASERCT37B","short_pith_number":"pith:Y5YGUV5U","canonical_record":{"source":{"id":"2310.17758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-26T19:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"4a8a9c30cfa84e0008ca10dfb504060ac516462ecdc3c080da6e73fa752d198b","abstract_canon_sha256":"f2752f99fa6eeddd73e3a42d1f9c26d41d89c345642a34503a686d9551bd9db2"},"schema_version":"1.0"},"canonical_sha256":"c7706a57b4f9d02599125024488a7bf87df4da6dc9fd722045ed5420ad0496ab","source":{"kind":"arxiv","id":"2310.17758","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.17758","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"2310.17758v2","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.17758","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"Y5YGUV5U7HIC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Y5YGUV5U7HICLGIS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Y5YGUV5U","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:Y5YGUV5U7HICLGISKASERCT37B","target":"record","payload":{"canonical_record":{"source":{"id":"2310.17758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-26T19:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"4a8a9c30cfa84e0008ca10dfb504060ac516462ecdc3c080da6e73fa752d198b","abstract_canon_sha256":"f2752f99fa6eeddd73e3a42d1f9c26d41d89c345642a34503a686d9551bd9db2"},"schema_version":"1.0"},"canonical_sha256":"c7706a57b4f9d02599125024488a7bf87df4da6dc9fd722045ed5420ad0496ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:39.804838Z","signature_b64":"6K8dsUT1SPU7DJDJvKLqJEGDhbORMcSH3KB2ZS7EtSdkaRYbJAhAnUJGS0L/QIFEmF/yxKOM7fVFvXmvAKHXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7706a57b4f9d02599125024488a7bf87df4da6dc9fd722045ed5420ad0496ab","last_reissued_at":"2026-05-18T02:44:39.804133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:39.804133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.17758","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-05-18T02:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"scbzmddzZGLRuezR99Lbzcr4gGq+aigZhqTOnH+TLmr794XeyU3jhJ3CBwJo+Vnpxj9kfJVUay7LWNJf+rduBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T18:50:42.179381Z"},"content_sha256":"fe889033afc341609e20e8e8c15d47fab962f3e04f563de0efcd89f529464261","schema_version":"1.0","event_id":"sha256:fe889033afc341609e20e8e8c15d47fab962f3e04f563de0efcd89f529464261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:Y5YGUV5U7HICLGISKASERCT37B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anqi Gong, Joseph M. Renes, Sebastian Cammerer","submitted_at":"2023-10-26T19:56:25Z","abstract_excerpt":"In this work, we propose a fully differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers. Both component decoders are defined over the same sparse decoding graph enabling a seamless integration and scalability to large codes. The core idea is to use the GNN component between consecutive BP runs, so that the knowledge from the previous BP run, if stuck in a local minima caused by trapping sets or short cycles in the decoding graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.17758","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":""},"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-18T02:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILC/KGfeukyyDlkRMwkIq2E8/PR/NZ0gLfTOijYqgHFTroTg+FmgMHECsJPn2tXOAGwoxv68lOCwSfK+744gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T18:50:42.180019Z"},"content_sha256":"9842aa8c050006b1ca043be7c39a73725198f83c0a9b307796cb7eb69db1509a","schema_version":"1.0","event_id":"sha256:9842aa8c050006b1ca043be7c39a73725198f83c0a9b307796cb7eb69db1509a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5YGUV5U7HICLGISKASERCT37B/bundle.json","state_url":"https://pith.science/pith/Y5YGUV5U7HICLGISKASERCT37B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5YGUV5U7HICLGISKASERCT37B/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-24T18:50:42Z","links":{"resolver":"https://pith.science/pith/Y5YGUV5U7HICLGISKASERCT37B","bundle":"https://pith.science/pith/Y5YGUV5U7HICLGISKASERCT37B/bundle.json","state":"https://pith.science/pith/Y5YGUV5U7HICLGISKASERCT37B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5YGUV5U7HICLGISKASERCT37B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:Y5YGUV5U7HICLGISKASERCT37B","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":"f2752f99fa6eeddd73e3a42d1f9c26d41d89c345642a34503a686d9551bd9db2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-26T19:56:25Z","title_canon_sha256":"4a8a9c30cfa84e0008ca10dfb504060ac516462ecdc3c080da6e73fa752d198b"},"schema_version":"1.0","source":{"id":"2310.17758","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.17758","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"2310.17758v2","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.17758","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"Y5YGUV5U7HIC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Y5YGUV5U7HICLGIS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Y5YGUV5U","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:9842aa8c050006b1ca043be7c39a73725198f83c0a9b307796cb7eb69db1509a","target":"graph","created_at":"2026-05-18T02:44:39Z","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"},"paper":{"abstract_excerpt":"In this work, we propose a fully differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers. Both component decoders are defined over the same sparse decoding graph enabling a seamless integration and scalability to large codes. The core idea is to use the GNN component between consecutive BP runs, so that the knowledge from the previous BP run, if stuck in a local minima caused by trapping sets or short cycles in the decoding graph","authors_text":"Anqi Gong, Joseph M. Renes, Sebastian Cammerer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-26T19:56:25Z","title":"Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.17758","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:fe889033afc341609e20e8e8c15d47fab962f3e04f563de0efcd89f529464261","target":"record","created_at":"2026-05-18T02:44:39Z","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":"f2752f99fa6eeddd73e3a42d1f9c26d41d89c345642a34503a686d9551bd9db2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-26T19:56:25Z","title_canon_sha256":"4a8a9c30cfa84e0008ca10dfb504060ac516462ecdc3c080da6e73fa752d198b"},"schema_version":"1.0","source":{"id":"2310.17758","kind":"arxiv","version":2}},"canonical_sha256":"c7706a57b4f9d02599125024488a7bf87df4da6dc9fd722045ed5420ad0496ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7706a57b4f9d02599125024488a7bf87df4da6dc9fd722045ed5420ad0496ab","first_computed_at":"2026-05-18T02:44:39.804133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:39.804133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6K8dsUT1SPU7DJDJvKLqJEGDhbORMcSH3KB2ZS7EtSdkaRYbJAhAnUJGS0L/QIFEmF/yxKOM7fVFvXmvAKHXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:39.804838Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.17758","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe889033afc341609e20e8e8c15d47fab962f3e04f563de0efcd89f529464261","sha256:9842aa8c050006b1ca043be7c39a73725198f83c0a9b307796cb7eb69db1509a"],"state_sha256":"8ecd21a190801232678f622fcf0af196b27ff2992be3d56a324464ff963183b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9KjnNQEcdJ5PPqFj5wrTjR9NQh//OorLRfGY70VSz9nJf/zKEL0Nk9DjY1uyLRqunZ636hcDcFl0BeXNF2pBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T18:50:42.183248Z","bundle_sha256":"bc67bbdffcb20159480d3010625fe0d69e46d602108626abf5aab0b64f36e676"}}