{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:T6FEBWCIUGP76VWTUYPPMO2GHV","short_pith_number":"pith:T6FEBWCI","schema_version":"1.0","canonical_sha256":"9f8a40d848a19fff56d3a61ef63b463d574b805f2df97d785b18d56c95df24f0","source":{"kind":"arxiv","id":"1012.3201","version":1},"attestation_state":"computed","paper":{"title":"Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Khaled Abdel-Ghaffar, Qin Huang, Qiuju Diao, Shu Lin","submitted_at":"2010-12-15T00:39:43Z","abstract_excerpt":"This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows that a cyclic code given by a parity-check matrix in circulant form can be decomposed into descendant cyclic and quasi-cyclic codes of various lengths and rates. Some fundamental structural properties of these descendant codes are developed, including the characterizations of the roots of the generator polynomial of a cyclic descendant code. The second part of the paper shows that cyclic and quasi-cyclic descendant LD"},"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":"1012.3201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-15T00:39:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6d5b24b99ef304eef6a10198b290625a49400d5093a76fee0d9d810d75f23a66","abstract_canon_sha256":"89c7a57b95cf710c544a913b174c32873f0dcffa4e8e993506bd113ced0d2433"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:17.543164Z","signature_b64":"6m4yHTKIieRF2cUP5k146MfswyUV/aa9+m2IBzj3EODKKQN3CeoGdQZZ4sGt4AGBiXFgsINnayJvWaTprVo5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f8a40d848a19fff56d3a61ef63b463d574b805f2df97d785b18d56c95df24f0","last_reissued_at":"2026-05-18T04:33:17.542414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:17.542414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Khaled Abdel-Ghaffar, Qin Huang, Qiuju Diao, Shu Lin","submitted_at":"2010-12-15T00:39:43Z","abstract_excerpt":"This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows that a cyclic code given by a parity-check matrix in circulant form can be decomposed into descendant cyclic and quasi-cyclic codes of various lengths and rates. Some fundamental structural properties of these descendant codes are developed, including the characterizations of the roots of the generator polynomial of a cyclic descendant code. The second part of the paper shows that cyclic and quasi-cyclic descendant LD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3201","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":"1012.3201","created_at":"2026-05-18T04:33:17.542509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3201v1","created_at":"2026-05-18T04:33:17.542509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3201","created_at":"2026-05-18T04:33:17.542509+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6FEBWCIUGP7","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6FEBWCIUGP76VWT","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6FEBWCI","created_at":"2026-05-18T12:26:13.927090+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/T6FEBWCIUGP76VWTUYPPMO2GHV","json":"https://pith.science/pith/T6FEBWCIUGP76VWTUYPPMO2GHV.json","graph_json":"https://pith.science/api/pith-number/T6FEBWCIUGP76VWTUYPPMO2GHV/graph.json","events_json":"https://pith.science/api/pith-number/T6FEBWCIUGP76VWTUYPPMO2GHV/events.json","paper":"https://pith.science/paper/T6FEBWCI"},"agent_actions":{"view_html":"https://pith.science/pith/T6FEBWCIUGP76VWTUYPPMO2GHV","download_json":"https://pith.science/pith/T6FEBWCIUGP76VWTUYPPMO2GHV.json","view_paper":"https://pith.science/paper/T6FEBWCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3201&json=true","fetch_graph":"https://pith.science/api/pith-number/T6FEBWCIUGP76VWTUYPPMO2GHV/graph.json","fetch_events":"https://pith.science/api/pith-number/T6FEBWCIUGP76VWTUYPPMO2GHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6FEBWCIUGP76VWTUYPPMO2GHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6FEBWCIUGP76VWTUYPPMO2GHV/action/storage_attestation","attest_author":"https://pith.science/pith/T6FEBWCIUGP76VWTUYPPMO2GHV/action/author_attestation","sign_citation":"https://pith.science/pith/T6FEBWCIUGP76VWTUYPPMO2GHV/action/citation_signature","submit_replication":"https://pith.science/pith/T6FEBWCIUGP76VWTUYPPMO2GHV/action/replication_record"}},"created_at":"2026-05-18T04:33:17.542509+00:00","updated_at":"2026-05-18T04:33:17.542509+00:00"}