{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5LHINNKW4RQI3J4HDBSXV7R2TV","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":"991cee0695cc941d15d8efe8ff20882a0e56f1412b4f132fff8862538cfb8480","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-30T06:12:45Z","title_canon_sha256":"a97dd6027bda13aac1879c4dfbb0b019b8a39f8787c18464c6ff53be80663f4a"},"schema_version":"1.0","source":{"id":"1611.10014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10014","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10014v1","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10014","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"5LHINNKW4RQI","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5LHINNKW4RQI3J4H","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5LHINNKW","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:ffd20adc484b74b2b884bb74dc41238f1ff3c5ac2ee5c3481bf29217aaa86021","target":"graph","created_at":"2026-05-18T00:56:11Z","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":"In this paper, we propose a characterization of elementary trapping sets (ETSs) for irregular low-density parity-check (LDPC) codes. These sets are known to be the main culprits in the error floor region of such codes. The characterization of ETSs for irregular codes has been known to be a challenging problem due to the large variety of non-isomorphic ETS structures that can exist within the Tanner graph of these codes. This is a direct consequence of the variety of the degrees of the variable nodes that can participate in such structures. The proposed characterization is based on a hierarchic","authors_text":"Amir H. Banihashemi, Yoones Hashemi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-30T06:12:45Z","title":"Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Irregular LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10014","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:21a6fcb3fedd6f7d1047a790177b030d52074ed65552a1826f672c7115e7e2f7","target":"record","created_at":"2026-05-18T00:56:11Z","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":"991cee0695cc941d15d8efe8ff20882a0e56f1412b4f132fff8862538cfb8480","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-30T06:12:45Z","title_canon_sha256":"a97dd6027bda13aac1879c4dfbb0b019b8a39f8787c18464c6ff53be80663f4a"},"schema_version":"1.0","source":{"id":"1611.10014","kind":"arxiv","version":1}},"canonical_sha256":"eace86b556e4608da78718657afe3a9d6092694db002f8cc2e34197307411499","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eace86b556e4608da78718657afe3a9d6092694db002f8cc2e34197307411499","first_computed_at":"2026-05-18T00:56:11.394033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:11.394033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQVvetemCasCKrLllPurAlnoPkVXftejrcEN7lU9ON7emODgLxfYt5J9Of3AdLxGsQJk+/vx1HH83MbCM+yQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:11.394449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21a6fcb3fedd6f7d1047a790177b030d52074ed65552a1826f672c7115e7e2f7","sha256:ffd20adc484b74b2b884bb74dc41238f1ff3c5ac2ee5c3481bf29217aaa86021"],"state_sha256":"36ff53d92a1531c2925cbd7c22de2d3d927974ea08e609f35b89d26483b051ec"}