{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:O64ZFIOSUKLBLOYGVZLBLY4Y3K","short_pith_number":"pith:O64ZFIOS","canonical_record":{"source":{"id":"1211.3828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T08:41:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e8392bdb288e9448f67ace4a160d2a909bd98e79721df3b09b4cbfee9d73bd3","abstract_canon_sha256":"261b9ac468ca53e654f6bbd66abc4f5cf9eee86e830372392e168a9c69044179"},"schema_version":"1.0"},"canonical_sha256":"77b992a1d2a29615bb06ae5615e398da9e3dcecadab38545a899872d2df56488","source":{"kind":"arxiv","id":"1211.3828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3828","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3828v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3828","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"O64ZFIOSUKLB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O64ZFIOSUKLBLOYG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O64ZFIOS","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:O64ZFIOSUKLBLOYGVZLBLY4Y3K","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T08:41:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e8392bdb288e9448f67ace4a160d2a909bd98e79721df3b09b4cbfee9d73bd3","abstract_canon_sha256":"261b9ac468ca53e654f6bbd66abc4f5cf9eee86e830372392e168a9c69044179"},"schema_version":"1.0"},"canonical_sha256":"77b992a1d2a29615bb06ae5615e398da9e3dcecadab38545a899872d2df56488","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.704138Z","signature_b64":"k2tMHcWemgeTaqT61lu3YKhI6VqydHWfSyNIHi1dCgcFC8wfBobu74DXWHZ09e/TazQXoRohgMQHfsVVlowoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77b992a1d2a29615bb06ae5615e398da9e3dcecadab38545a899872d2df56488","last_reissued_at":"2026-05-18T00:57:56.703612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.703612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3828","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-18T00:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nVj4pUdFvjixb7Ko46x/nFkJpNJb5grZZCAqI0S0gUZDsMAo3pBrldg3UWhYGpyZpXMuFNI3JpS2ZlBXIWa9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:42:02.155653Z"},"content_sha256":"eb0f133d7cd0845109b93ee2cd25959dd5283db0b9f1b1f0b1ef9a7e78754178","schema_version":"1.0","event_id":"sha256:eb0f133d7cd0845109b93ee2cd25959dd5283db0b9f1b1f0b1ef9a7e78754178"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:O64ZFIOSUKLBLOYGVZLBLY4Y3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong-Joon Shin, Hosung Park, Jong-Seon No, Seokbeom Hong","submitted_at":"2012-11-16T08:41:11Z","abstract_excerpt":"For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, a new construction method of high-rate regular QC LDPC codes with parity-check matrices consisting of a single row of circulants with the column-weight 3 or 4 is proposed based on special classes of cyclic difference families. The proposed QC LDPC codes can be constructe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3828","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-18T00:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQwN9ytefvtGAmFximmLtWTfee4KOyqc/nhjC+rNEQcD04hZg2IpxHAZqRdDnP2JO1BQCGMJ7Y391kuoCv4rDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:42:02.156393Z"},"content_sha256":"47da184a2b381d8c96c8cb7e6b5a541f3f242c68baca4a8f88084e41d174d879","schema_version":"1.0","event_id":"sha256:47da184a2b381d8c96c8cb7e6b5a541f3f242c68baca4a8f88084e41d174d879"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O64ZFIOSUKLBLOYGVZLBLY4Y3K/bundle.json","state_url":"https://pith.science/pith/O64ZFIOSUKLBLOYGVZLBLY4Y3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O64ZFIOSUKLBLOYGVZLBLY4Y3K/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-05-30T10:42:02Z","links":{"resolver":"https://pith.science/pith/O64ZFIOSUKLBLOYGVZLBLY4Y3K","bundle":"https://pith.science/pith/O64ZFIOSUKLBLOYGVZLBLY4Y3K/bundle.json","state":"https://pith.science/pith/O64ZFIOSUKLBLOYGVZLBLY4Y3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O64ZFIOSUKLBLOYGVZLBLY4Y3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:O64ZFIOSUKLBLOYGVZLBLY4Y3K","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":"261b9ac468ca53e654f6bbd66abc4f5cf9eee86e830372392e168a9c69044179","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T08:41:11Z","title_canon_sha256":"5e8392bdb288e9448f67ace4a160d2a909bd98e79721df3b09b4cbfee9d73bd3"},"schema_version":"1.0","source":{"id":"1211.3828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3828","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3828v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3828","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"O64ZFIOSUKLB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O64ZFIOSUKLBLOYG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O64ZFIOS","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:47da184a2b381d8c96c8cb7e6b5a541f3f242c68baca4a8f88084e41d174d879","target":"graph","created_at":"2026-05-18T00:57:56Z","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":"For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, a new construction method of high-rate regular QC LDPC codes with parity-check matrices consisting of a single row of circulants with the column-weight 3 or 4 is proposed based on special classes of cyclic difference families. The proposed QC LDPC codes can be constructe","authors_text":"Dong-Joon Shin, Hosung Park, Jong-Seon No, Seokbeom Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T08:41:11Z","title":"Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3828","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:eb0f133d7cd0845109b93ee2cd25959dd5283db0b9f1b1f0b1ef9a7e78754178","target":"record","created_at":"2026-05-18T00:57:56Z","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":"261b9ac468ca53e654f6bbd66abc4f5cf9eee86e830372392e168a9c69044179","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T08:41:11Z","title_canon_sha256":"5e8392bdb288e9448f67ace4a160d2a909bd98e79721df3b09b4cbfee9d73bd3"},"schema_version":"1.0","source":{"id":"1211.3828","kind":"arxiv","version":1}},"canonical_sha256":"77b992a1d2a29615bb06ae5615e398da9e3dcecadab38545a899872d2df56488","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77b992a1d2a29615bb06ae5615e398da9e3dcecadab38545a899872d2df56488","first_computed_at":"2026-05-18T00:57:56.703612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.703612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k2tMHcWemgeTaqT61lu3YKhI6VqydHWfSyNIHi1dCgcFC8wfBobu74DXWHZ09e/TazQXoRohgMQHfsVVlowoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.704138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb0f133d7cd0845109b93ee2cd25959dd5283db0b9f1b1f0b1ef9a7e78754178","sha256:47da184a2b381d8c96c8cb7e6b5a541f3f242c68baca4a8f88084e41d174d879"],"state_sha256":"2bcf9715bb4b7b99ce8ce14ad59b0b79d113d71aaa420ee4d5aab5b42ab376b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0zGkfeiEGYs+nI2r240Hio7J5eNwRPwAPtK9i46vg9MA33p2pQ4aoUQY6JcnUinOAsgBhe8OCfbZ+XLA7lsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:42:02.160494Z","bundle_sha256":"4b8a6e411771fa718d5913e1d73d9ec51def6ebe3b0cdce0906b513001a95708"}}