{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:355NVZ2QYHFKPI523YMMHPMFLF","short_pith_number":"pith:355NVZ2Q","schema_version":"1.0","canonical_sha256":"df7adae750c1caa7a3bade18c3bd85595b0fb94754a6da83bce840b528bc8cb4","source":{"kind":"arxiv","id":"1701.08067","version":1},"attestation_state":"computed","paper":{"title":"Design of Capacity Approaching Ensembles of LDPC Codes for Correlated Sources using EXIT Charts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Saeedi, Mohamad Khas Mohamadi, Reza Asvadi","submitted_at":"2017-01-27T14:40:16Z","abstract_excerpt":"This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a systematic LDPC encoder and sent over two independent channels. At the receiver, a iterative joint decoder consisting of two component LDPC decoders is considered where the encoded bits at the output of each component decoder are used at the other decoder as the a priori information. We first provide asymptotic performance analysis using the concept of extr"},"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":"1701.08067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-27T14:40:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"287c530e48f2d93b136cb45959ac1e7bd971b14da06587cf95e155b38494b5b3","abstract_canon_sha256":"57aeb863630725d74de99eca1a143ab846c6a447a2e53ff48afaf6de8506cec8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:58.928255Z","signature_b64":"NrQ1bGZ3PhlEyWSeuS4H+g1w+2hQINhVG5ybWmuZi14e8vpIoGN4c15r8BO4e7piSiSTnydS7ynOXCX3BfQZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df7adae750c1caa7a3bade18c3bd85595b0fb94754a6da83bce840b528bc8cb4","last_reissued_at":"2026-05-18T00:51:58.927709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:58.927709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Capacity Approaching Ensembles of LDPC Codes for Correlated Sources using EXIT Charts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Saeedi, Mohamad Khas Mohamadi, Reza Asvadi","submitted_at":"2017-01-27T14:40:16Z","abstract_excerpt":"This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a systematic LDPC encoder and sent over two independent channels. At the receiver, a iterative joint decoder consisting of two component LDPC decoders is considered where the encoded bits at the output of each component decoder are used at the other decoder as the a priori information. We first provide asymptotic performance analysis using the concept of extr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08067","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":"1701.08067","created_at":"2026-05-18T00:51:58.927783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08067v1","created_at":"2026-05-18T00:51:58.927783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08067","created_at":"2026-05-18T00:51:58.927783+00:00"},{"alias_kind":"pith_short_12","alias_value":"355NVZ2QYHFK","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"355NVZ2QYHFKPI52","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"355NVZ2Q","created_at":"2026-05-18T12:30:58.224056+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/355NVZ2QYHFKPI523YMMHPMFLF","json":"https://pith.science/pith/355NVZ2QYHFKPI523YMMHPMFLF.json","graph_json":"https://pith.science/api/pith-number/355NVZ2QYHFKPI523YMMHPMFLF/graph.json","events_json":"https://pith.science/api/pith-number/355NVZ2QYHFKPI523YMMHPMFLF/events.json","paper":"https://pith.science/paper/355NVZ2Q"},"agent_actions":{"view_html":"https://pith.science/pith/355NVZ2QYHFKPI523YMMHPMFLF","download_json":"https://pith.science/pith/355NVZ2QYHFKPI523YMMHPMFLF.json","view_paper":"https://pith.science/paper/355NVZ2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08067&json=true","fetch_graph":"https://pith.science/api/pith-number/355NVZ2QYHFKPI523YMMHPMFLF/graph.json","fetch_events":"https://pith.science/api/pith-number/355NVZ2QYHFKPI523YMMHPMFLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/355NVZ2QYHFKPI523YMMHPMFLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/355NVZ2QYHFKPI523YMMHPMFLF/action/storage_attestation","attest_author":"https://pith.science/pith/355NVZ2QYHFKPI523YMMHPMFLF/action/author_attestation","sign_citation":"https://pith.science/pith/355NVZ2QYHFKPI523YMMHPMFLF/action/citation_signature","submit_replication":"https://pith.science/pith/355NVZ2QYHFKPI523YMMHPMFLF/action/replication_record"}},"created_at":"2026-05-18T00:51:58.927783+00:00","updated_at":"2026-05-18T00:51:58.927783+00:00"}