{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3GACHIQ2H75MGAIYTG7OS7GKFY","short_pith_number":"pith:3GACHIQ2","canonical_record":{"source":{"id":"1202.0702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T13:49:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a5b03e342dd5b70db5b5069748ed8a5271664568f377ed20b9721e72ab43efe","abstract_canon_sha256":"73df3eeac4ce7843fbd52906397ad13bb03a58ef167861509284986e73b757bf"},"schema_version":"1.0"},"canonical_sha256":"d98023a21a3ffac3011899bee97cca2e2d1545ae4084795fcb62d19137b565e6","source":{"kind":"arxiv","id":"1202.0702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0702","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0702v1","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0702","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"3GACHIQ2H75M","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GACHIQ2H75MGAIY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GACHIQ2","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3GACHIQ2H75MGAIYTG7OS7GKFY","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T13:49:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a5b03e342dd5b70db5b5069748ed8a5271664568f377ed20b9721e72ab43efe","abstract_canon_sha256":"73df3eeac4ce7843fbd52906397ad13bb03a58ef167861509284986e73b757bf"},"schema_version":"1.0"},"canonical_sha256":"d98023a21a3ffac3011899bee97cca2e2d1545ae4084795fcb62d19137b565e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:08.191857Z","signature_b64":"WHUmhj26IieVMl1A3VkG1Op0+hI8bh1vgAoQ0QS94sqeafwoSB5cgUo21rwGoXXkAW23dPsdnDzXSJFe1+MyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98023a21a3ffac3011899bee97cca2e2d1545ae4084795fcb62d19137b565e6","last_reissued_at":"2026-05-18T04:03:08.191159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:08.191159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0702","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:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxF7HOttDavE7miFZCv6npaD1qssTNSG2s4Rw6+cLG7vf7x50jKTYdrM8bbUXYi5G5er5o/tIl4YPQC+22WDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:04:01.259856Z"},"content_sha256":"7025b4250333c672ed48970baa159f883ca49a650d2666bc5ef6ecea7fbef52d","schema_version":"1.0","event_id":"sha256:7025b4250333c672ed48970baa159f883ca49a650d2666bc5ef6ecea7fbef52d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3GACHIQ2H75MGAIYTG7OS7GKFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keke Liu, Qin Huang, Zulin Wang","submitted_at":"2012-02-03T13:49:35Z","abstract_excerpt":"This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we derive tight upper bounds on rank and row-redundancy for general array of circulants, which make it possible to consider row-redundancy in constructions of QC-LDPC codes to achieve better performance. We further investigate the rank of two types of construction of QC-LDPC codes: constructions based on Vandermonde Matrices and Latin Squares and g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0702","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:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8jUIc8QOeE+5aDgm9Gb+EvvkykgyenHMbX+SzAhB06VCFIeNHoHOv+eeJ4Kjf/G9UzNmjmmSFrOnRWvSi5wMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:04:01.260202Z"},"content_sha256":"0b93df997865fc18d9b76e91c488053fd52ae1085ccac107d999779904c0c5ed","schema_version":"1.0","event_id":"sha256:0b93df997865fc18d9b76e91c488053fd52ae1085ccac107d999779904c0c5ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/bundle.json","state_url":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/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-02T02:04:01Z","links":{"resolver":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY","bundle":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/bundle.json","state":"https://pith.science/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GACHIQ2H75MGAIYTG7OS7GKFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3GACHIQ2H75MGAIYTG7OS7GKFY","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":"73df3eeac4ce7843fbd52906397ad13bb03a58ef167861509284986e73b757bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T13:49:35Z","title_canon_sha256":"9a5b03e342dd5b70db5b5069748ed8a5271664568f377ed20b9721e72ab43efe"},"schema_version":"1.0","source":{"id":"1202.0702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0702","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0702v1","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0702","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"3GACHIQ2H75M","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GACHIQ2H75MGAIY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GACHIQ2","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:0b93df997865fc18d9b76e91c488053fd52ae1085ccac107d999779904c0c5ed","target":"graph","created_at":"2026-05-18T04:03:08Z","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":"This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we derive tight upper bounds on rank and row-redundancy for general array of circulants, which make it possible to consider row-redundancy in constructions of QC-LDPC codes to achieve better performance. We further investigate the rank of two types of construction of QC-LDPC codes: constructions based on Vandermonde Matrices and Latin Squares and g","authors_text":"Keke Liu, Qin Huang, Zulin Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T13:49:35Z","title":"Low-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0702","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:7025b4250333c672ed48970baa159f883ca49a650d2666bc5ef6ecea7fbef52d","target":"record","created_at":"2026-05-18T04:03:08Z","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":"73df3eeac4ce7843fbd52906397ad13bb03a58ef167861509284986e73b757bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T13:49:35Z","title_canon_sha256":"9a5b03e342dd5b70db5b5069748ed8a5271664568f377ed20b9721e72ab43efe"},"schema_version":"1.0","source":{"id":"1202.0702","kind":"arxiv","version":1}},"canonical_sha256":"d98023a21a3ffac3011899bee97cca2e2d1545ae4084795fcb62d19137b565e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d98023a21a3ffac3011899bee97cca2e2d1545ae4084795fcb62d19137b565e6","first_computed_at":"2026-05-18T04:03:08.191159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:08.191159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WHUmhj26IieVMl1A3VkG1Op0+hI8bh1vgAoQ0QS94sqeafwoSB5cgUo21rwGoXXkAW23dPsdnDzXSJFe1+MyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:08.191857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7025b4250333c672ed48970baa159f883ca49a650d2666bc5ef6ecea7fbef52d","sha256:0b93df997865fc18d9b76e91c488053fd52ae1085ccac107d999779904c0c5ed"],"state_sha256":"55e49d6d0f482820b261a6fef733e761a6bc85676dd99c373675f594f1971dc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVLvTkf/fFMwvr8aqNPjOUlQhUfBIEFWlxjbpTuIj6kl1cDDyQKfuq+PgT+k2Df6mb5UqBpZuUQV8vCG9RVzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:04:01.262326Z","bundle_sha256":"898142045392131c1e0eea805da09f23336e6341518ed38de10b6b6b2ebc5bc7"}}