{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GLXXCVGZTPMEYSH3HCDOPF6PF4","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":"2e8b781f75f5532c72094ce20eeabcc4f58e8a2bbb221cc7b82ae7676c8a67f7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-16T17:18:30Z","title_canon_sha256":"d564029b1add6c4019feab4d5ec66f01ca1c842d1c3f2aec33b714970d21f823"},"schema_version":"1.0","source":{"id":"1510.04954","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04954","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04954v1","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04954","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"GLXXCVGZTPME","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GLXXCVGZTPMEYSH3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GLXXCVGZ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:a5f8390f3c54cc6fcda34c8fb8523ab7bd745ff37cefac6e1c5a0d70ca49d374","target":"graph","created_at":"2026-05-18T01:30:00Z","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 new characterization for elementary trapping sets (ETSs) of variable-regular low-density parity-check (LDPC) codes. Recently, Karimi and Banihashemi proposed a characterization of ETSs, which was based on viewing an ETS as a layered superset (LSS) of a short cycle in the code's Tanner graph. A notable advantage of LSS characterization is that it corresponds to a simple LSS-based search algorithm that starts from short cycles of the graph and finds the ETSs with LSS structure efficiently. Compared to the LSS-based characterization of Karimi and Banihashemi, which is ","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":"2015-10-16T17:18:30Z","title":"New Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Variable-Regular LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04954","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:559487fc3e88ad496f1d79da617d8a8984521ea152554ef39db98954a45b3c52","target":"record","created_at":"2026-05-18T01:30:00Z","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":"2e8b781f75f5532c72094ce20eeabcc4f58e8a2bbb221cc7b82ae7676c8a67f7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-16T17:18:30Z","title_canon_sha256":"d564029b1add6c4019feab4d5ec66f01ca1c842d1c3f2aec33b714970d21f823"},"schema_version":"1.0","source":{"id":"1510.04954","kind":"arxiv","version":1}},"canonical_sha256":"32ef7154d99bd84c48fb3886e797cf2f12dd41b3d0ccb25de79c72300c39e71f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32ef7154d99bd84c48fb3886e797cf2f12dd41b3d0ccb25de79c72300c39e71f","first_computed_at":"2026-05-18T01:30:00.209276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:00.209276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VIkA/MtuXLW8anntT3CAX+dSgnSH+M7BHqhcAdDKCdDzzSoHelKEmr+8xMAO/3u2pG0qOVDElWdlI0iITnPgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:00.209959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04954","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:559487fc3e88ad496f1d79da617d8a8984521ea152554ef39db98954a45b3c52","sha256:a5f8390f3c54cc6fcda34c8fb8523ab7bd745ff37cefac6e1c5a0d70ca49d374"],"state_sha256":"aa5fe28959632583e71859501bb2192ac30c9040898c8243481e879d9efea46b"}