{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PER7KJTXAAM6R5XFXGS3XRFTOK","short_pith_number":"pith:PER7KJTX","canonical_record":{"source":{"id":"1507.04924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T11:12:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df39bfe377da6dc6f6ae7061c22006624b36394c3a17e8c3572a1ad76853319c","abstract_canon_sha256":"e67e9859fa10f1fa6c55bf64dbb0c86636fa15fc020417bb899d96d2f7915ace"},"schema_version":"1.0"},"canonical_sha256":"7923f526770019e8f6e5b9a5bbc4b372810feaf69f23545cdf41a0a5719fdfd6","source":{"kind":"arxiv","id":"1507.04924","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04924","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04924v1","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04924","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"PER7KJTXAAM6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PER7KJTXAAM6R5XF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PER7KJTX","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PER7KJTXAAM6R5XFXGS3XRFTOK","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T11:12:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df39bfe377da6dc6f6ae7061c22006624b36394c3a17e8c3572a1ad76853319c","abstract_canon_sha256":"e67e9859fa10f1fa6c55bf64dbb0c86636fa15fc020417bb899d96d2f7915ace"},"schema_version":"1.0"},"canonical_sha256":"7923f526770019e8f6e5b9a5bbc4b372810feaf69f23545cdf41a0a5719fdfd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:42.417450Z","signature_b64":"A7CZYgrNcn0xj/5PeyT3l2fIspyGo1f5CHOExkOei9baT+6yLBqIpaBZAvBayDa7ZJJBAZLozSn58804T8StDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7923f526770019e8f6e5b9a5bbc4b372810feaf69f23545cdf41a0a5719fdfd6","last_reissued_at":"2026-05-18T01:36:42.416646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:42.416646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04924","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-18T01:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vH88lpMou+0g6Mo4esfjPHPxVR6oHps5qFmoiCxc9F4kRVASXXPh4mAhKINyMh3+x7VLzG3qak1qQP7ZqXQsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:10:26.693437Z"},"content_sha256":"628e616bbd3e5be5e9864ba79d5fc00b980395235200966a54ac43381431a939","schema_version":"1.0","event_id":"sha256:628e616bbd3e5be5e9864ba79d5fc00b980395235200966a54ac43381431a939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PER7KJTXAAM6R5XFXGS3XRFTOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New and More General Capacity Theorem for the Gaussian Channel with Two-sided Input-Noise Dependent State Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghosheh Abed Hodtani, Mohammad Molavi Kakhki, Nima S. Anzabi-Nezhad","submitted_at":"2015-07-17T11:12:03Z","abstract_excerpt":"In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the capacity in a non-limiting case, we try to analyze and solve the Gaussian version of the Cover-Chiang theorem -as an open problem- mathematically and information-theoretically. Our capacity theorem, while including all previous theorems as its special cases, explains situations that can not be analyzed by them; for example, the effect of the correlation between the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04924","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-18T01:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQtvz1OVHAaYi7fjADJbdfR/xLC3h2eh/lOAqidaV2EbPMohJo3sJMoFmAWNyTIbcEPn22/4qin3TTMUGV3uBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:10:26.694095Z"},"content_sha256":"f07627161a154c8c6ce10c551f77627e8fca474b3b91374b275998e4ca811116","schema_version":"1.0","event_id":"sha256:f07627161a154c8c6ce10c551f77627e8fca474b3b91374b275998e4ca811116"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PER7KJTXAAM6R5XFXGS3XRFTOK/bundle.json","state_url":"https://pith.science/pith/PER7KJTXAAM6R5XFXGS3XRFTOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PER7KJTXAAM6R5XFXGS3XRFTOK/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-25T11:10:26Z","links":{"resolver":"https://pith.science/pith/PER7KJTXAAM6R5XFXGS3XRFTOK","bundle":"https://pith.science/pith/PER7KJTXAAM6R5XFXGS3XRFTOK/bundle.json","state":"https://pith.science/pith/PER7KJTXAAM6R5XFXGS3XRFTOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PER7KJTXAAM6R5XFXGS3XRFTOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PER7KJTXAAM6R5XFXGS3XRFTOK","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":"e67e9859fa10f1fa6c55bf64dbb0c86636fa15fc020417bb899d96d2f7915ace","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T11:12:03Z","title_canon_sha256":"df39bfe377da6dc6f6ae7061c22006624b36394c3a17e8c3572a1ad76853319c"},"schema_version":"1.0","source":{"id":"1507.04924","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04924","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04924v1","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04924","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"PER7KJTXAAM6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PER7KJTXAAM6R5XF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PER7KJTX","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:f07627161a154c8c6ce10c551f77627e8fca474b3b91374b275998e4ca811116","target":"graph","created_at":"2026-05-18T01:36:42Z","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":"In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the capacity in a non-limiting case, we try to analyze and solve the Gaussian version of the Cover-Chiang theorem -as an open problem- mathematically and information-theoretically. Our capacity theorem, while including all previous theorems as its special cases, explains situations that can not be analyzed by them; for example, the effect of the correlation between the","authors_text":"Ghosheh Abed Hodtani, Mohammad Molavi Kakhki, Nima S. Anzabi-Nezhad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T11:12:03Z","title":"A New and More General Capacity Theorem for the Gaussian Channel with Two-sided Input-Noise Dependent State Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04924","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:628e616bbd3e5be5e9864ba79d5fc00b980395235200966a54ac43381431a939","target":"record","created_at":"2026-05-18T01:36:42Z","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":"e67e9859fa10f1fa6c55bf64dbb0c86636fa15fc020417bb899d96d2f7915ace","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T11:12:03Z","title_canon_sha256":"df39bfe377da6dc6f6ae7061c22006624b36394c3a17e8c3572a1ad76853319c"},"schema_version":"1.0","source":{"id":"1507.04924","kind":"arxiv","version":1}},"canonical_sha256":"7923f526770019e8f6e5b9a5bbc4b372810feaf69f23545cdf41a0a5719fdfd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7923f526770019e8f6e5b9a5bbc4b372810feaf69f23545cdf41a0a5719fdfd6","first_computed_at":"2026-05-18T01:36:42.416646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:42.416646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7CZYgrNcn0xj/5PeyT3l2fIspyGo1f5CHOExkOei9baT+6yLBqIpaBZAvBayDa7ZJJBAZLozSn58804T8StDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:42.417450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04924","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:628e616bbd3e5be5e9864ba79d5fc00b980395235200966a54ac43381431a939","sha256:f07627161a154c8c6ce10c551f77627e8fca474b3b91374b275998e4ca811116"],"state_sha256":"9eb1365d0340a98b81cbeaca08f7a8b5f49199655aa3d3ac2d2faa8e1985dee3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/Cpmnouyrx2z5OXh9qH+sLSuWpEt/ow8BZM1tFVHEgxQPiqbhDh7ZhzASEJMkADLIE+jgGa1+Zw/ChYnVaSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:10:26.697943Z","bundle_sha256":"4568b7bcb081e8585cc740bee69753b559d532622963f66c59845f86d8498c91"}}