{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F3BOARALSV5OOHEBVIKPSSARWG","short_pith_number":"pith:F3BOARAL","schema_version":"1.0","canonical_sha256":"2ec2e0440b957ae71c81aa14f94811b19e58845b6799758036372aa9c4cc326a","source":{"kind":"arxiv","id":"1405.3775","version":1},"attestation_state":"computed","paper":{"title":"Quasi Cyclic LDPC Codes Based on Finite Set Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Mehdi Samadieh, Mohammad Gholami","submitted_at":"2014-05-15T09:25:08Z","abstract_excerpt":"A finite set system (FSS) is a pair (V; B) where V is a finite set whose members are called points, equipped with a finite collection of its subsets B whose members are called blocks. In this paper, finite set systems are used to define a class of Quasi-cyclic low- density parity-check (LDPC) codes, called FSS codes, such that the constructed codes possess large girth and arbitrary column-weight distributions. Especially, the constructed column weight-2 FSS codes have higher rates than the column weight-2 geometric and cylinder-type codes with the same girths. To find the maximum girth of FSS "},"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":"1405.3775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-15T09:25:08Z","cross_cats_sorted":["cs.CR","cs.DM","math.IT"],"title_canon_sha256":"04b280eb7fdbfdca70836ba84ed59a050f6bd72e4d976199db652ac39219825f","abstract_canon_sha256":"bfa940e3f50d67bb9ea21dcedff0f6edde77d788ca7b036de6e670fd91c18798"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:49.314263Z","signature_b64":"hSMk2HdHfyxYfJ8kZmd0NA0vb9e2q3rR7zr1ZgT2soZpTJl/oTtw1nq2ays3Oz73aPF4Xz9TZjjGeZfs9krvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ec2e0440b957ae71c81aa14f94811b19e58845b6799758036372aa9c4cc326a","last_reissued_at":"2026-05-18T02:51:49.313907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:49.313907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi Cyclic LDPC Codes Based on Finite Set Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Mehdi Samadieh, Mohammad Gholami","submitted_at":"2014-05-15T09:25:08Z","abstract_excerpt":"A finite set system (FSS) is a pair (V; B) where V is a finite set whose members are called points, equipped with a finite collection of its subsets B whose members are called blocks. In this paper, finite set systems are used to define a class of Quasi-cyclic low- density parity-check (LDPC) codes, called FSS codes, such that the constructed codes possess large girth and arbitrary column-weight distributions. Especially, the constructed column weight-2 FSS codes have higher rates than the column weight-2 geometric and cylinder-type codes with the same girths. To find the maximum girth of FSS "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3775","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":"1405.3775","created_at":"2026-05-18T02:51:49.313966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3775v1","created_at":"2026-05-18T02:51:49.313966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3775","created_at":"2026-05-18T02:51:49.313966+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3BOARALSV5O","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3BOARALSV5OOHEB","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3BOARAL","created_at":"2026-05-18T12:28:28.263976+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/F3BOARALSV5OOHEBVIKPSSARWG","json":"https://pith.science/pith/F3BOARALSV5OOHEBVIKPSSARWG.json","graph_json":"https://pith.science/api/pith-number/F3BOARALSV5OOHEBVIKPSSARWG/graph.json","events_json":"https://pith.science/api/pith-number/F3BOARALSV5OOHEBVIKPSSARWG/events.json","paper":"https://pith.science/paper/F3BOARAL"},"agent_actions":{"view_html":"https://pith.science/pith/F3BOARALSV5OOHEBVIKPSSARWG","download_json":"https://pith.science/pith/F3BOARALSV5OOHEBVIKPSSARWG.json","view_paper":"https://pith.science/paper/F3BOARAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3775&json=true","fetch_graph":"https://pith.science/api/pith-number/F3BOARALSV5OOHEBVIKPSSARWG/graph.json","fetch_events":"https://pith.science/api/pith-number/F3BOARALSV5OOHEBVIKPSSARWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3BOARALSV5OOHEBVIKPSSARWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3BOARALSV5OOHEBVIKPSSARWG/action/storage_attestation","attest_author":"https://pith.science/pith/F3BOARALSV5OOHEBVIKPSSARWG/action/author_attestation","sign_citation":"https://pith.science/pith/F3BOARALSV5OOHEBVIKPSSARWG/action/citation_signature","submit_replication":"https://pith.science/pith/F3BOARALSV5OOHEBVIKPSSARWG/action/replication_record"}},"created_at":"2026-05-18T02:51:49.313966+00:00","updated_at":"2026-05-18T02:51:49.313966+00:00"}