{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HELD6FGSAWMBZKPCXZUQHDO2NC","short_pith_number":"pith:HELD6FGS","canonical_record":{"source":{"id":"1108.2816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T19:35:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03ab8f3a87ff2657b518ecb5c4abcf141b098640034281749bbd0a31dad046eb","abstract_canon_sha256":"de7164d5ac8cbf2a3b13e2ec8a29e8656c2f83120324b213487f269a9d2a2b77"},"schema_version":"1.0"},"canonical_sha256":"39163f14d205981ca9e2be69038dda68a71036c4a3d1cfe664450123019c6126","source":{"kind":"arxiv","id":"1108.2816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2816","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2816v1","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2816","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"HELD6FGSAWMB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HELD6FGSAWMBZKPC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HELD6FGS","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HELD6FGSAWMBZKPCXZUQHDO2NC","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T19:35:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03ab8f3a87ff2657b518ecb5c4abcf141b098640034281749bbd0a31dad046eb","abstract_canon_sha256":"de7164d5ac8cbf2a3b13e2ec8a29e8656c2f83120324b213487f269a9d2a2b77"},"schema_version":"1.0"},"canonical_sha256":"39163f14d205981ca9e2be69038dda68a71036c4a3d1cfe664450123019c6126","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:41.862346Z","signature_b64":"+E7+IC8LGlaj0yOiqc1N7IMvSEkX6d2KBEKA+ZbxQQ48HqftYkbWRgkeAOOg06KmNhor8Aak/tbDSLvDqsiKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39163f14d205981ca9e2be69038dda68a71036c4a3d1cfe664450123019c6126","last_reissued_at":"2026-05-18T02:21:41.861863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:41.861863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2816","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2U+ssERQp+vDW/JCiP7s91M5+NKi9y39g/517GnQ/y3HXf0TyHiA6XT6lI9FdbkwVs8rLWa6jfIa5tPjJO7KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:33:08.128649Z"},"content_sha256":"e08e784f480739c9affeba78ebe62848c40e204dd65c834e27e278a9385b3b3b","schema_version":"1.0","event_id":"sha256:e08e784f480739c9affeba78ebe62848c40e204dd65c834e27e278a9385b3b3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HELD6FGSAWMBZKPCXZUQHDO2NC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme","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":"2011-08-13T19:35:17Z","abstract_excerpt":"In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the upper and lower bounds on the largest achievable rate for this setup. We show that these two bounds can be obtained by solving two convex optimization problems. Finally, we present some simulations and discussion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2816","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCC+mV70gfUBTpGVctDQ7gT/Fxz+22qZYofZtqxPtESPk2Zyuz1OlMtLqYow0szzv9+FnZ7MZjl9kOgM9N80Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:33:08.129425Z"},"content_sha256":"a9b6791fa889f19ad8a75205a2c49754a46a44cf4322791268d992832f4fa112","schema_version":"1.0","event_id":"sha256:a9b6791fa889f19ad8a75205a2c49754a46a44cf4322791268d992832f4fa112"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HELD6FGSAWMBZKPCXZUQHDO2NC/bundle.json","state_url":"https://pith.science/pith/HELD6FGSAWMBZKPCXZUQHDO2NC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HELD6FGSAWMBZKPCXZUQHDO2NC/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-12T02:33:08Z","links":{"resolver":"https://pith.science/pith/HELD6FGSAWMBZKPCXZUQHDO2NC","bundle":"https://pith.science/pith/HELD6FGSAWMBZKPCXZUQHDO2NC/bundle.json","state":"https://pith.science/pith/HELD6FGSAWMBZKPCXZUQHDO2NC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HELD6FGSAWMBZKPCXZUQHDO2NC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HELD6FGSAWMBZKPCXZUQHDO2NC","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":"de7164d5ac8cbf2a3b13e2ec8a29e8656c2f83120324b213487f269a9d2a2b77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T19:35:17Z","title_canon_sha256":"03ab8f3a87ff2657b518ecb5c4abcf141b098640034281749bbd0a31dad046eb"},"schema_version":"1.0","source":{"id":"1108.2816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2816","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2816v1","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2816","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"HELD6FGSAWMB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HELD6FGSAWMBZKPC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HELD6FGS","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:a9b6791fa889f19ad8a75205a2c49754a46a44cf4322791268d992832f4fa112","target":"graph","created_at":"2026-05-18T02:21:41Z","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, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the upper and lower bounds on the largest achievable rate for this setup. We show that these two bounds can be obtained by solving two convex optimization problems. Finally, we present some simulations and discussion.","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":"2011-08-13T19:35:17Z","title":"Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2816","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:e08e784f480739c9affeba78ebe62848c40e204dd65c834e27e278a9385b3b3b","target":"record","created_at":"2026-05-18T02:21:41Z","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":"de7164d5ac8cbf2a3b13e2ec8a29e8656c2f83120324b213487f269a9d2a2b77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T19:35:17Z","title_canon_sha256":"03ab8f3a87ff2657b518ecb5c4abcf141b098640034281749bbd0a31dad046eb"},"schema_version":"1.0","source":{"id":"1108.2816","kind":"arxiv","version":1}},"canonical_sha256":"39163f14d205981ca9e2be69038dda68a71036c4a3d1cfe664450123019c6126","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39163f14d205981ca9e2be69038dda68a71036c4a3d1cfe664450123019c6126","first_computed_at":"2026-05-18T02:21:41.861863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:41.861863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+E7+IC8LGlaj0yOiqc1N7IMvSEkX6d2KBEKA+ZbxQQ48HqftYkbWRgkeAOOg06KmNhor8Aak/tbDSLvDqsiKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:41.862346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e08e784f480739c9affeba78ebe62848c40e204dd65c834e27e278a9385b3b3b","sha256:a9b6791fa889f19ad8a75205a2c49754a46a44cf4322791268d992832f4fa112"],"state_sha256":"4d3162305ca9dccf0ab4647e345479d7a5003bdf3920dc925c71f298c3227ecc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S7kungZ7QJznp8ZGFOsN3qYCRD/juVus9/PEytneu806yHe933rRB5mWKPu4Er6wkcEKWfeCYiBc7A9XbgUlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:33:08.134199Z","bundle_sha256":"993f95c722aeddbf0762e5d9844a11a8f4c7cc30384709dced72f29f427b8960"}}