{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XLFKF2UJRZAZNDYZB6EWNADHTP","short_pith_number":"pith:XLFKF2UJ","schema_version":"1.0","canonical_sha256":"bacaa2ea898e41968f190f896680679bf918df2a9962914f571293244915099b","source":{"kind":"arxiv","id":"1510.04007","version":1},"attestation_state":"computed","paper":{"title":"Cut-Set Bound Is Loose for Gaussian Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Xiugang Wu","submitted_at":"2015-10-14T08:52:19Z","abstract_excerpt":"The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel which is tighter than the cut-set bound. Our proof is based on typicality arguments and concentration of Gaussian measure. Combined with a simple tensorization argument proposed by Courtade and Ozgur in 2015, our result also implies that the current capacity approximations for Gaussian relay networks, which have linear gap to the cut-set bound in the number of n"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1510.04007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-14T08:52:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4967194917b7163dea3db9e5791f4b68dfb2396e0e3d8eb4dd910bb790fe5dc3","abstract_canon_sha256":"788d90d5edf37df8907f2f5093a8b282a8913e06276d910917a463ccf1b3c051"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:09.521910Z","signature_b64":"h2uUpdf8FtCUhTZppHQbdzuKA9JB/S6DVcBc3hdCn9cvQnYGCO5c0OlGBe6fiH7jI+HHQPfNchpEJJaBm6LJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bacaa2ea898e41968f190f896680679bf918df2a9962914f571293244915099b","last_reissued_at":"2026-05-18T01:30:09.521326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:09.521326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cut-Set Bound Is Loose for Gaussian Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Xiugang Wu","submitted_at":"2015-10-14T08:52:19Z","abstract_excerpt":"The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel which is tighter than the cut-set bound. Our proof is based on typicality arguments and concentration of Gaussian measure. Combined with a simple tensorization argument proposed by Courtade and Ozgur in 2015, our result also implies that the current capacity approximations for Gaussian relay networks, which have linear gap to the cut-set bound in the number of n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04007","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.04007","created_at":"2026-05-18T01:30:09.521425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04007v1","created_at":"2026-05-18T01:30:09.521425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04007","created_at":"2026-05-18T01:30:09.521425+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLFKF2UJRZAZ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLFKF2UJRZAZNDYZ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLFKF2UJ","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP","json":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP.json","graph_json":"https://pith.science/api/pith-number/XLFKF2UJRZAZNDYZB6EWNADHTP/graph.json","events_json":"https://pith.science/api/pith-number/XLFKF2UJRZAZNDYZB6EWNADHTP/events.json","paper":"https://pith.science/paper/XLFKF2UJ"},"agent_actions":{"view_html":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP","download_json":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP.json","view_paper":"https://pith.science/paper/XLFKF2UJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04007&json=true","fetch_graph":"https://pith.science/api/pith-number/XLFKF2UJRZAZNDYZB6EWNADHTP/graph.json","fetch_events":"https://pith.science/api/pith-number/XLFKF2UJRZAZNDYZB6EWNADHTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP/action/storage_attestation","attest_author":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP/action/author_attestation","sign_citation":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP/action/citation_signature","submit_replication":"https://pith.science/pith/XLFKF2UJRZAZNDYZB6EWNADHTP/action/replication_record"}},"created_at":"2026-05-18T01:30:09.521425+00:00","updated_at":"2026-05-18T01:30:09.521425+00:00"}