{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QR7OZ2QI4RJBT7KI45UYT5AZTJ","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":"4b363e95cd59e99857a21fa133eb81c99cb576bc109e91bf55921be324c1a2bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-06T11:32:24Z","title_canon_sha256":"96a1843de1c51904864d8e5ea3619c6bcbf9cf600042e954db2d69065d5402c8"},"schema_version":"1.0","source":{"id":"1706.01703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01703","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01703v1","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01703","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"QR7OZ2QI4RJB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QR7OZ2QI4RJBT7KI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QR7OZ2QI","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:73726384a55896324f6818e589847547f620dd109b05ef17d20cfabbaf3c2af6","target":"graph","created_at":"2026-05-18T00:42:56Z","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 give lower bounds on the size of $(a,b)$ elementary trapping sets (ETSs) belonging to variable-regular LDPC codes with any girth, $g$, and irregular ones with girth 8, where $a$ is the size, $b$ is the number of degree-one check nodes and satisfy the inequality $\\frac{b}{a}<1$. Our proposed lower bounds are analytical, rather than exhaustive search-based, and based on graph theories. The numerical results in the literarture for $g=6,8$ for variable-regular LDPC codes match our results. Some of our investigations are independent of the girth and rely on the variables $a$, $b$ a","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-06T11:32:24Z","title":"Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01703","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:392d0efa549ff71e0f840c009f71a60df9a3fba06a21103c572246d566e54067","target":"record","created_at":"2026-05-18T00:42:56Z","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":"4b363e95cd59e99857a21fa133eb81c99cb576bc109e91bf55921be324c1a2bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-06T11:32:24Z","title_canon_sha256":"96a1843de1c51904864d8e5ea3619c6bcbf9cf600042e954db2d69065d5402c8"},"schema_version":"1.0","source":{"id":"1706.01703","kind":"arxiv","version":1}},"canonical_sha256":"847eecea08e45219fd48e76989f4199a5a6a040f67cc5a442eaacc03422c81e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"847eecea08e45219fd48e76989f4199a5a6a040f67cc5a442eaacc03422c81e4","first_computed_at":"2026-05-18T00:42:56.221488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:56.221488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQgktANyTPSg19+kSMxPREna75ob/YT0Ta6ZZYK9xXYiKQUnP77dokqpnk3ixVfyjYbh23NHV9fUn24FOZBTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:56.222123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:392d0efa549ff71e0f840c009f71a60df9a3fba06a21103c572246d566e54067","sha256:73726384a55896324f6818e589847547f620dd109b05ef17d20cfabbaf3c2af6"],"state_sha256":"95f44c08e42ad0ce8dd8542e24a266896f003de6c9a99efb77ecfd5b1e9d2d57"}