{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JFZQLL6H2ZELHW7DMLWTP44CRU","short_pith_number":"pith:JFZQLL6H","schema_version":"1.0","canonical_sha256":"497305afc7d648b3dbe362ed37f3828d164ae99406409950b9c9a0d4253c2fca","source":{"kind":"arxiv","id":"1402.3520","version":1},"attestation_state":"computed","paper":{"title":"Spatially-Coupled LDPC Codes for Decode-and-Forward Relaying of Two Correlated Sources over the BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Gerald Matz, Stefan Schwandter","submitted_at":"2014-02-14T16:27:50Z","abstract_excerpt":"We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the nodes are modeled as binary erasure channels. Joint source-channel coding with joint channel decoding is used to exploit the correlation. The relay performs network coding. We derive analytical bounds on the achievable rates for the binary erasure time-division multiple-access relay channel with correlated sources. We then design bilayer SC-LDPC codes and analy"},"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":"1402.3520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-14T16:27:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ebc8dd30c848fe68348d2ae7d703ae754687c5dfc5ab01fd8ebf1292d584c172","abstract_canon_sha256":"f7fe82a4260b03c5a1593d3afc647f4386c5814052269c28b41bc2e30a7881b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:58.529564Z","signature_b64":"r9jYZKULHK2TSNPx3JXQihaIDWfiAN3BLMTOi5vfyJJ6jqd1x2xHPwL6+9XrH3ChL3yiZz2Zs1705rjUBOCTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"497305afc7d648b3dbe362ed37f3828d164ae99406409950b9c9a0d4253c2fca","last_reissued_at":"2026-05-18T02:58:58.528681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:58.528681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially-Coupled LDPC Codes for Decode-and-Forward Relaying of Two Correlated Sources over the BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Gerald Matz, Stefan Schwandter","submitted_at":"2014-02-14T16:27:50Z","abstract_excerpt":"We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the nodes are modeled as binary erasure channels. Joint source-channel coding with joint channel decoding is used to exploit the correlation. The relay performs network coding. We derive analytical bounds on the achievable rates for the binary erasure time-division multiple-access relay channel with correlated sources. We then design bilayer SC-LDPC codes and analy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3520","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":"1402.3520","created_at":"2026-05-18T02:58:58.528836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3520v1","created_at":"2026-05-18T02:58:58.528836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3520","created_at":"2026-05-18T02:58:58.528836+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFZQLL6H2ZEL","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFZQLL6H2ZELHW7D","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFZQLL6H","created_at":"2026-05-18T12:28:33.132498+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/JFZQLL6H2ZELHW7DMLWTP44CRU","json":"https://pith.science/pith/JFZQLL6H2ZELHW7DMLWTP44CRU.json","graph_json":"https://pith.science/api/pith-number/JFZQLL6H2ZELHW7DMLWTP44CRU/graph.json","events_json":"https://pith.science/api/pith-number/JFZQLL6H2ZELHW7DMLWTP44CRU/events.json","paper":"https://pith.science/paper/JFZQLL6H"},"agent_actions":{"view_html":"https://pith.science/pith/JFZQLL6H2ZELHW7DMLWTP44CRU","download_json":"https://pith.science/pith/JFZQLL6H2ZELHW7DMLWTP44CRU.json","view_paper":"https://pith.science/paper/JFZQLL6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3520&json=true","fetch_graph":"https://pith.science/api/pith-number/JFZQLL6H2ZELHW7DMLWTP44CRU/graph.json","fetch_events":"https://pith.science/api/pith-number/JFZQLL6H2ZELHW7DMLWTP44CRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFZQLL6H2ZELHW7DMLWTP44CRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFZQLL6H2ZELHW7DMLWTP44CRU/action/storage_attestation","attest_author":"https://pith.science/pith/JFZQLL6H2ZELHW7DMLWTP44CRU/action/author_attestation","sign_citation":"https://pith.science/pith/JFZQLL6H2ZELHW7DMLWTP44CRU/action/citation_signature","submit_replication":"https://pith.science/pith/JFZQLL6H2ZELHW7DMLWTP44CRU/action/replication_record"}},"created_at":"2026-05-18T02:58:58.528836+00:00","updated_at":"2026-05-18T02:58:58.528836+00:00"}