{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QHNNKPR6AOSMDPNM3AHO4XXABX","short_pith_number":"pith:QHNNKPR6","canonical_record":{"source":{"id":"2510.08695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-09T18:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"30b5fbabe392cd807e29aab83a75ba618adf12dae524b77bf2b83cddb7bcd25b","abstract_canon_sha256":"a98366a854f60fbfb1268412d25a2c9a2a937f24356e3ebb391020d8eaf3a598"},"schema_version":"1.0"},"canonical_sha256":"81dad53e3e03a4c1bdacd80eee5ee00df31e901fcbfa39f3474b718b8270edd2","source":{"kind":"arxiv","id":"2510.08695","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.08695","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"2510.08695v2","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.08695","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"QHNNKPR6AOSM","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"pith_short_16","alias_value":"QHNNKPR6AOSMDPNM","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"pith_short_8","alias_value":"QHNNKPR6","created_at":"2026-07-09T01:19:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QHNNKPR6AOSMDPNM3AHO4XXABX","target":"record","payload":{"canonical_record":{"source":{"id":"2510.08695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-09T18:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"30b5fbabe392cd807e29aab83a75ba618adf12dae524b77bf2b83cddb7bcd25b","abstract_canon_sha256":"a98366a854f60fbfb1268412d25a2c9a2a937f24356e3ebb391020d8eaf3a598"},"schema_version":"1.0"},"canonical_sha256":"81dad53e3e03a4c1bdacd80eee5ee00df31e901fcbfa39f3474b718b8270edd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:19:38.010834Z","signature_b64":"hILg4KY8FxtMmVcRuGQ/ORkd+bYT8/2p+3Qkf5e0OQF2WzJJA0ELvGchalsLdQQpTvhC7xgPUQ6wKL0qpBfDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81dad53e3e03a4c1bdacd80eee5ee00df31e901fcbfa39f3474b718b8270edd2","last_reissued_at":"2026-07-09T01:19:38.010355Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:19:38.010355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.08695","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-09T01:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z71DjhsGw5nyzfOwamS6dQ5fE2gjXVHElgxFzELNJGBMmmxq9+1JmfrtuzGTQ4B37Cvsk7ZJAsF+HtZ8gxfXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:32:34.284848Z"},"content_sha256":"fa1e1f4964892e5eea60f1375dbc3eaa4ea164cf45127758f6d18cccd81a7adc","schema_version":"1.0","event_id":"sha256:fa1e1f4964892e5eea60f1375dbc3eaa4ea164cf45127758f6d18cccd81a7adc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QHNNKPR6AOSMDPNM3AHO4XXABX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hayata Yamasaki, Kento Tsubouchi, Shiro Tamiya","submitted_at":"2025-10-09T18:01:30Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation due to their potential for low-overhead protocols. A common approach to decoding qLDPC codes is to use the belief propagation (BP) decoder, followed by a post-processing step to enhance decoding accuracy. For fast decoding, the post-processing algorithm is desirable to have a small computational cost and rely only on local operations on the Tanner graph to facilitate parallel implementation. To address this requirement, we propose degeneracy cutting (DC), an efficient post-pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.08695","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/2510.08695/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-09T01:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+EJNZZUAVzo3DOLaH0TOTqWsgbPxEgamKMFURKmcCqE4u8G7BecTTGn81FmXMXOmSoenqjuvtbUjZGpY+XuvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:32:34.285372Z"},"content_sha256":"a0f33c18894d008602d942490acc1e926e1c622a1b80f88dd670bcf00c7108bb","schema_version":"1.0","event_id":"sha256:a0f33c18894d008602d942490acc1e926e1c622a1b80f88dd670bcf00c7108bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/bundle.json","state_url":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/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-05T10:32:34Z","links":{"resolver":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX","bundle":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/bundle.json","state":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QHNNKPR6AOSMDPNM3AHO4XXABX","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":"a98366a854f60fbfb1268412d25a2c9a2a937f24356e3ebb391020d8eaf3a598","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-09T18:01:30Z","title_canon_sha256":"30b5fbabe392cd807e29aab83a75ba618adf12dae524b77bf2b83cddb7bcd25b"},"schema_version":"1.0","source":{"id":"2510.08695","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.08695","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"2510.08695v2","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.08695","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"QHNNKPR6AOSM","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"pith_short_16","alias_value":"QHNNKPR6AOSMDPNM","created_at":"2026-07-09T01:19:38Z"},{"alias_kind":"pith_short_8","alias_value":"QHNNKPR6","created_at":"2026-07-09T01:19:38Z"}],"graph_snapshots":[{"event_id":"sha256:a0f33c18894d008602d942490acc1e926e1c622a1b80f88dd670bcf00c7108bb","target":"graph","created_at":"2026-07-09T01:19:38Z","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/2510.08695/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation due to their potential for low-overhead protocols. A common approach to decoding qLDPC codes is to use the belief propagation (BP) decoder, followed by a post-processing step to enhance decoding accuracy. For fast decoding, the post-processing algorithm is desirable to have a small computational cost and rely only on local operations on the Tanner graph to facilitate parallel implementation. To address this requirement, we propose degeneracy cutting (DC), an efficient post-pro","authors_text":"Hayata Yamasaki, Kento Tsubouchi, Shiro Tamiya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-09T18:01:30Z","title":"Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.08695","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:fa1e1f4964892e5eea60f1375dbc3eaa4ea164cf45127758f6d18cccd81a7adc","target":"record","created_at":"2026-07-09T01:19:38Z","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":"a98366a854f60fbfb1268412d25a2c9a2a937f24356e3ebb391020d8eaf3a598","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-09T18:01:30Z","title_canon_sha256":"30b5fbabe392cd807e29aab83a75ba618adf12dae524b77bf2b83cddb7bcd25b"},"schema_version":"1.0","source":{"id":"2510.08695","kind":"arxiv","version":2}},"canonical_sha256":"81dad53e3e03a4c1bdacd80eee5ee00df31e901fcbfa39f3474b718b8270edd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81dad53e3e03a4c1bdacd80eee5ee00df31e901fcbfa39f3474b718b8270edd2","first_computed_at":"2026-07-09T01:19:38.010355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:19:38.010355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hILg4KY8FxtMmVcRuGQ/ORkd+bYT8/2p+3Qkf5e0OQF2WzJJA0ELvGchalsLdQQpTvhC7xgPUQ6wKL0qpBfDBw==","signature_status":"signed_v1","signed_at":"2026-07-09T01:19:38.010834Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.08695","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa1e1f4964892e5eea60f1375dbc3eaa4ea164cf45127758f6d18cccd81a7adc","sha256:a0f33c18894d008602d942490acc1e926e1c622a1b80f88dd670bcf00c7108bb"],"state_sha256":"f80939f4b1eaeb4b322456ff4fbfe372a572b054d10f9790e0cdc73684543629"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUrg93D1kzUa2nshTqLE+5brkTC7eQ/dRmMLczicPDcVna9A1ClAJwQlsvJku5nE6f/oF+Zj4vsXYLIrt69HBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T10:32:34.289133Z","bundle_sha256":"c47426cb9c6f71f23e46188157d27daef339256226101a4fc5e18682ce6630d9"}}