{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BYNTSEIBUXSBXOM7JECS745EGH","short_pith_number":"pith:BYNTSEIB","schema_version":"1.0","canonical_sha256":"0e1b391101a5e41bb99f49052ff3a431e6577d31d32bbcdd08fe45fbb1b6928e","source":{"kind":"arxiv","id":"1208.6094","version":2},"attestation_state":"computed","paper":{"title":"The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiadong Wang, Lara Dolecek, Richard Wesel","submitted_at":"2012-08-30T07:26:02Z","abstract_excerpt":"For LDPC codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario, this paper introduces the cycle consistency matrix (CCM) as a powerful analytical tool for characterizing and avoiding absorbing sets in separable circulant-based (SCB) LDPC codes. SCB codes include a wide variety of regular LDPC codes such as array-based LDPC codes as well as many common quasi-cyclic codes. As a consequence of its cycle structure, each potent"},"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":"1208.6094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-30T07:26:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5110f4c606c661506eaa431f26154293af6ac3797a33248fca25e8d59199a636","abstract_canon_sha256":"76546bf7211fc4213df513724aee113683ffafa735c6d9100ac98fd684c312de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:04.928193Z","signature_b64":"QtxyWxQF3qZDV4h0sGBfAJOMBUzaNU6Jnkiz+84PBmK9OhwXrw3V5Fq7Jx2VNxHQMB/A9Rys+dPhbne74hsfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e1b391101a5e41bb99f49052ff3a431e6577d31d32bbcdd08fe45fbb1b6928e","last_reissued_at":"2026-05-18T03:39:04.927721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:04.927721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiadong Wang, Lara Dolecek, Richard Wesel","submitted_at":"2012-08-30T07:26:02Z","abstract_excerpt":"For LDPC codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario, this paper introduces the cycle consistency matrix (CCM) as a powerful analytical tool for characterizing and avoiding absorbing sets in separable circulant-based (SCB) LDPC codes. SCB codes include a wide variety of regular LDPC codes such as array-based LDPC codes as well as many common quasi-cyclic codes. As a consequence of its cycle structure, each potent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.6094","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":"1208.6094","created_at":"2026-05-18T03:39:04.927800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.6094v2","created_at":"2026-05-18T03:39:04.927800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.6094","created_at":"2026-05-18T03:39:04.927800+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYNTSEIBUXSB","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYNTSEIBUXSBXOM7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYNTSEIB","created_at":"2026-05-18T12:27:01.376967+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/BYNTSEIBUXSBXOM7JECS745EGH","json":"https://pith.science/pith/BYNTSEIBUXSBXOM7JECS745EGH.json","graph_json":"https://pith.science/api/pith-number/BYNTSEIBUXSBXOM7JECS745EGH/graph.json","events_json":"https://pith.science/api/pith-number/BYNTSEIBUXSBXOM7JECS745EGH/events.json","paper":"https://pith.science/paper/BYNTSEIB"},"agent_actions":{"view_html":"https://pith.science/pith/BYNTSEIBUXSBXOM7JECS745EGH","download_json":"https://pith.science/pith/BYNTSEIBUXSBXOM7JECS745EGH.json","view_paper":"https://pith.science/paper/BYNTSEIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.6094&json=true","fetch_graph":"https://pith.science/api/pith-number/BYNTSEIBUXSBXOM7JECS745EGH/graph.json","fetch_events":"https://pith.science/api/pith-number/BYNTSEIBUXSBXOM7JECS745EGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYNTSEIBUXSBXOM7JECS745EGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYNTSEIBUXSBXOM7JECS745EGH/action/storage_attestation","attest_author":"https://pith.science/pith/BYNTSEIBUXSBXOM7JECS745EGH/action/author_attestation","sign_citation":"https://pith.science/pith/BYNTSEIBUXSBXOM7JECS745EGH/action/citation_signature","submit_replication":"https://pith.science/pith/BYNTSEIBUXSBXOM7JECS745EGH/action/replication_record"}},"created_at":"2026-05-18T03:39:04.927800+00:00","updated_at":"2026-05-18T03:39:04.927800+00:00"}