{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:T5KA6WILCOZUBCBK3V7EWB4WI6","short_pith_number":"pith:T5KA6WIL","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"},"canonical_sha256":"9f540f590b13b340882add7e4b0796479105986af7bb900e97c9babd4b9b4143","source":{"kind":"arxiv","id":"1102.0043","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0043","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0043v1","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0043","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"T5KA6WILCOZU","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T5KA6WILCOZUBCBK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T5KA6WIL","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:T5KA6WILCOZUBCBK3V7EWB4WI6","target":"record","payload":{"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"},"canonical_sha256":"9f540f590b13b340882add7e4b0796479105986af7bb900e97c9babd4b9b4143","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"},"source_kind":"arxiv","source_id":"1102.0043","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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8LbpG/X9871qTWv2oViVoVBgI6DYjqNHtL0VpGw7DIxUHYAvmMipxjmYtEsePrHnWPbSK4DAYki79FabNOcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:18:59.709889Z"},"content_sha256":"07b2fae1f4aa89b0b4e255c4e2f797583acc3c2e0ca4d058becffa5d58f86f3c","schema_version":"1.0","event_id":"sha256:07b2fae1f4aa89b0b4e255c4e2f797583acc3c2e0ca4d058becffa5d58f86f3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:T5KA6WILCOZUBCBK3V7EWB4WI6","target":"graph","payload":{"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"},"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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNCfxngcJBkRJU3M5fpUCNxtNTSErPa/hbQJPjg5sj3g6boqFUAbEPgUyJjdSC4q4LastUYQkx0bO9p7apCdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:18:59.710576Z"},"content_sha256":"2620e10369119cab4dd23d659427203f6d223a5ebf5d8dde5ed8c6df00041b57","schema_version":"1.0","event_id":"sha256:2620e10369119cab4dd23d659427203f6d223a5ebf5d8dde5ed8c6df00041b57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/bundle.json","state_url":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/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-25T21:18:59Z","links":{"resolver":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6","bundle":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/bundle.json","state":"https://pith.science/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5KA6WILCOZUBCBK3V7EWB4WI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:T5KA6WILCOZUBCBK3V7EWB4WI6","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":"5ebd37ef7953d1e7c2da9ba0d38d2289d4a0ccdb282d7f7485e29bb0357fb76f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T23:59:54Z","title_canon_sha256":"1406713d3301c453ae7c797952b608e32e36a98b3c53d35b39376c56d7d4b74c"},"schema_version":"1.0","source":{"id":"1102.0043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0043","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0043v1","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0043","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"T5KA6WILCOZU","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T5KA6WILCOZUBCBK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T5KA6WIL","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:2620e10369119cab4dd23d659427203f6d223a5ebf5d8dde5ed8c6df00041b57","target":"graph","created_at":"2026-05-18T02:22: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":"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","authors_text":"Aylin Yener, Ye Tian","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T23:59:54Z","title":"The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0043","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:07b2fae1f4aa89b0b4e255c4e2f797583acc3c2e0ca4d058becffa5d58f86f3c","target":"record","created_at":"2026-05-18T02:22: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":"5ebd37ef7953d1e7c2da9ba0d38d2289d4a0ccdb282d7f7485e29bb0357fb76f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T23:59:54Z","title_canon_sha256":"1406713d3301c453ae7c797952b608e32e36a98b3c53d35b39376c56d7d4b74c"},"schema_version":"1.0","source":{"id":"1102.0043","kind":"arxiv","version":1}},"canonical_sha256":"9f540f590b13b340882add7e4b0796479105986af7bb900e97c9babd4b9b4143","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f540f590b13b340882add7e4b0796479105986af7bb900e97c9babd4b9b4143","first_computed_at":"2026-05-18T02:22:41.534841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:41.534841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dMsiMaaQahOPhNQB7e3Tul0n4z/QAPJY0xzHbzOzuP+Dn0XajDYjDzipbBHTvKmlljRoFWLMz/RAb090qY7/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:41.535544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07b2fae1f4aa89b0b4e255c4e2f797583acc3c2e0ca4d058becffa5d58f86f3c","sha256:2620e10369119cab4dd23d659427203f6d223a5ebf5d8dde5ed8c6df00041b57"],"state_sha256":"84018071b2a694b7734274c5e312ec35dc956f744a21fee99cf26246bd5b5f67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkZjTNRHuSBvBhP13OWBk8CKWG69E+fiBObDvlGWj1sqxzgM2OSqVNlmtnxauPpkUNC05xDCtsY6DSPIJDGVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:18:59.715225Z","bundle_sha256":"916fc090182d323a83014cc22269b105864838179d55c80041857e7228991e56"}}