{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:D7GNQ5NH2XRHQU53AQBI7WH66X","short_pith_number":"pith:D7GNQ5NH","canonical_record":{"source":{"id":"2605.03631","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-05T11:00:37Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"950a77f48fcac8ad95e699e684b2c1f06b62f07cd1187c426efa5cf177373125","abstract_canon_sha256":"34de695985eb0b0d251c9705560bef2293619e0400977a1bf639f9314b541abe"},"schema_version":"1.0"},"canonical_sha256":"1fccd875a7d5e27853bb04028fd8fef5d72cbd1a957e49d7e4b71d2f1d41feb7","source":{"kind":"arxiv","id":"2605.03631","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03631","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03631v3","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03631","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"pith_short_12","alias_value":"D7GNQ5NH2XRH","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"pith_short_16","alias_value":"D7GNQ5NH2XRHQU53","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"pith_short_8","alias_value":"D7GNQ5NH","created_at":"2026-07-23T01:24:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:D7GNQ5NH2XRHQU53AQBI7WH66X","target":"record","payload":{"canonical_record":{"source":{"id":"2605.03631","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-05T11:00:37Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"950a77f48fcac8ad95e699e684b2c1f06b62f07cd1187c426efa5cf177373125","abstract_canon_sha256":"34de695985eb0b0d251c9705560bef2293619e0400977a1bf639f9314b541abe"},"schema_version":"1.0"},"canonical_sha256":"1fccd875a7d5e27853bb04028fd8fef5d72cbd1a957e49d7e4b71d2f1d41feb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:29.146679Z","signature_b64":"tVIDru9N6/yBjC0ngBMBihnpJ3Us0toXESi6NfkBhSAoS2saVdz5J8eI3/pzyHcC9HGcdxlJRWg/4ZV8exM+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fccd875a7d5e27853bb04028fd8fef5d72cbd1a957e49d7e4b71d2f1d41feb7","last_reissued_at":"2026-07-23T01:24:29.145763Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:29.145763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.03631","source_version":3,"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-23T01:24:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZDtTwlIY1hY+xPgLrDFBNqE+yHN7ss1g4I8CVkClrwTiNtysYLuEICYx1BzV/oRFLLwNPKNnkOGA8RoEUESMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T19:54:08.860749Z"},"content_sha256":"64c3717d6b5134b26348fc875eddf7e64aa7c5da6442d5a9fe381634f918f411","schema_version":"1.0","event_id":"sha256:64c3717d6b5134b26348fc875eddf7e64aa7c5da6442d5a9fe381634f918f411"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:D7GNQ5NH2XRHQU53AQBI7WH66X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Quasi-dyadic matrices produce quantum DC CSS LDPC codes with improved finite-length error rates.","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Alessio Baldelli, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Paolo Santini","submitted_at":"2026-05-05T11:00:37Z","abstract_excerpt":"Quantum error correcting codes are essential to achieve fault-tolerant quantum computation. This work introduces two constructions of high-rate, dual-containing (DC) Calderbank--Shor--Steane low-density parity-check (LDPC) codes based on quasi-dyadic matrices. We characterize the automorphism group of such codes, investigate their minimum distance behavior, and provide several theoretical results on their cycle properties. Monte Carlo simulations under depolarizing and phenomenological noise show better finite-length logical error rates than the considered DC benchmark codes and competitive pe"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The quantum CSS LDPC codes obtained through these constructions achieve better finite-length error rate performance than existing DC codes across different block lengths and code rates.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The quasi-dyadic matrix constructions produce valid dual-containing CSS codes whose cycle properties, minimum distances, and simulated error rates hold under the noise models used in the numerical experiments.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices achieve improved finite-length error performance over existing DC codes.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Quasi-dyadic matrices produce quantum DC CSS LDPC codes with improved finite-length error rates.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b6458c0ac7887b84f60a0a94f9b6d3de8f0880b90a7f76cc2ef660760fc3d42e"},"source":{"id":"2605.03631","kind":"arxiv","version":3},"verdict":{"id":"d4ddc402-2272-47bb-8f0d-16e2bde63242","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T07:29:40.127052Z","strongest_claim":"The quantum CSS LDPC codes obtained through these constructions achieve better finite-length error rate performance than existing DC codes across different block lengths and code rates.","one_line_summary":"Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices achieve improved finite-length error performance over existing DC codes.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The quasi-dyadic matrix constructions produce valid dual-containing CSS codes whose cycle properties, minimum distances, and simulated error rates hold under the noise models used in the numerical experiments.","pith_extraction_headline":"Quasi-dyadic matrices produce quantum DC CSS LDPC codes with improved finite-length error rates."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03631/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T13:37:19.779513Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T00:31:21.857964Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:11:43.442165Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e9c3b73291f3888fac2fb2804830a04ee6ca30114a7a4948827aaaee8e40ba0d"},"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":"d4ddc402-2272-47bb-8f0d-16e2bde63242"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-23T01:24:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/rUurMbMTnV55qs3A7x0Zg28Pv7KJLgXFge7PJrtMJ+Orp9X5VkxBqnWcpNWLeXFaJvluQODzA7jEj6fJK6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T19:54:08.861767Z"},"content_sha256":"25aa225c5f8d71b53150349cc202117395c2e6a04d0eb0dddf342ca3033a39ef","schema_version":"1.0","event_id":"sha256:25aa225c5f8d71b53150349cc202117395c2e6a04d0eb0dddf342ca3033a39ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7GNQ5NH2XRHQU53AQBI7WH66X/bundle.json","state_url":"https://pith.science/pith/D7GNQ5NH2XRHQU53AQBI7WH66X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7GNQ5NH2XRHQU53AQBI7WH66X/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-13T19:54:08Z","links":{"resolver":"https://pith.science/pith/D7GNQ5NH2XRHQU53AQBI7WH66X","bundle":"https://pith.science/pith/D7GNQ5NH2XRHQU53AQBI7WH66X/bundle.json","state":"https://pith.science/pith/D7GNQ5NH2XRHQU53AQBI7WH66X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7GNQ5NH2XRHQU53AQBI7WH66X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:D7GNQ5NH2XRHQU53AQBI7WH66X","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":"34de695985eb0b0d251c9705560bef2293619e0400977a1bf639f9314b541abe","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-05T11:00:37Z","title_canon_sha256":"950a77f48fcac8ad95e699e684b2c1f06b62f07cd1187c426efa5cf177373125"},"schema_version":"1.0","source":{"id":"2605.03631","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03631","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03631v3","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03631","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"pith_short_12","alias_value":"D7GNQ5NH2XRH","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"pith_short_16","alias_value":"D7GNQ5NH2XRHQU53","created_at":"2026-07-23T01:24:29Z"},{"alias_kind":"pith_short_8","alias_value":"D7GNQ5NH","created_at":"2026-07-23T01:24:29Z"}],"graph_snapshots":[{"event_id":"sha256:25aa225c5f8d71b53150349cc202117395c2e6a04d0eb0dddf342ca3033a39ef","target":"graph","created_at":"2026-07-23T01:24:29Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The quantum CSS LDPC codes obtained through these constructions achieve better finite-length error rate performance than existing DC codes across different block lengths and code rates."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The quasi-dyadic matrix constructions produce valid dual-containing CSS codes whose cycle properties, minimum distances, and simulated error rates hold under the noise models used in the numerical experiments."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices achieve improved finite-length error performance over existing DC codes."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Quasi-dyadic matrices produce quantum DC CSS LDPC codes with improved finite-length error rates."}],"snapshot_sha256":"b6458c0ac7887b84f60a0a94f9b6d3de8f0880b90a7f76cc2ef660760fc3d42e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T13:37:19.779513Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:31:21.857964Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:11:43.442165Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.03631/integrity.json","findings":[],"snapshot_sha256":"e9c3b73291f3888fac2fb2804830a04ee6ca30114a7a4948827aaaee8e40ba0d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum error correcting codes are essential to achieve fault-tolerant quantum computation. This work introduces two constructions of high-rate, dual-containing (DC) Calderbank--Shor--Steane low-density parity-check (LDPC) codes based on quasi-dyadic matrices. We characterize the automorphism group of such codes, investigate their minimum distance behavior, and provide several theoretical results on their cycle properties. Monte Carlo simulations under depolarizing and phenomenological noise show better finite-length logical error rates than the considered DC benchmark codes and competitive pe","authors_text":"Alessio Baldelli, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Paolo Santini","cross_cats":["math.IT","quant-ph"],"headline":"Quasi-dyadic matrices produce quantum DC CSS LDPC codes with improved finite-length error rates.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-05T11:00:37Z","title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03631","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-13T07:29:40.127052Z","id":"d4ddc402-2272-47bb-8f0d-16e2bde63242","model_set":{"reader":"grok-4.3"},"one_line_summary":"Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices achieve improved finite-length error performance over existing DC codes.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Quasi-dyadic matrices produce quantum DC CSS LDPC codes with improved finite-length error rates.","strongest_claim":"The quantum CSS LDPC codes obtained through these constructions achieve better finite-length error rate performance than existing DC codes across different block lengths and code rates.","weakest_assumption":"The quasi-dyadic matrix constructions produce valid dual-containing CSS codes whose cycle properties, minimum distances, and simulated error rates hold under the noise models used in the numerical experiments."}},"verdict_id":"d4ddc402-2272-47bb-8f0d-16e2bde63242"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:64c3717d6b5134b26348fc875eddf7e64aa7c5da6442d5a9fe381634f918f411","target":"record","created_at":"2026-07-23T01:24:29Z","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":"34de695985eb0b0d251c9705560bef2293619e0400977a1bf639f9314b541abe","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-05T11:00:37Z","title_canon_sha256":"950a77f48fcac8ad95e699e684b2c1f06b62f07cd1187c426efa5cf177373125"},"schema_version":"1.0","source":{"id":"2605.03631","kind":"arxiv","version":3}},"canonical_sha256":"1fccd875a7d5e27853bb04028fd8fef5d72cbd1a957e49d7e4b71d2f1d41feb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fccd875a7d5e27853bb04028fd8fef5d72cbd1a957e49d7e4b71d2f1d41feb7","first_computed_at":"2026-07-23T01:24:29.145763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T01:24:29.145763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVIDru9N6/yBjC0ngBMBihnpJ3Us0toXESi6NfkBhSAoS2saVdz5J8eI3/pzyHcC9HGcdxlJRWg/4ZV8exM+BQ==","signature_status":"signed_v1","signed_at":"2026-07-23T01:24:29.146679Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03631","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64c3717d6b5134b26348fc875eddf7e64aa7c5da6442d5a9fe381634f918f411","sha256:25aa225c5f8d71b53150349cc202117395c2e6a04d0eb0dddf342ca3033a39ef"],"state_sha256":"7b8cc8203d64206f5475c75729cc155e5e2523bddda18b70b19ed2bd615b77e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7D4LUoUkFktS5rdGSCQ0l3Z1JIvP+4sqkJ4kU3W43iZkYpkVBZi6seBqzNW2X73RJW/UAe6o1ME/3dIOokVfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T19:54:08.869373Z","bundle_sha256":"8b20466d31f5e61090ffa7bc16e3cf83b02055ec96ef552a15696c2505a7528f"}}