{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:QR7ZV5PSDMJLFWGCEIQA26PNBY","short_pith_number":"pith:QR7ZV5PS","schema_version":"1.0","canonical_sha256":"847f9af5f21b12b2d8c222200d79ed0e34422447375dff688f4a7400ddbcde8d","source":{"kind":"arxiv","id":"0806.0036","version":1},"attestation_state":"computed","paper":{"title":"On the Design of Universal LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Sanaei, Mahdi Ramezani, Masoud Ardakani","submitted_at":"2008-05-30T22:03:00Z","abstract_excerpt":"Low-density parity-check (LDPC) coding for a multitude of equal-capacity channels is studied. First, based on numerous observations, a conjecture is stated that when the belief propagation decoder converges on a set of equal-capacity channels, it would also converge on any convex combination of those channels. Then, it is proved that when the stability condition is satisfied for a number of channels, it is also satisfied for any channel in their convex hull. For the purpose of code design, a method is proposed which can decompose every symmetric channel with capacity C into a set of identical-"},"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":"0806.0036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-30T22:03:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af0df22498e07f139a79a477061090d926b747cb1761d14a78e9bf1a72a4f443","abstract_canon_sha256":"820145a9c09ce439595cd38e884ae1de5ff2cf21828b450e4a1c1be4ed87f04f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.533247Z","signature_b64":"3rwlEM0CzngR1fZRoMG6LmokJdkbyCXbe3nRII6n1WEu7a/Vu9zgxEVw34GyZzrOX9q+af9ekaZloQtdUgGnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"847f9af5f21b12b2d8c222200d79ed0e34422447375dff688f4a7400ddbcde8d","last_reissued_at":"2026-05-18T00:58:48.532537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.532537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Design of Universal LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Sanaei, Mahdi Ramezani, Masoud Ardakani","submitted_at":"2008-05-30T22:03:00Z","abstract_excerpt":"Low-density parity-check (LDPC) coding for a multitude of equal-capacity channels is studied. First, based on numerous observations, a conjecture is stated that when the belief propagation decoder converges on a set of equal-capacity channels, it would also converge on any convex combination of those channels. Then, it is proved that when the stability condition is satisfied for a number of channels, it is also satisfied for any channel in their convex hull. For the purpose of code design, a method is proposed which can decompose every symmetric channel with capacity C into a set of identical-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0036","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":"0806.0036","created_at":"2026-05-18T00:58:48.532636+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.0036v1","created_at":"2026-05-18T00:58:48.532636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0036","created_at":"2026-05-18T00:58:48.532636+00:00"},{"alias_kind":"pith_short_12","alias_value":"QR7ZV5PSDMJL","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"QR7ZV5PSDMJLFWGC","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"QR7ZV5PS","created_at":"2026-05-18T12:25:58.018023+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/QR7ZV5PSDMJLFWGCEIQA26PNBY","json":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY.json","graph_json":"https://pith.science/api/pith-number/QR7ZV5PSDMJLFWGCEIQA26PNBY/graph.json","events_json":"https://pith.science/api/pith-number/QR7ZV5PSDMJLFWGCEIQA26PNBY/events.json","paper":"https://pith.science/paper/QR7ZV5PS"},"agent_actions":{"view_html":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY","download_json":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY.json","view_paper":"https://pith.science/paper/QR7ZV5PS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.0036&json=true","fetch_graph":"https://pith.science/api/pith-number/QR7ZV5PSDMJLFWGCEIQA26PNBY/graph.json","fetch_events":"https://pith.science/api/pith-number/QR7ZV5PSDMJLFWGCEIQA26PNBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/action/storage_attestation","attest_author":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/action/author_attestation","sign_citation":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/action/citation_signature","submit_replication":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/action/replication_record"}},"created_at":"2026-05-18T00:58:48.532636+00:00","updated_at":"2026-05-18T00:58:48.532636+00:00"}