{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:THQ24SIPLXQKIB3EJGN5CMTDWK","short_pith_number":"pith:THQ24SIP","canonical_record":{"source":{"id":"1110.4999","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-10-22T20:45:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ecf65c1cc25335f9f5c32584a3fcf9e111f48e4a4b553fba2bcb37d93bc9fc7","abstract_canon_sha256":"ae48f06f9573de97602b601e119729eefcf22c84df005f15913f1cf859e3a771"},"schema_version":"1.0"},"canonical_sha256":"99e1ae490f5de0a40764499bd13263b2a06d1f96a8e8e746d6ecfa8c55bad81a","source":{"kind":"arxiv","id":"1110.4999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4999","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4999v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4999","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"THQ24SIPLXQK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"THQ24SIPLXQKIB3E","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"THQ24SIP","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:THQ24SIPLXQKIB3EJGN5CMTDWK","target":"record","payload":{"canonical_record":{"source":{"id":"1110.4999","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-10-22T20:45:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ecf65c1cc25335f9f5c32584a3fcf9e111f48e4a4b553fba2bcb37d93bc9fc7","abstract_canon_sha256":"ae48f06f9573de97602b601e119729eefcf22c84df005f15913f1cf859e3a771"},"schema_version":"1.0"},"canonical_sha256":"99e1ae490f5de0a40764499bd13263b2a06d1f96a8e8e746d6ecfa8c55bad81a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:24.957991Z","signature_b64":"T22EdopbpnJqyr7Umh4lg301sf0fI/5OhLWkHtLDtFlEbauSlwzWkCmDr5dSXQwiFdPmd4NsAUvzFxC7oBdpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e1ae490f5de0a40764499bd13263b2a06d1f96a8e8e746d6ecfa8c55bad81a","last_reissued_at":"2026-05-18T04:10:24.957513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:24.957513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.4999","source_version":1,"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-18T04:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTEqeUDCXFUEqqICmCrWoPvthMvLcrQBh4dZRiPXYtBcHF+RoVXE90h3SIbqFr58DlTiTLZLEtf/raQVnERpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:28:55.550346Z"},"content_sha256":"3687d955be33953331a5d79f08a154f8487201605c34c499c941917bc85ab9ff","schema_version":"1.0","event_id":"sha256:3687d955be33953331a5d79f08a154f8487201605c34c499c941917bc85ab9ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:THQ24SIPLXQKIB3EJGN5CMTDWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity of the Gaussian Relay Channel with Correlated Noises to Within a Constant Gap","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lei Zhou, Wei Yu","submitted_at":"2011-10-22T20:45:05Z","abstract_excerpt":"This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay channel can be achieved to within a constant gap of $\\hf \\log_2 3 =0.7925$ bits using a modified version of the noisy network coding strategy, where the quantization level at the relay is set in a correlation dependent way. As a corollary, this result establishes that the conventional compress-and-forward scheme also achieves to within a constant gap to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4999","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"},"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-18T04:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYF/ug+zuzNjOG6pwzZ1/Us1nbgCSst8z7ebjbthW6oWoaZD6cpZ92xCj/Nykgq/jaFY+y9FrvYECNEVgqqRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:28:55.550919Z"},"content_sha256":"da0edad6f31ef585f94fb113268901b9b668c20a36150a009a6ae960a5505b9b","schema_version":"1.0","event_id":"sha256:da0edad6f31ef585f94fb113268901b9b668c20a36150a009a6ae960a5505b9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THQ24SIPLXQKIB3EJGN5CMTDWK/bundle.json","state_url":"https://pith.science/pith/THQ24SIPLXQKIB3EJGN5CMTDWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THQ24SIPLXQKIB3EJGN5CMTDWK/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-05-29T22:28:55Z","links":{"resolver":"https://pith.science/pith/THQ24SIPLXQKIB3EJGN5CMTDWK","bundle":"https://pith.science/pith/THQ24SIPLXQKIB3EJGN5CMTDWK/bundle.json","state":"https://pith.science/pith/THQ24SIPLXQKIB3EJGN5CMTDWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THQ24SIPLXQKIB3EJGN5CMTDWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:THQ24SIPLXQKIB3EJGN5CMTDWK","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":"ae48f06f9573de97602b601e119729eefcf22c84df005f15913f1cf859e3a771","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-10-22T20:45:05Z","title_canon_sha256":"9ecf65c1cc25335f9f5c32584a3fcf9e111f48e4a4b553fba2bcb37d93bc9fc7"},"schema_version":"1.0","source":{"id":"1110.4999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4999","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4999v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4999","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"THQ24SIPLXQK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"THQ24SIPLXQKIB3E","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"THQ24SIP","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:da0edad6f31ef585f94fb113268901b9b668c20a36150a009a6ae960a5505b9b","target":"graph","created_at":"2026-05-18T04:10:24Z","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":"This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay channel can be achieved to within a constant gap of $\\hf \\log_2 3 =0.7925$ bits using a modified version of the noisy network coding strategy, where the quantization level at the relay is set in a correlation dependent way. As a corollary, this result establishes that the conventional compress-and-forward scheme also achieves to within a constant gap to the","authors_text":"Lei Zhou, Wei Yu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-10-22T20:45:05Z","title":"Capacity of the Gaussian Relay Channel with Correlated Noises to Within a Constant Gap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4999","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:3687d955be33953331a5d79f08a154f8487201605c34c499c941917bc85ab9ff","target":"record","created_at":"2026-05-18T04:10:24Z","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":"ae48f06f9573de97602b601e119729eefcf22c84df005f15913f1cf859e3a771","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-10-22T20:45:05Z","title_canon_sha256":"9ecf65c1cc25335f9f5c32584a3fcf9e111f48e4a4b553fba2bcb37d93bc9fc7"},"schema_version":"1.0","source":{"id":"1110.4999","kind":"arxiv","version":1}},"canonical_sha256":"99e1ae490f5de0a40764499bd13263b2a06d1f96a8e8e746d6ecfa8c55bad81a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99e1ae490f5de0a40764499bd13263b2a06d1f96a8e8e746d6ecfa8c55bad81a","first_computed_at":"2026-05-18T04:10:24.957513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:24.957513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T22EdopbpnJqyr7Umh4lg301sf0fI/5OhLWkHtLDtFlEbauSlwzWkCmDr5dSXQwiFdPmd4NsAUvzFxC7oBdpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:24.957991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3687d955be33953331a5d79f08a154f8487201605c34c499c941917bc85ab9ff","sha256:da0edad6f31ef585f94fb113268901b9b668c20a36150a009a6ae960a5505b9b"],"state_sha256":"0741a1ab8f6e202df1fd0bc5161b6cb7e75e8f2759569e77a26b95c1b0b83c14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5HEGn75V5dUSOMylGHmZYM5RaeOfA9kyjoFiR/dD19YiGpTwAk8oJWY6Xm/h6J79O6GjcpsR8UE5eECq8QFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:28:55.554512Z","bundle_sha256":"23eeb6440f7952672d2f61dcfc689ef48428f3007d238aaeb8d8e62f52cabf14"}}