{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JESEXS234QNG26JZHUJKTVTN2V","short_pith_number":"pith:JESEXS23","schema_version":"1.0","canonical_sha256":"49244bcb5be41a6d79393d12a9d66dd56abdecd78e459cff00e320f08228d81e","source":{"kind":"arxiv","id":"1705.06798","version":2},"attestation_state":"computed","paper":{"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","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Dehghan, Amir H. Banihashemi","submitted_at":"2017-05-18T20:53:36Z","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"},"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":"1705.06798","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T20:53:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"327d5f027ff9e09671e9388f73594a2aaad4a54237012a84d28385b42c539740","abstract_canon_sha256":"b6c6cf4695a7ff5c40031b7c739d0e992402c637fd393383062a4328cf69d898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:47.984214Z","signature_b64":"LVVh6kfUwNOqLJ3UcFw8K0go0hMLGMKLj0XsSnBZt3R4em8v35Jjrh4iE1+HGVMPjyQSarnTYVr5F24OSu9SDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49244bcb5be41a6d79393d12a9d66dd56abdecd78e459cff00e320f08228d81e","last_reissued_at":"2026-05-18T00:13:47.983492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:47.983492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"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","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Dehghan, Amir H. Banihashemi","submitted_at":"2017-05-18T20:53:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06798","kind":"arxiv","version":2},"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":"1705.06798","created_at":"2026-05-18T00:13:47.983623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06798v2","created_at":"2026-05-18T00:13:47.983623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06798","created_at":"2026-05-18T00:13:47.983623+00:00"},{"alias_kind":"pith_short_12","alias_value":"JESEXS234QNG","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JESEXS234QNG26JZ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JESEXS23","created_at":"2026-05-18T12:31:24.725408+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/JESEXS234QNG26JZHUJKTVTN2V","json":"https://pith.science/pith/JESEXS234QNG26JZHUJKTVTN2V.json","graph_json":"https://pith.science/api/pith-number/JESEXS234QNG26JZHUJKTVTN2V/graph.json","events_json":"https://pith.science/api/pith-number/JESEXS234QNG26JZHUJKTVTN2V/events.json","paper":"https://pith.science/paper/JESEXS23"},"agent_actions":{"view_html":"https://pith.science/pith/JESEXS234QNG26JZHUJKTVTN2V","download_json":"https://pith.science/pith/JESEXS234QNG26JZHUJKTVTN2V.json","view_paper":"https://pith.science/paper/JESEXS23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06798&json=true","fetch_graph":"https://pith.science/api/pith-number/JESEXS234QNG26JZHUJKTVTN2V/graph.json","fetch_events":"https://pith.science/api/pith-number/JESEXS234QNG26JZHUJKTVTN2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JESEXS234QNG26JZHUJKTVTN2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JESEXS234QNG26JZHUJKTVTN2V/action/storage_attestation","attest_author":"https://pith.science/pith/JESEXS234QNG26JZHUJKTVTN2V/action/author_attestation","sign_citation":"https://pith.science/pith/JESEXS234QNG26JZHUJKTVTN2V/action/citation_signature","submit_replication":"https://pith.science/pith/JESEXS234QNG26JZHUJKTVTN2V/action/replication_record"}},"created_at":"2026-05-18T00:13:47.983623+00:00","updated_at":"2026-05-18T00:13:47.983623+00:00"}