{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ATD5L22WDBNMZE5QL6WJMFNAUA","short_pith_number":"pith:ATD5L22W","schema_version":"1.0","canonical_sha256":"04c7d5eb56185acc93b05fac9615a0a0124b91cdcd209fe49a6b9a97ac331d1c","source":{"kind":"arxiv","id":"1102.3181","version":1},"attestation_state":"computed","paper":{"title":"Spatially Coupled Quasi-Cyclic Quantum LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Hideki Imai, Kenta Kasai, Kohichi Sakaniwa, Manabu Hagiwara","submitted_at":"2011-02-15T20:59:41Z","abstract_excerpt":"We face the following dilemma for designing low-density parity-check codes (LDPC) for quantum error correction. 1) The row weights of parity-check should be large: The minimum distances are bounded above by the minimum row weights of parity-check matrices of constituent classical codes. Small minimum distance tends to result in poor decoding performance at the error-floor region. 2) The row weights of parity-check matrices should not be large: The sum-product decoding performance at the water-fall region is degraded as the row weight increases. Recently, Kudekar et al. showed spatially-coupled"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1102.3181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:59:41Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"51baeb05e6620a1a62b2b269fb23b196bf849506d13bb4fcff52ea69d426dd96","abstract_canon_sha256":"1b46c9416447fe2bc0463238b3044bc3000f2b30f4d9f7bcfb3cf2e4e77a5254"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:38.277593Z","signature_b64":"0UFRPF85zohLSbhMKS582s14VtAxIltCw1g4O+uZRORxlJKtFSH7YeKb+WQs+cK+rrIjUX40nHBleFfuRItqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04c7d5eb56185acc93b05fac9615a0a0124b91cdcd209fe49a6b9a97ac331d1c","last_reissued_at":"2026-05-18T04:28:38.277180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:38.277180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially Coupled Quasi-Cyclic Quantum LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Hideki Imai, Kenta Kasai, Kohichi Sakaniwa, Manabu Hagiwara","submitted_at":"2011-02-15T20:59:41Z","abstract_excerpt":"We face the following dilemma for designing low-density parity-check codes (LDPC) for quantum error correction. 1) The row weights of parity-check should be large: The minimum distances are bounded above by the minimum row weights of parity-check matrices of constituent classical codes. Small minimum distance tends to result in poor decoding performance at the error-floor region. 2) The row weights of parity-check matrices should not be large: The sum-product decoding performance at the water-fall region is degraded as the row weight increases. Recently, Kudekar et al. showed spatially-coupled"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3181","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.3181","created_at":"2026-05-18T04:28:38.277239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3181v1","created_at":"2026-05-18T04:28:38.277239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3181","created_at":"2026-05-18T04:28:38.277239+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATD5L22WDBNM","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATD5L22WDBNMZE5Q","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATD5L22W","created_at":"2026-05-18T12:26:24.575870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA","json":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA.json","graph_json":"https://pith.science/api/pith-number/ATD5L22WDBNMZE5QL6WJMFNAUA/graph.json","events_json":"https://pith.science/api/pith-number/ATD5L22WDBNMZE5QL6WJMFNAUA/events.json","paper":"https://pith.science/paper/ATD5L22W"},"agent_actions":{"view_html":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA","download_json":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA.json","view_paper":"https://pith.science/paper/ATD5L22W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3181&json=true","fetch_graph":"https://pith.science/api/pith-number/ATD5L22WDBNMZE5QL6WJMFNAUA/graph.json","fetch_events":"https://pith.science/api/pith-number/ATD5L22WDBNMZE5QL6WJMFNAUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/action/storage_attestation","attest_author":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/action/author_attestation","sign_citation":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/action/citation_signature","submit_replication":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/action/replication_record"}},"created_at":"2026-05-18T04:28:38.277239+00:00","updated_at":"2026-05-18T04:28:38.277239+00:00"}