{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QR7OZ2QI4RJBT7KI45UYT5AZTJ","short_pith_number":"pith:QR7OZ2QI","schema_version":"1.0","canonical_sha256":"847eecea08e45219fd48e76989f4199a5a6a040f67cc5a442eaacc03422c81e4","source":{"kind":"arxiv","id":"1706.01703","version":1},"attestation_state":"computed","paper":{"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","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","submitted_at":"2017-06-06T11:32:24Z","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"},"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":"1706.01703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-06T11:32:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"96a1843de1c51904864d8e5ea3619c6bcbf9cf600042e954db2d69065d5402c8","abstract_canon_sha256":"4b363e95cd59e99857a21fa133eb81c99cb576bc109e91bf55921be324c1a2bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:56.222123Z","signature_b64":"ZQgktANyTPSg19+kSMxPREna75ob/YT0Ta6ZZYK9xXYiKQUnP77dokqpnk3ixVfyjYbh23NHV9fUn24FOZBTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"847eecea08e45219fd48e76989f4199a5a6a040f67cc5a442eaacc03422c81e4","last_reissued_at":"2026-05-18T00:42:56.221488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:56.221488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"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","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","submitted_at":"2017-06-06T11:32:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01703","kind":"arxiv","version":1},"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":"1706.01703","created_at":"2026-05-18T00:42:56.221580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01703v1","created_at":"2026-05-18T00:42:56.221580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01703","created_at":"2026-05-18T00:42:56.221580+00:00"},{"alias_kind":"pith_short_12","alias_value":"QR7OZ2QI4RJB","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QR7OZ2QI4RJBT7KI","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QR7OZ2QI","created_at":"2026-05-18T12:31:39.905425+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/QR7OZ2QI4RJBT7KI45UYT5AZTJ","json":"https://pith.science/pith/QR7OZ2QI4RJBT7KI45UYT5AZTJ.json","graph_json":"https://pith.science/api/pith-number/QR7OZ2QI4RJBT7KI45UYT5AZTJ/graph.json","events_json":"https://pith.science/api/pith-number/QR7OZ2QI4RJBT7KI45UYT5AZTJ/events.json","paper":"https://pith.science/paper/QR7OZ2QI"},"agent_actions":{"view_html":"https://pith.science/pith/QR7OZ2QI4RJBT7KI45UYT5AZTJ","download_json":"https://pith.science/pith/QR7OZ2QI4RJBT7KI45UYT5AZTJ.json","view_paper":"https://pith.science/paper/QR7OZ2QI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01703&json=true","fetch_graph":"https://pith.science/api/pith-number/QR7OZ2QI4RJBT7KI45UYT5AZTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QR7OZ2QI4RJBT7KI45UYT5AZTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QR7OZ2QI4RJBT7KI45UYT5AZTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QR7OZ2QI4RJBT7KI45UYT5AZTJ/action/storage_attestation","attest_author":"https://pith.science/pith/QR7OZ2QI4RJBT7KI45UYT5AZTJ/action/author_attestation","sign_citation":"https://pith.science/pith/QR7OZ2QI4RJBT7KI45UYT5AZTJ/action/citation_signature","submit_replication":"https://pith.science/pith/QR7OZ2QI4RJBT7KI45UYT5AZTJ/action/replication_record"}},"created_at":"2026-05-18T00:42:56.221580+00:00","updated_at":"2026-05-18T00:42:56.221580+00:00"}