{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KFXHEVZRYWILIMTSO2RBYEERX2","short_pith_number":"pith:KFXHEVZR","schema_version":"1.0","canonical_sha256":"516e725731c590b4327276a21c1091be8859337bfe60655a2e91ea472a6f9f02","source":{"kind":"arxiv","id":"1008.2266","version":1},"attestation_state":"computed","paper":{"title":"Achievable Rates and Upper bounds for the Interference Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anas Chaaban, Aydin Sezgin","submitted_at":"2010-08-13T08:34:16Z","abstract_excerpt":"The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than previously known bounds under some conditions. Moreover, a transmit strategy for this setup is proposed. This strategy utilizes the following elements: Block Markov encoding combined with a Han-Kobayashi scheme at the sources, decode and forward at the relay, and Willems' backward decoding at the receivers. This scheme is shown to achieve within a finite gap our"},"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":"1008.2266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T08:34:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"23485dd2a21b87604c560dde2e2341613769d451c073081fd06beb49d5b9278a","abstract_canon_sha256":"16ed4f171ea455a65b5ba5b6f3ba1fc05ddf1c3c99a3ce65581f0f9d1c408a32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:14.303165Z","signature_b64":"Klwy6ylqtvjvSFdpeEd51VOQnLlpPG/v5Hohlcwufyc7QlevT4OW6Fc3+d6h5MUPixRPs2YWjH8dLxozCHRmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"516e725731c590b4327276a21c1091be8859337bfe60655a2e91ea472a6f9f02","last_reissued_at":"2026-05-18T04:42:14.302614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:14.302614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achievable Rates and Upper bounds for the Interference Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anas Chaaban, Aydin Sezgin","submitted_at":"2010-08-13T08:34:16Z","abstract_excerpt":"The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than previously known bounds under some conditions. Moreover, a transmit strategy for this setup is proposed. This strategy utilizes the following elements: Block Markov encoding combined with a Han-Kobayashi scheme at the sources, decode and forward at the relay, and Willems' backward decoding at the receivers. This scheme is shown to achieve within a finite gap our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2266","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":"1008.2266","created_at":"2026-05-18T04:42:14.302701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.2266v1","created_at":"2026-05-18T04:42:14.302701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2266","created_at":"2026-05-18T04:42:14.302701+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFXHEVZRYWIL","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFXHEVZRYWILIMTS","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFXHEVZR","created_at":"2026-05-18T12:26:09.077623+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/KFXHEVZRYWILIMTSO2RBYEERX2","json":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2.json","graph_json":"https://pith.science/api/pith-number/KFXHEVZRYWILIMTSO2RBYEERX2/graph.json","events_json":"https://pith.science/api/pith-number/KFXHEVZRYWILIMTSO2RBYEERX2/events.json","paper":"https://pith.science/paper/KFXHEVZR"},"agent_actions":{"view_html":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2","download_json":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2.json","view_paper":"https://pith.science/paper/KFXHEVZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.2266&json=true","fetch_graph":"https://pith.science/api/pith-number/KFXHEVZRYWILIMTSO2RBYEERX2/graph.json","fetch_events":"https://pith.science/api/pith-number/KFXHEVZRYWILIMTSO2RBYEERX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/action/storage_attestation","attest_author":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/action/author_attestation","sign_citation":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/action/citation_signature","submit_replication":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/action/replication_record"}},"created_at":"2026-05-18T04:42:14.302701+00:00","updated_at":"2026-05-18T04:42:14.302701+00:00"}