{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:T5KA6WILCOZUBCBK3V7EWB4WI6","short_pith_number":"pith:T5KA6WIL","schema_version":"1.0","canonical_sha256":"9f540f590b13b340882add7e4b0796479105986af7bb900e97c9babd4b9b4143","source":{"kind":"arxiv","id":"1102.0043","version":1},"attestation_state":"computed","paper":{"title":"The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aylin Yener, Ye Tian","submitted_at":"2011-01-31T23:59:54Z","abstract_excerpt":"We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a generalized compress-and-forward strategy, where the destinations jointly decode the compression indices and the source messages, is shown to improve upon the compress-and-forward strategy which sequentially decodes the compression indices and source messages, and the recently proposed generalized hash-and-forward strategy. We also construct a nested lattice code bas"},"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":"1102.0043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T23:59:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1406713d3301c453ae7c797952b608e32e36a98b3c53d35b39376c56d7d4b74c","abstract_canon_sha256":"5ebd37ef7953d1e7c2da9ba0d38d2289d4a0ccdb282d7f7485e29bb0357fb76f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:41.535544Z","signature_b64":"dMsiMaaQahOPhNQB7e3Tul0n4z/QAPJY0xzHbzOzuP+Dn0XajDYjDzipbBHTvKmlljRoFWLMz/RAb090qY7/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f540f590b13b340882add7e4b0796479105986af7bb900e97c9babd4b9b4143","last_reissued_at":"2026-05-18T02:22:41.534841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:41.534841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aylin Yener, Ye Tian","submitted_at":"2011-01-31T23:59:54Z","abstract_excerpt":"We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a generalized compress-and-forward strategy, where the destinations jointly decode the compression indices and the source messages, is shown to improve upon the compress-and-forward strategy which sequentially decodes the compression indices and source messages, and the recently proposed generalized hash-and-forward strategy. We also construct a nested lattice code bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0043","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":"1102.0043","created_at":"2026-05-18T02:22:41.534930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0043v1","created_at":"2026-05-18T02:22:41.534930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0043","created_at":"2026-05-18T02:22:41.534930+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5KA6WILCOZU","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5KA6WILCOZUBCBK","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5KA6WIL","created_at":"2026-05-18T12:26:41.206345+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/T5KA6WILCOZUBCBK3V7EWB4WI6","json":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6.json","graph_json":"https://pith.science/api/pith-number/T5KA6WILCOZUBCBK3V7EWB4WI6/graph.json","events_json":"https://pith.science/api/pith-number/T5KA6WILCOZUBCBK3V7EWB4WI6/events.json","paper":"https://pith.science/paper/T5KA6WIL"},"agent_actions":{"view_html":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6","download_json":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6.json","view_paper":"https://pith.science/paper/T5KA6WIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0043&json=true","fetch_graph":"https://pith.science/api/pith-number/T5KA6WILCOZUBCBK3V7EWB4WI6/graph.json","fetch_events":"https://pith.science/api/pith-number/T5KA6WILCOZUBCBK3V7EWB4WI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/action/storage_attestation","attest_author":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/action/author_attestation","sign_citation":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/action/citation_signature","submit_replication":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/action/replication_record"}},"created_at":"2026-05-18T02:22:41.534930+00:00","updated_at":"2026-05-18T02:22:41.534930+00:00"}