{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:H2WTSVKEE4IGEI56GPDGLMRDFL","short_pith_number":"pith:H2WTSVKE","schema_version":"1.0","canonical_sha256":"3ead39554427106223be33c665b2232af4b8284f4654a806313904ae4cdfbc8d","source":{"kind":"arxiv","id":"1108.4478","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir H. Banihashemi, Mehdi Karimi","submitted_at":"2011-08-23T02:17:45Z","abstract_excerpt":"This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. The algorithm can be used to estimate the error floor of LDPC codes or to be part of the apparatus to design LDPC codes with low error floors. For regular codes, the algorithm is initiated with a set of short cycles as the input. For irregular codes, in addition to short cycles, variable nodes with low degree and cycles with low approximate cycle extrinsic message degree (ACE) are also used as the initial inputs. The initial inputs are then expanded recursively to domina"},"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":"1108.4478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-23T02:17:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ade5d07ec3ea474ea62540f9f9e3b8efcdedd1c08416d93b75b10f369441264d","abstract_canon_sha256":"1abd07f474eb20444316cae7f207fa648a9883cd7a3aa301838ed6bc22c029f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:03.168480Z","signature_b64":"2jDFOhjwdM261Bc5qUb8WBhLqBxFCwY8kFHfivpO+Azy+IxGsgvVUMrtpkPXwknDsBrx4CPlxSslqi1QXe/DCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ead39554427106223be33c665b2232af4b8284f4654a806313904ae4cdfbc8d","last_reissued_at":"2026-05-18T03:58:03.167530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:03.167530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir H. Banihashemi, Mehdi Karimi","submitted_at":"2011-08-23T02:17:45Z","abstract_excerpt":"This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. The algorithm can be used to estimate the error floor of LDPC codes or to be part of the apparatus to design LDPC codes with low error floors. For regular codes, the algorithm is initiated with a set of short cycles as the input. For irregular codes, in addition to short cycles, variable nodes with low degree and cycles with low approximate cycle extrinsic message degree (ACE) are also used as the initial inputs. The initial inputs are then expanded recursively to domina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4478","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":"1108.4478","created_at":"2026-05-18T03:58:03.167764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4478v2","created_at":"2026-05-18T03:58:03.167764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4478","created_at":"2026-05-18T03:58:03.167764+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2WTSVKEE4IG","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2WTSVKEE4IGEI56","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2WTSVKE","created_at":"2026-05-18T12:26:30.835961+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/H2WTSVKEE4IGEI56GPDGLMRDFL","json":"https://pith.science/pith/H2WTSVKEE4IGEI56GPDGLMRDFL.json","graph_json":"https://pith.science/api/pith-number/H2WTSVKEE4IGEI56GPDGLMRDFL/graph.json","events_json":"https://pith.science/api/pith-number/H2WTSVKEE4IGEI56GPDGLMRDFL/events.json","paper":"https://pith.science/paper/H2WTSVKE"},"agent_actions":{"view_html":"https://pith.science/pith/H2WTSVKEE4IGEI56GPDGLMRDFL","download_json":"https://pith.science/pith/H2WTSVKEE4IGEI56GPDGLMRDFL.json","view_paper":"https://pith.science/paper/H2WTSVKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4478&json=true","fetch_graph":"https://pith.science/api/pith-number/H2WTSVKEE4IGEI56GPDGLMRDFL/graph.json","fetch_events":"https://pith.science/api/pith-number/H2WTSVKEE4IGEI56GPDGLMRDFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2WTSVKEE4IGEI56GPDGLMRDFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2WTSVKEE4IGEI56GPDGLMRDFL/action/storage_attestation","attest_author":"https://pith.science/pith/H2WTSVKEE4IGEI56GPDGLMRDFL/action/author_attestation","sign_citation":"https://pith.science/pith/H2WTSVKEE4IGEI56GPDGLMRDFL/action/citation_signature","submit_replication":"https://pith.science/pith/H2WTSVKEE4IGEI56GPDGLMRDFL/action/replication_record"}},"created_at":"2026-05-18T03:58:03.167764+00:00","updated_at":"2026-05-18T03:58:03.167764+00:00"}