{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EWLWLGGGCUSYAZY4ZEJEXAJOCB","short_pith_number":"pith:EWLWLGGG","canonical_record":{"source":{"id":"1502.05428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-18T22:07:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6662b86cd1ed3237360789f0fede3dac66039f359a55ee6ffb0d9440fbd0b105","abstract_canon_sha256":"f0e5e1f65da3fe9a2eb5aed1998744dbe39d220738d910567d0cc6945d9a6dd8"},"schema_version":"1.0"},"canonical_sha256":"25976598c6152580671cc9124b812e10403a73c6411c24b23877649f68b12704","source":{"kind":"arxiv","id":"1502.05428","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05428","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05428v2","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05428","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"EWLWLGGGCUSY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EWLWLGGGCUSYAZY4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EWLWLGGG","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EWLWLGGGCUSYAZY4ZEJEXAJOCB","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-18T22:07:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6662b86cd1ed3237360789f0fede3dac66039f359a55ee6ffb0d9440fbd0b105","abstract_canon_sha256":"f0e5e1f65da3fe9a2eb5aed1998744dbe39d220738d910567d0cc6945d9a6dd8"},"schema_version":"1.0"},"canonical_sha256":"25976598c6152580671cc9124b812e10403a73c6411c24b23877649f68b12704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:47.382897Z","signature_b64":"zYq2M5vsdYzbMil3xWzBVW8O/n4uczxz7j7CwU3tp8SfdoVQf77+2HvTMem7n/I/8ZC524UCLl+7E/zu+nN3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25976598c6152580671cc9124b812e10403a73c6411c24b23877649f68b12704","last_reissued_at":"2026-05-18T00:49:47.382280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:47.382280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05428","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNGWoY5GwP10EY9vnYHUnGzHo6TGqJt0QZLpSIyHrihyNT9SU3Dhx999bNTay0kL/lfkrJP220jxYY5Dqc/qAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:15:22.927251Z"},"content_sha256":"b9a09eda054a0e9ffa6485209ff4f2602e38f05576b43d9c1187ef18e5da5013","schema_version":"1.0","event_id":"sha256:b9a09eda054a0e9ffa6485209ff4f2602e38f05576b43d9c1187ef18e5da5013"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EWLWLGGGCUSYAZY4ZEJEXAJOCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matched Multiuser Gaussian Source-Channel Communications via Uncoded Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Jun Chen, Shlomo Shamai, Suhas Diggavi","submitted_at":"2015-02-18T22:07:57Z","abstract_excerpt":"We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the source, and the receiver wishes to reconstruct the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05428","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fKswv8WmPNAZbclExhftDcTx+2nKoTNE9tJLVtSlg4+ul0Me6Abo8+Dim/KJknSSEf86W72B5F7pmWIUNsAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:15:22.927981Z"},"content_sha256":"c3779c2fbd3287c7eb7d79f0a273239324295f6b87624e0b373b792d339fb5db","schema_version":"1.0","event_id":"sha256:c3779c2fbd3287c7eb7d79f0a273239324295f6b87624e0b373b792d339fb5db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWLWLGGGCUSYAZY4ZEJEXAJOCB/bundle.json","state_url":"https://pith.science/pith/EWLWLGGGCUSYAZY4ZEJEXAJOCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWLWLGGGCUSYAZY4ZEJEXAJOCB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T23:15:22Z","links":{"resolver":"https://pith.science/pith/EWLWLGGGCUSYAZY4ZEJEXAJOCB","bundle":"https://pith.science/pith/EWLWLGGGCUSYAZY4ZEJEXAJOCB/bundle.json","state":"https://pith.science/pith/EWLWLGGGCUSYAZY4ZEJEXAJOCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWLWLGGGCUSYAZY4ZEJEXAJOCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EWLWLGGGCUSYAZY4ZEJEXAJOCB","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":"f0e5e1f65da3fe9a2eb5aed1998744dbe39d220738d910567d0cc6945d9a6dd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-18T22:07:57Z","title_canon_sha256":"6662b86cd1ed3237360789f0fede3dac66039f359a55ee6ffb0d9440fbd0b105"},"schema_version":"1.0","source":{"id":"1502.05428","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05428","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05428v2","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05428","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"EWLWLGGGCUSY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EWLWLGGGCUSYAZY4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EWLWLGGG","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:c3779c2fbd3287c7eb7d79f0a273239324295f6b87624e0b373b792d339fb5db","target":"graph","created_at":"2026-05-18T00:49:47Z","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 investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the source, and the receiver wishes to reconstruct the ","authors_text":"Chao Tian, Jun Chen, Shlomo Shamai, Suhas Diggavi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-18T22:07:57Z","title":"Matched Multiuser Gaussian Source-Channel Communications via Uncoded Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05428","kind":"arxiv","version":2},"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:b9a09eda054a0e9ffa6485209ff4f2602e38f05576b43d9c1187ef18e5da5013","target":"record","created_at":"2026-05-18T00:49:47Z","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":"f0e5e1f65da3fe9a2eb5aed1998744dbe39d220738d910567d0cc6945d9a6dd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-18T22:07:57Z","title_canon_sha256":"6662b86cd1ed3237360789f0fede3dac66039f359a55ee6ffb0d9440fbd0b105"},"schema_version":"1.0","source":{"id":"1502.05428","kind":"arxiv","version":2}},"canonical_sha256":"25976598c6152580671cc9124b812e10403a73c6411c24b23877649f68b12704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25976598c6152580671cc9124b812e10403a73c6411c24b23877649f68b12704","first_computed_at":"2026-05-18T00:49:47.382280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:47.382280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zYq2M5vsdYzbMil3xWzBVW8O/n4uczxz7j7CwU3tp8SfdoVQf77+2HvTMem7n/I/8ZC524UCLl+7E/zu+nN3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:47.382897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05428","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9a09eda054a0e9ffa6485209ff4f2602e38f05576b43d9c1187ef18e5da5013","sha256:c3779c2fbd3287c7eb7d79f0a273239324295f6b87624e0b373b792d339fb5db"],"state_sha256":"7e6cf0c3b832ba5821a1559eb36b6c3967cc5a09bde4df60e0d8ea700a776c71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzcSV/mfkzf8s4WfirN+H7T+qOQJqB9WoYmT7bDU8w/gafC6LzjS7YDQIbuA16thrL19RhT9FL5bQoEdvD6UCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:15:22.931664Z","bundle_sha256":"80e492cdadb5fecc0f9796b914c50fce7f57d752a2ef8625e9dc1587601d0d11"}}