{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JESEXS234QNG26JZHUJKTVTN2V","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":"b6c6cf4695a7ff5c40031b7c739d0e992402c637fd393383062a4328cf69d898","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T20:53:36Z","title_canon_sha256":"327d5f027ff9e09671e9388f73594a2aaad4a54237012a84d28385b42c539740"},"schema_version":"1.0","source":{"id":"1705.06798","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06798","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06798v2","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06798","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"JESEXS234QNG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JESEXS234QNG26JZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JESEXS23","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:be966dd083f123a56f341e329c132c30887a77e95f575d3d4ea3bda6d7f4d58f","target":"graph","created_at":"2026-05-18T00:13:47Z","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":"The performance of low-density parity-check (LDPC) codes in the error floor region is closely related to some combinatorial structures of the code's Tanner graph, collectively referred to as {\\it trapping sets (TSs)}. In this paper, we study the asymptotic average number of different types of trapping sets such as {\\em elementary TSs (ETS)}, {\\em leafless ETSs (LETS)}, {\\em absorbing sets (ABS)}, {\\em elementary ABSs (EABS)}, and {\\em stopping sets (SS)}, in random variable-regular and irregular LDPC code ensembles. We demonstrate that, regardless of the type of the TS, as the code's length te","authors_text":"Ali Dehghan, Amir H. Banihashemi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T20:53:36Z","title":"Asymptotic Average Multiplicity of Structures within Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06798","kind":"arxiv","version":2},"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:45ac8c933dd898b600ae83fdccf36b0ca435af08cf70ad16757efe047960dd58","target":"record","created_at":"2026-05-18T00:13:47Z","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":"b6c6cf4695a7ff5c40031b7c739d0e992402c637fd393383062a4328cf69d898","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T20:53:36Z","title_canon_sha256":"327d5f027ff9e09671e9388f73594a2aaad4a54237012a84d28385b42c539740"},"schema_version":"1.0","source":{"id":"1705.06798","kind":"arxiv","version":2}},"canonical_sha256":"49244bcb5be41a6d79393d12a9d66dd56abdecd78e459cff00e320f08228d81e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49244bcb5be41a6d79393d12a9d66dd56abdecd78e459cff00e320f08228d81e","first_computed_at":"2026-05-18T00:13:47.983492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:47.983492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LVVh6kfUwNOqLJ3UcFw8K0go0hMLGMKLj0XsSnBZt3R4em8v35Jjrh4iE1+HGVMPjyQSarnTYVr5F24OSu9SDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:47.984214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06798","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45ac8c933dd898b600ae83fdccf36b0ca435af08cf70ad16757efe047960dd58","sha256:be966dd083f123a56f341e329c132c30887a77e95f575d3d4ea3bda6d7f4d58f"],"state_sha256":"6d4fc872cc0b3b10696977cb06addd9ae41b9d84056c2e53a9acf1c28b0a7cbc"}