{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DDGWN4LNDQJSGWOHI6CWBWPTI2","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":"4a98466bd6698ac55835f82a872bb2ff146fd4d2852ddc06582c1d8b1fc1e499","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-08T02:26:03Z","title_canon_sha256":"7933f1640c07b754e25d4d7e279b766e40bc8692195f41ecb98daa3e19de9f7b"},"schema_version":"1.0","source":{"id":"1408.1750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1750","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1750v1","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1750","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"DDGWN4LNDQJS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DDGWN4LNDQJSGWOH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DDGWN4LN","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:20297d9259d584b0cb52dde18ebc3d0b649f67ebfa397f518778010fe75e5d8a","target":"graph","created_at":"2026-05-18T02:45:39Z","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 a set of correlated sources $(U_1,\\cdots,U_K)$ over a Gaussian multiple access relay channel with time asynchronism between the encoders. We assume that the maximum possible offset ${\\mathsf{d_{max}}}(n)$ between the transmitters grows without bound as the block length $n \\rightarrow \\infty$ while the relative ratio ${{\\mathsf{d_{max}}}(n) / n}$ of the maximum possible offset to the block length asymptotically vanishes. For such a joint source-channel coding problem, and under specific gain conditions, we derive necessary and sufficient conditions for reliable comm","authors_text":"Hamidreza Ebrahimzadeh Saffar, Masoud Badiei Khuzani, Patrick Mitran","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-08T02:26:03Z","title":"Time-Asynchronous Gaussian Multiple Access Relay Channel with Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1750","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:3d628061bd5fbbc06bcec1865ae65aac28616d8ab3df45b9724b16383a59e44d","target":"record","created_at":"2026-05-18T02:45:39Z","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":"4a98466bd6698ac55835f82a872bb2ff146fd4d2852ddc06582c1d8b1fc1e499","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-08T02:26:03Z","title_canon_sha256":"7933f1640c07b754e25d4d7e279b766e40bc8692195f41ecb98daa3e19de9f7b"},"schema_version":"1.0","source":{"id":"1408.1750","kind":"arxiv","version":1}},"canonical_sha256":"18cd66f16d1c132359c7478560d9f346aacd7c99c55b7d19927db417a2d8f268","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18cd66f16d1c132359c7478560d9f346aacd7c99c55b7d19927db417a2d8f268","first_computed_at":"2026-05-18T02:45:39.100599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:39.100599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XF7xpabkb5dfffFoNdL5Lc1PDXNOEVT3r7wj7UIgnPCbgSJIo9Kt8kDr16pumE2AomcVjoWiF7IMMNgUKCIxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:39.101087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d628061bd5fbbc06bcec1865ae65aac28616d8ab3df45b9724b16383a59e44d","sha256:20297d9259d584b0cb52dde18ebc3d0b649f67ebfa397f518778010fe75e5d8a"],"state_sha256":"62814ac536c5f80d7ec28250bc87820f5a6e5deac3c96b62a8aaa2ba3c8df11f"}