{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:F3BOARALSV5OOHEBVIKPSSARWG","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":"bfa940e3f50d67bb9ea21dcedff0f6edde77d788ca7b036de6e670fd91c18798","cross_cats_sorted":["cs.CR","cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-15T09:25:08Z","title_canon_sha256":"04b280eb7fdbfdca70836ba84ed59a050f6bd72e4d976199db652ac39219825f"},"schema_version":"1.0","source":{"id":"1405.3775","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.3775","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1405.3775v1","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3775","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"F3BOARALSV5O","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F3BOARALSV5OOHEB","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F3BOARAL","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:37c66cce5578988a78e69b9833093b7a77275f82740eb3cbd50468a3db88643e","target":"graph","created_at":"2026-05-18T02:51:49Z","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":"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 ","authors_text":"Mehdi Samadieh, Mohammad Gholami","cross_cats":["cs.CR","cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-15T09:25:08Z","title":"Quasi Cyclic LDPC Codes Based on Finite Set Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3775","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:81efe1b3c689d296f81fa9955b7d9dd7b33ae8a65bfb7fd07a90a002a8883eb7","target":"record","created_at":"2026-05-18T02:51:49Z","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":"bfa940e3f50d67bb9ea21dcedff0f6edde77d788ca7b036de6e670fd91c18798","cross_cats_sorted":["cs.CR","cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-15T09:25:08Z","title_canon_sha256":"04b280eb7fdbfdca70836ba84ed59a050f6bd72e4d976199db652ac39219825f"},"schema_version":"1.0","source":{"id":"1405.3775","kind":"arxiv","version":1}},"canonical_sha256":"2ec2e0440b957ae71c81aa14f94811b19e58845b6799758036372aa9c4cc326a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ec2e0440b957ae71c81aa14f94811b19e58845b6799758036372aa9c4cc326a","first_computed_at":"2026-05-18T02:51:49.313907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:49.313907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hSMk2HdHfyxYfJ8kZmd0NA0vb9e2q3rR7zr1ZgT2soZpTJl/oTtw1nq2ays3Oz73aPF4Xz9TZjjGeZfs9krvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:49.314263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.3775","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81efe1b3c689d296f81fa9955b7d9dd7b33ae8a65bfb7fd07a90a002a8883eb7","sha256:37c66cce5578988a78e69b9833093b7a77275f82740eb3cbd50468a3db88643e"],"state_sha256":"206336ff7d22f844479d3e8c48328f3392a0ff9f5309f4a21c078802a9eeb8fb"}