{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U6Z5FQLZXYESA4BNFVYMD2H2LC","short_pith_number":"pith:U6Z5FQLZ","schema_version":"1.0","canonical_sha256":"a7b3d2c179be0920702d2d70c1e8fa58ac7fb2ea63db7a1efe8a85fb07656b94","source":{"kind":"arxiv","id":"1403.6090","version":1},"attestation_state":"computed","paper":{"title":"Column Weight Two and Three LDPC Codes with High Rates and Large Girths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghaffar Raeisi, Mohammad Gholami","submitted_at":"2014-03-24T19:15:45Z","abstract_excerpt":"In this paper, the concept of the {\\it broken diagonal pair} in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. The structure of the proposed parity-check matrices significantly reduces the complexity of encoding and decoding. Interestingly, the constructed regular cycle codes with row-weights $t$, $3\\leq t \\leq 20$, $t\\neq 7, 15, 16$, have the best lengths among the known regular girth-12 cycle codes. In addition, the proposed cycle codes can be"},"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":"1403.6090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T19:15:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1088f03afb2066dc90e64505f3c88f7474983862161c404b6aadda1ce6766bed","abstract_canon_sha256":"c0eaf1f16968a4fb507e722350918e66e063d0f8556bebb3241d822593bb9722"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:46.923740Z","signature_b64":"2ib3kNCoYuIvDEiTPKNDMclimLEhz1oxM7mqwFK7XumdqOpyfobjPKalxKnWLtO6pvtllBVXWsjgkXqpL2ZdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7b3d2c179be0920702d2d70c1e8fa58ac7fb2ea63db7a1efe8a85fb07656b94","last_reissued_at":"2026-05-18T02:55:46.922833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:46.922833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Column Weight Two and Three LDPC Codes with High Rates and Large Girths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghaffar Raeisi, Mohammad Gholami","submitted_at":"2014-03-24T19:15:45Z","abstract_excerpt":"In this paper, the concept of the {\\it broken diagonal pair} in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. The structure of the proposed parity-check matrices significantly reduces the complexity of encoding and decoding. Interestingly, the constructed regular cycle codes with row-weights $t$, $3\\leq t \\leq 20$, $t\\neq 7, 15, 16$, have the best lengths among the known regular girth-12 cycle codes. In addition, the proposed cycle codes can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6090","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":"1403.6090","created_at":"2026-05-18T02:55:46.922967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6090v1","created_at":"2026-05-18T02:55:46.922967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6090","created_at":"2026-05-18T02:55:46.922967+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6Z5FQLZXYES","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6Z5FQLZXYESA4BN","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6Z5FQLZ","created_at":"2026-05-18T12:28:52.271510+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/U6Z5FQLZXYESA4BNFVYMD2H2LC","json":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC.json","graph_json":"https://pith.science/api/pith-number/U6Z5FQLZXYESA4BNFVYMD2H2LC/graph.json","events_json":"https://pith.science/api/pith-number/U6Z5FQLZXYESA4BNFVYMD2H2LC/events.json","paper":"https://pith.science/paper/U6Z5FQLZ"},"agent_actions":{"view_html":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC","download_json":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC.json","view_paper":"https://pith.science/paper/U6Z5FQLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6090&json=true","fetch_graph":"https://pith.science/api/pith-number/U6Z5FQLZXYESA4BNFVYMD2H2LC/graph.json","fetch_events":"https://pith.science/api/pith-number/U6Z5FQLZXYESA4BNFVYMD2H2LC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/action/storage_attestation","attest_author":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/action/author_attestation","sign_citation":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/action/citation_signature","submit_replication":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/action/replication_record"}},"created_at":"2026-05-18T02:55:46.922967+00:00","updated_at":"2026-05-18T02:55:46.922967+00:00"}