{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:MPU5DLOUQNM7T52LGMHMZX6DJS","short_pith_number":"pith:MPU5DLOU","schema_version":"1.0","canonical_sha256":"63e9d1add48359f9f74b330eccdfc34c9f8d2a249a8552601aec9753bb6ded49","source":{"kind":"arxiv","id":"0903.1624","version":1},"attestation_state":"computed","paper":{"title":"Instanton-based Techniques for Analysis and Reduction of Error Floors of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, Michael Chertkov, Mikhail G. Stepanov, Shashi Kiran Chilappagari","submitted_at":"2009-03-09T19:05:13Z","abstract_excerpt":"We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the add"},"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":"0903.1624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T19:05:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68cb3b0f51f9a6e1969abf6b7f894dfe7a1dc10d281307243ec0c4cb0db0e3bc","abstract_canon_sha256":"bf4cb1d12e6ef0502bdb5675384137df8139b460de0a7247fde45837851fda7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.308615Z","signature_b64":"6HBjzd3MypTv8FH80sHCE8LlRk6RGYXJ/3fU+sj81WqQpQhuF0hjRnPnC0zmDINvw1zSkC/WT+XTjGVCiK3PBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63e9d1add48359f9f74b330eccdfc34c9f8d2a249a8552601aec9753bb6ded49","last_reissued_at":"2026-05-18T00:58:20.307915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.307915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instanton-based Techniques for Analysis and Reduction of Error Floors of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, Michael Chertkov, Mikhail G. Stepanov, Shashi Kiran Chilappagari","submitted_at":"2009-03-09T19:05:13Z","abstract_excerpt":"We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1624","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":"0903.1624","created_at":"2026-05-18T00:58:20.308007+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.1624v1","created_at":"2026-05-18T00:58:20.308007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1624","created_at":"2026-05-18T00:58:20.308007+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPU5DLOUQNM7","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPU5DLOUQNM7T52L","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPU5DLOU","created_at":"2026-05-18T12:26:00.592388+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/MPU5DLOUQNM7T52LGMHMZX6DJS","json":"https://pith.science/pith/MPU5DLOUQNM7T52LGMHMZX6DJS.json","graph_json":"https://pith.science/api/pith-number/MPU5DLOUQNM7T52LGMHMZX6DJS/graph.json","events_json":"https://pith.science/api/pith-number/MPU5DLOUQNM7T52LGMHMZX6DJS/events.json","paper":"https://pith.science/paper/MPU5DLOU"},"agent_actions":{"view_html":"https://pith.science/pith/MPU5DLOUQNM7T52LGMHMZX6DJS","download_json":"https://pith.science/pith/MPU5DLOUQNM7T52LGMHMZX6DJS.json","view_paper":"https://pith.science/paper/MPU5DLOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.1624&json=true","fetch_graph":"https://pith.science/api/pith-number/MPU5DLOUQNM7T52LGMHMZX6DJS/graph.json","fetch_events":"https://pith.science/api/pith-number/MPU5DLOUQNM7T52LGMHMZX6DJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPU5DLOUQNM7T52LGMHMZX6DJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPU5DLOUQNM7T52LGMHMZX6DJS/action/storage_attestation","attest_author":"https://pith.science/pith/MPU5DLOUQNM7T52LGMHMZX6DJS/action/author_attestation","sign_citation":"https://pith.science/pith/MPU5DLOUQNM7T52LGMHMZX6DJS/action/citation_signature","submit_replication":"https://pith.science/pith/MPU5DLOUQNM7T52LGMHMZX6DJS/action/replication_record"}},"created_at":"2026-05-18T00:58:20.308007+00:00","updated_at":"2026-05-18T00:58:20.308007+00:00"}