{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ATD5L22WDBNMZE5QL6WJMFNAUA","short_pith_number":"pith:ATD5L22W","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"},"canonical_sha256":"04c7d5eb56185acc93b05fac9615a0a0124b91cdcd209fe49a6b9a97ac331d1c","source":{"kind":"arxiv","id":"1102.3181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3181","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3181v1","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3181","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"ATD5L22WDBNM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ATD5L22WDBNMZE5Q","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ATD5L22W","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ATD5L22WDBNMZE5QL6WJMFNAUA","target":"record","payload":{"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"},"canonical_sha256":"04c7d5eb56185acc93b05fac9615a0a0124b91cdcd209fe49a6b9a97ac331d1c","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"},"source_kind":"arxiv","source_id":"1102.3181","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-05-18T04:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MN/wFu04HZ0aYdeFDr1VVPiYnXF1omymKGU0Yoog/MPJJ23k8ljatr0wBQ2WaL9aELJmMhtutEtkY/nZCI8KCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:56:16.502734Z"},"content_sha256":"4f45ac3d60ecbb651550c0ed6670775af8a4ca7ee44a92ce556aa58ccf4329f3","schema_version":"1.0","event_id":"sha256:4f45ac3d60ecbb651550c0ed6670775af8a4ca7ee44a92ce556aa58ccf4329f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ATD5L22WDBNMZE5QL6WJMFNAUA","target":"graph","payload":{"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"},"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-18T04:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DAjJor6oQdl2wdG6mkuWl+fk8X6cg1Rt7mZvXZ/nWoI4+zxc8gPiUAzke3lFl5WrHisLS5UKM48KgyqLoCBpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:56:16.503076Z"},"content_sha256":"9be66b95af244fd605bf8f1ff1248da028f2f5951be26fb8793e29314db4e25b","schema_version":"1.0","event_id":"sha256:9be66b95af244fd605bf8f1ff1248da028f2f5951be26fb8793e29314db4e25b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/bundle.json","state_url":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/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-06-22T22:56:16Z","links":{"resolver":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA","bundle":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/bundle.json","state":"https://pith.science/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATD5L22WDBNMZE5QL6WJMFNAUA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ATD5L22WDBNMZE5QL6WJMFNAUA","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":"1b46c9416447fe2bc0463238b3044bc3000f2b30f4d9f7bcfb3cf2e4e77a5254","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:59:41Z","title_canon_sha256":"51baeb05e6620a1a62b2b269fb23b196bf849506d13bb4fcff52ea69d426dd96"},"schema_version":"1.0","source":{"id":"1102.3181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3181","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3181v1","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3181","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"ATD5L22WDBNM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ATD5L22WDBNMZE5Q","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ATD5L22W","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:9be66b95af244fd605bf8f1ff1248da028f2f5951be26fb8793e29314db4e25b","target":"graph","created_at":"2026-05-18T04:28: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"},"paper":{"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","authors_text":"Hideki Imai, Kenta Kasai, Kohichi Sakaniwa, Manabu Hagiwara","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:59:41Z","title":"Spatially Coupled Quasi-Cyclic Quantum LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3181","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:4f45ac3d60ecbb651550c0ed6670775af8a4ca7ee44a92ce556aa58ccf4329f3","target":"record","created_at":"2026-05-18T04:28: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":"1b46c9416447fe2bc0463238b3044bc3000f2b30f4d9f7bcfb3cf2e4e77a5254","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:59:41Z","title_canon_sha256":"51baeb05e6620a1a62b2b269fb23b196bf849506d13bb4fcff52ea69d426dd96"},"schema_version":"1.0","source":{"id":"1102.3181","kind":"arxiv","version":1}},"canonical_sha256":"04c7d5eb56185acc93b05fac9615a0a0124b91cdcd209fe49a6b9a97ac331d1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04c7d5eb56185acc93b05fac9615a0a0124b91cdcd209fe49a6b9a97ac331d1c","first_computed_at":"2026-05-18T04:28:38.277180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:38.277180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0UFRPF85zohLSbhMKS582s14VtAxIltCw1g4O+uZRORxlJKtFSH7YeKb+WQs+cK+rrIjUX40nHBleFfuRItqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:38.277593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f45ac3d60ecbb651550c0ed6670775af8a4ca7ee44a92ce556aa58ccf4329f3","sha256:9be66b95af244fd605bf8f1ff1248da028f2f5951be26fb8793e29314db4e25b"],"state_sha256":"8bcbe74320f00c7d18e12d1b279de79bf9aa829dcaead37c9395bef05d67f8e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLGDS8tozgSHQSkdVVghoKp4GfpTdQwD3wi9hX5Tbe5xcwY7QXAsnIsIFZVUY64gytxkqCBDPZX835mw6lv9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:56:16.504971Z","bundle_sha256":"8d7fe2294a1fdc2347b2d3959fc68d40acc06a6c99dd3b49d09a6018c4e5e52c"}}