{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RHRF2MDA3LLJMKVJJLNOZYIX7S","short_pith_number":"pith:RHRF2MDA","canonical_record":{"source":{"id":"1201.1588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-07T21:24:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"971f31c4b8e86954972f1ebf72b32c4762a5d6a5d37d92574ddc4812a98e296d","abstract_canon_sha256":"bc84d158d160e7cdea45e0066a00342e955f0e85e5debe0d70f1e663e2673a0d"},"schema_version":"1.0"},"canonical_sha256":"89e25d3060dad6962aa94adaece117fcbc35e05cd9fdf7fa95f2095804ee6ed0","source":{"kind":"arxiv","id":"1201.1588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1588","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1588v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1588","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"RHRF2MDA3LLJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RHRF2MDA3LLJMKVJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RHRF2MDA","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RHRF2MDA3LLJMKVJJLNOZYIX7S","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-07T21:24:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"971f31c4b8e86954972f1ebf72b32c4762a5d6a5d37d92574ddc4812a98e296d","abstract_canon_sha256":"bc84d158d160e7cdea45e0066a00342e955f0e85e5debe0d70f1e663e2673a0d"},"schema_version":"1.0"},"canonical_sha256":"89e25d3060dad6962aa94adaece117fcbc35e05cd9fdf7fa95f2095804ee6ed0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.761712Z","signature_b64":"sF1yvtPdaesvujjTVvYMvfEynBLWW9PlosOvWi39+I2JupjX4wxMfAdO0kMbW/2CBIXAQVc7onJUtVR9BhcCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89e25d3060dad6962aa94adaece117fcbc35e05cd9fdf7fa95f2095804ee6ed0","last_reissued_at":"2026-05-18T02:21:18.761018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.761018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1588","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtSnklRKdrrTPiOb0u3SxRBU2n8RHnEtBNslXzwasW77B0Ss3DYYQlUnV5w4GQswQNKMu+mCLDulV+iGerq2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:59:26.003534Z"},"content_sha256":"534ba6ceee948024b0867cc63d09bdcc5e6d817b537e9d11ef40e68e8745084f","schema_version":"1.0","event_id":"sha256:534ba6ceee948024b0867cc63d09bdcc5e6d817b537e9d11ef40e68e8745084f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RHRF2MDA3LLJMKVJJLNOZYIX7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chong Li, Nicola Elia","submitted_at":"2012-01-07T21:24:39Z","abstract_excerpt":"We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization problem. With stationarity assumptions on Gaussian noise processes, we characterize the limit of the n-block upper bound and prove that this limit is the upper bound of the noisy feedback (shannon) capacity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1588","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUk3+HIincOeTOthkmaeMALT6LyyBEfNpZ7D9/O5FqijSxQWynxSacQaGr/KTjPYD1cQ/tr107OIB636YYmjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:59:26.004070Z"},"content_sha256":"736fa40319a7af7793b4e619dd14cb387e4ba10fe6ac52f4c1a2ee1d15f93760","schema_version":"1.0","event_id":"sha256:736fa40319a7af7793b4e619dd14cb387e4ba10fe6ac52f4c1a2ee1d15f93760"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHRF2MDA3LLJMKVJJLNOZYIX7S/bundle.json","state_url":"https://pith.science/pith/RHRF2MDA3LLJMKVJJLNOZYIX7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHRF2MDA3LLJMKVJJLNOZYIX7S/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-12T03:59:26Z","links":{"resolver":"https://pith.science/pith/RHRF2MDA3LLJMKVJJLNOZYIX7S","bundle":"https://pith.science/pith/RHRF2MDA3LLJMKVJJLNOZYIX7S/bundle.json","state":"https://pith.science/pith/RHRF2MDA3LLJMKVJJLNOZYIX7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHRF2MDA3LLJMKVJJLNOZYIX7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RHRF2MDA3LLJMKVJJLNOZYIX7S","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":"bc84d158d160e7cdea45e0066a00342e955f0e85e5debe0d70f1e663e2673a0d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-07T21:24:39Z","title_canon_sha256":"971f31c4b8e86954972f1ebf72b32c4762a5d6a5d37d92574ddc4812a98e296d"},"schema_version":"1.0","source":{"id":"1201.1588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1588","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1588v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1588","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"RHRF2MDA3LLJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RHRF2MDA3LLJMKVJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RHRF2MDA","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:736fa40319a7af7793b4e619dd14cb387e4ba10fe6ac52f4c1a2ee1d15f93760","target":"graph","created_at":"2026-05-18T02:21:18Z","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 consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization problem. With stationarity assumptions on Gaussian noise processes, we characterize the limit of the n-block upper bound and prove that this limit is the upper bound of the noisy feedback (shannon) capacity.","authors_text":"Chong Li, Nicola Elia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-07T21:24:39Z","title":"Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1588","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:534ba6ceee948024b0867cc63d09bdcc5e6d817b537e9d11ef40e68e8745084f","target":"record","created_at":"2026-05-18T02:21:18Z","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":"bc84d158d160e7cdea45e0066a00342e955f0e85e5debe0d70f1e663e2673a0d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-07T21:24:39Z","title_canon_sha256":"971f31c4b8e86954972f1ebf72b32c4762a5d6a5d37d92574ddc4812a98e296d"},"schema_version":"1.0","source":{"id":"1201.1588","kind":"arxiv","version":1}},"canonical_sha256":"89e25d3060dad6962aa94adaece117fcbc35e05cd9fdf7fa95f2095804ee6ed0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89e25d3060dad6962aa94adaece117fcbc35e05cd9fdf7fa95f2095804ee6ed0","first_computed_at":"2026-05-18T02:21:18.761018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.761018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sF1yvtPdaesvujjTVvYMvfEynBLWW9PlosOvWi39+I2JupjX4wxMfAdO0kMbW/2CBIXAQVc7onJUtVR9BhcCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.761712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:534ba6ceee948024b0867cc63d09bdcc5e6d817b537e9d11ef40e68e8745084f","sha256:736fa40319a7af7793b4e619dd14cb387e4ba10fe6ac52f4c1a2ee1d15f93760"],"state_sha256":"97755309f49490ebe6ec125829df806d77d1ac3b6ebabbb4cbc711ecc8a05fde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mm/e1vKALQdpQYzR3nxoBs5LGXHEAKfO277Ny7Tu1JR1nvXn1uu/Gx1Eddul8eL8ivfte5HrUcCNTbPDhaTACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:59:26.007507Z","bundle_sha256":"f167ab53f12eba0389d4f63831f7aacfa050221a08676f8eeb482fc9fa15f0e6"}}