{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q3WDA3MLLQFGOX7BR7B4O3OILL","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":"c5db23ebfd2ba2df3862b749f81144eccd44a9646effc2a2fae36842d6278ee5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-26T07:36:48Z","title_canon_sha256":"44466a0d6c62c209d5b680433011cff3c61d1b850dec4ec4c627ea6beefc0689"},"schema_version":"1.0","source":{"id":"1407.7103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7103","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7103v1","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7103","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"Q3WDA3MLLQFG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q3WDA3MLLQFGOX7B","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q3WDA3ML","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:8dbac3ee13f36f0acaac0016a822fc68bd4d29ade641503cc2a97c3ba5a637dc","target":"graph","created_at":"2026-05-18T02:46:23Z","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 study the transmission of correlated sources over discrete memoryless (DM) multiple-access-relay channels (MARCs), in which both the relay and the destination have access to side information arbitrarily correlated with the sources. As the optimal transmission scheme is an open problem, in this work we propose a new joint source-channel coding scheme based on a novel combination of the correlation preserving mapping (CPM) technique with Slepian-Wolf (SW) source coding, and obtain the corresponding sufficient conditions. The proposed coding scheme is based on the decode-and-forward strategy, ","authors_text":"Deniz G\\\"und\\\"uz, Ron Dabora, Yonathan Murin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-26T07:36:48Z","title":"On Joint Source-Channel Coding for Correlated Sources Over Multiple-Access Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7103","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:237e7fb485fdb549dc8731ec16037a47f99a78f3e31dfd332947efe38e63bdc0","target":"record","created_at":"2026-05-18T02:46:23Z","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":"c5db23ebfd2ba2df3862b749f81144eccd44a9646effc2a2fae36842d6278ee5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-26T07:36:48Z","title_canon_sha256":"44466a0d6c62c209d5b680433011cff3c61d1b850dec4ec4c627ea6beefc0689"},"schema_version":"1.0","source":{"id":"1407.7103","kind":"arxiv","version":1}},"canonical_sha256":"86ec306d8b5c0a675fe18fc3c76dc85aef8519d48bbf212c2b87e67fb0437a73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86ec306d8b5c0a675fe18fc3c76dc85aef8519d48bbf212c2b87e67fb0437a73","first_computed_at":"2026-05-18T02:46:23.874498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:23.874498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+PDBHgN6zKB5cCk8/eaNSr3SKCkbiiwTtEOQEs70j6e1Kohd3o4eBsDcT7bJDP1RsSQlWcTHFOqgq5A/nRfCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:23.874938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:237e7fb485fdb549dc8731ec16037a47f99a78f3e31dfd332947efe38e63bdc0","sha256:8dbac3ee13f36f0acaac0016a822fc68bd4d29ade641503cc2a97c3ba5a637dc"],"state_sha256":"a91654b13d137407529e7db9c743ca86868dfc15604bcd3f10578e15a283071f"}