{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JFZQLL6H2ZELHW7DMLWTP44CRU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f7fe82a4260b03c5a1593d3afc647f4386c5814052269c28b41bc2e30a7881b1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-14T16:27:50Z","title_canon_sha256":"ebc8dd30c848fe68348d2ae7d703ae754687c5dfc5ab01fd8ebf1292d584c172"},"schema_version":"1.0","source":{"id":"1402.3520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3520","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3520v1","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3520","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"pith_short_12","alias_value":"JFZQLL6H2ZEL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JFZQLL6H2ZELHW7D","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JFZQLL6H","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:5ca5a61a3d97a17998dc3b7dacc89789b8850359af7d98ffd6bd2bb06ac80722","target":"graph","created_at":"2026-05-18T02:58:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexandre Graell i Amat, Gerald Matz, Stefan Schwandter","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-14T16:27:50Z","title":"Spatially-Coupled LDPC Codes for Decode-and-Forward Relaying of Two Correlated Sources over the BEC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3520","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5e247c236aad5ac696239775e1b8a808bfb7d3caddfcb51acc418030fa6b6ce3","target":"record","created_at":"2026-05-18T02:58:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f7fe82a4260b03c5a1593d3afc647f4386c5814052269c28b41bc2e30a7881b1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-14T16:27:50Z","title_canon_sha256":"ebc8dd30c848fe68348d2ae7d703ae754687c5dfc5ab01fd8ebf1292d584c172"},"schema_version":"1.0","source":{"id":"1402.3520","kind":"arxiv","version":1}},"canonical_sha256":"497305afc7d648b3dbe362ed37f3828d164ae99406409950b9c9a0d4253c2fca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"497305afc7d648b3dbe362ed37f3828d164ae99406409950b9c9a0d4253c2fca","first_computed_at":"2026-05-18T02:58:58.528681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:58.528681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r9jYZKULHK2TSNPx3JXQihaIDWfiAN3BLMTOi5vfyJJ6jqd1x2xHPwL6+9XrH3ChL3yiZz2Zs1705rjUBOCTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:58.529564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e247c236aad5ac696239775e1b8a808bfb7d3caddfcb51acc418030fa6b6ce3","sha256:5ca5a61a3d97a17998dc3b7dacc89789b8850359af7d98ffd6bd2bb06ac80722"],"state_sha256":"4d157d1f93041c20611417ed19248d34cd9df68a7acce4c3be8bab2e18b7cec6"}