{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:AFHZ6TFFTNWGMQ6AHVQVJANGFM","short_pith_number":"pith:AFHZ6TFF","canonical_record":{"source":{"id":"quant-ph/0701020","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-01-05T10:36:46Z","cross_cats_sorted":["cs.IT","math-ph","math.CO","math.IT","math.MP"],"title_canon_sha256":"1c3f9959ce4aeb5c3b734455545d9c82d667f4b16f92ce03f2d6b73dca029dc2","abstract_canon_sha256":"9691b7949755378d624f77f12cf592204c5199e182b8ceaa5cfa96b9a3f8a848"},"schema_version":"1.0"},"canonical_sha256":"014f9f4ca59b6c6643c03d615481a62b0fa8be084e5a81c19f00794f6d5f6df0","source":{"kind":"arxiv","id":"quant-ph/0701020","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0701020","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0701020v4","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0701020","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"pith_short_12","alias_value":"AFHZ6TFFTNWG","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"AFHZ6TFFTNWGMQ6A","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"AFHZ6TFF","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:AFHZ6TFFTNWGMQ6AHVQVJANGFM","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0701020","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-01-05T10:36:46Z","cross_cats_sorted":["cs.IT","math-ph","math.CO","math.IT","math.MP"],"title_canon_sha256":"1c3f9959ce4aeb5c3b734455545d9c82d667f4b16f92ce03f2d6b73dca029dc2","abstract_canon_sha256":"9691b7949755378d624f77f12cf592204c5199e182b8ceaa5cfa96b9a3f8a848"},"schema_version":"1.0"},"canonical_sha256":"014f9f4ca59b6c6643c03d615481a62b0fa8be084e5a81c19f00794f6d5f6df0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:44.652593Z","signature_b64":"gVyjHVS6XTrL0kMAvcbZ5Kqx5zV/36WKoXt2+AnfIubEp188nC1dQBVmgCKEEG6HppEsoQJYCG8uVaBcxtSvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"014f9f4ca59b6c6643c03d615481a62b0fa8be084e5a81c19f00794f6d5f6df0","last_reissued_at":"2026-05-18T00:57:44.652116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:44.652116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0701020","source_version":4,"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-18T00:57:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVae34U+KMvHsYkpIUxeFOuaihSy+qQWFFWbTjvikoVmNFYWshASj4IJORPOoBBy1dpCwalz6YQE0bbdugV7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:11:39.582918Z"},"content_sha256":"2494a4a16306dc3458017dac345b6290e41cb9fc22946557f935a753c048c986","schema_version":"1.0","event_id":"sha256:2494a4a16306dc3458017dac345b6290e41cb9fc22946557f935a753c048c986"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:AFHZ6TFFTNWGMQ6AHVQVJANGFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Quasi-Cyclic LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.CO","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Hideki Imai, Manabu Hagiwara","submitted_at":"2007-01-05T10:36:46Z","abstract_excerpt":"In this paper, a construction of a pair of \"regular\" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our proposed codes have lots of variations for length, code rate. These codes are obtained by a descrete mathematical characterization for model matrices of quasi-cyclic LDPC codes.\n  Our proposed codes achieve a bounded distance decoding (BDD) bound, or known as VG bound, and achieve a lower bound of the code length."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0701020","kind":"arxiv","version":4},"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-18T00:57:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19DnRoVoUcHNKVZxms9LMA1R/RPdKxo14laJiHa3NWM7XcNpOBdf0YRIdnfAsZ/3enx8ZwxVhm2dzqn7Ry3qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:11:39.583268Z"},"content_sha256":"be959b8351c2df0359b5d12faf83d44da15ebb85da397fd61a58ca89481267a1","schema_version":"1.0","event_id":"sha256:be959b8351c2df0359b5d12faf83d44da15ebb85da397fd61a58ca89481267a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFHZ6TFFTNWGMQ6AHVQVJANGFM/bundle.json","state_url":"https://pith.science/pith/AFHZ6TFFTNWGMQ6AHVQVJANGFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFHZ6TFFTNWGMQ6AHVQVJANGFM/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-22T15:11:39Z","links":{"resolver":"https://pith.science/pith/AFHZ6TFFTNWGMQ6AHVQVJANGFM","bundle":"https://pith.science/pith/AFHZ6TFFTNWGMQ6AHVQVJANGFM/bundle.json","state":"https://pith.science/pith/AFHZ6TFFTNWGMQ6AHVQVJANGFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFHZ6TFFTNWGMQ6AHVQVJANGFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:AFHZ6TFFTNWGMQ6AHVQVJANGFM","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":"9691b7949755378d624f77f12cf592204c5199e182b8ceaa5cfa96b9a3f8a848","cross_cats_sorted":["cs.IT","math-ph","math.CO","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-01-05T10:36:46Z","title_canon_sha256":"1c3f9959ce4aeb5c3b734455545d9c82d667f4b16f92ce03f2d6b73dca029dc2"},"schema_version":"1.0","source":{"id":"quant-ph/0701020","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0701020","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0701020v4","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0701020","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"pith_short_12","alias_value":"AFHZ6TFFTNWG","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"AFHZ6TFFTNWGMQ6A","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"AFHZ6TFF","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:be959b8351c2df0359b5d12faf83d44da15ebb85da397fd61a58ca89481267a1","target":"graph","created_at":"2026-05-18T00:57:44Z","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 paper, a construction of a pair of \"regular\" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our proposed codes have lots of variations for length, code rate. These codes are obtained by a descrete mathematical characterization for model matrices of quasi-cyclic LDPC codes.\n  Our proposed codes achieve a bounded distance decoding (BDD) bound, or known as VG bound, and achieve a lower bound of the code length.","authors_text":"Hideki Imai, Manabu Hagiwara","cross_cats":["cs.IT","math-ph","math.CO","math.IT","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-01-05T10:36:46Z","title":"Quantum Quasi-Cyclic LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0701020","kind":"arxiv","version":4},"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:2494a4a16306dc3458017dac345b6290e41cb9fc22946557f935a753c048c986","target":"record","created_at":"2026-05-18T00:57:44Z","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":"9691b7949755378d624f77f12cf592204c5199e182b8ceaa5cfa96b9a3f8a848","cross_cats_sorted":["cs.IT","math-ph","math.CO","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-01-05T10:36:46Z","title_canon_sha256":"1c3f9959ce4aeb5c3b734455545d9c82d667f4b16f92ce03f2d6b73dca029dc2"},"schema_version":"1.0","source":{"id":"quant-ph/0701020","kind":"arxiv","version":4}},"canonical_sha256":"014f9f4ca59b6c6643c03d615481a62b0fa8be084e5a81c19f00794f6d5f6df0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"014f9f4ca59b6c6643c03d615481a62b0fa8be084e5a81c19f00794f6d5f6df0","first_computed_at":"2026-05-18T00:57:44.652116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:44.652116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gVyjHVS6XTrL0kMAvcbZ5Kqx5zV/36WKoXt2+AnfIubEp188nC1dQBVmgCKEEG6HppEsoQJYCG8uVaBcxtSvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:44.652593Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0701020","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2494a4a16306dc3458017dac345b6290e41cb9fc22946557f935a753c048c986","sha256:be959b8351c2df0359b5d12faf83d44da15ebb85da397fd61a58ca89481267a1"],"state_sha256":"6208f3a804ffe199f90bc35167735bb5edc95d76eebf97cbf24719b1786946a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEmJgVRG5fBYH8Qex/qGkclFnKRiTET3st59H8icR8aUonaae/d3dC7f8QAvJTnz9469hRkFrQ90J4WvqzcoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T15:11:39.585356Z","bundle_sha256":"db9170b9af6b7df2665ebef65b3db43a3896b5d2f87c6c2c22643367dc7ccbe5"}}