{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KFXHEVZRYWILIMTSO2RBYEERX2","short_pith_number":"pith:KFXHEVZR","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"},"canonical_sha256":"516e725731c590b4327276a21c1091be8859337bfe60655a2e91ea472a6f9f02","source":{"kind":"arxiv","id":"1008.2266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2266","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2266v1","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2266","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"KFXHEVZRYWIL","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KFXHEVZRYWILIMTS","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KFXHEVZR","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KFXHEVZRYWILIMTSO2RBYEERX2","target":"record","payload":{"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"},"canonical_sha256":"516e725731c590b4327276a21c1091be8859337bfe60655a2e91ea472a6f9f02","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"},"source_kind":"arxiv","source_id":"1008.2266","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-18T04:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mceWZJD/+Vnu+lbLiQ9ZsfU3suJf0A9AN64Ibgkw/+pf5eOmf6OUT4C+04UkwWSqN1S0ZMlfl/4WQdKLbj/VAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:33:58.412708Z"},"content_sha256":"76c682706f2910a593f88d99282f143d8650496301baea92b5a8cfbfb22f70b9","schema_version":"1.0","event_id":"sha256:76c682706f2910a593f88d99282f143d8650496301baea92b5a8cfbfb22f70b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KFXHEVZRYWILIMTSO2RBYEERX2","target":"graph","payload":{"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"},"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-18T04:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AdXqEhXXxfaju3+YRYQ0uR+Qj8mIhRi7C/Nu5bPDh0Ly8RHAhXKNsKQ4cNtBlNucYoiX44CBeqYwpSU9Utm0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:33:58.413231Z"},"content_sha256":"40886407de0de64344ccfc8cdb08d8361f4942e9c70468bd037b414073d8af53","schema_version":"1.0","event_id":"sha256:40886407de0de64344ccfc8cdb08d8361f4942e9c70468bd037b414073d8af53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/bundle.json","state_url":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFXHEVZRYWILIMTSO2RBYEERX2/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-25T14:33:58Z","links":{"resolver":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2","bundle":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/bundle.json","state":"https://pith.science/pith/KFXHEVZRYWILIMTSO2RBYEERX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFXHEVZRYWILIMTSO2RBYEERX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KFXHEVZRYWILIMTSO2RBYEERX2","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":"16ed4f171ea455a65b5ba5b6f3ba1fc05ddf1c3c99a3ce65581f0f9d1c408a32","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T08:34:16Z","title_canon_sha256":"23485dd2a21b87604c560dde2e2341613769d451c073081fd06beb49d5b9278a"},"schema_version":"1.0","source":{"id":"1008.2266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2266","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2266v1","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2266","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"KFXHEVZRYWIL","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KFXHEVZRYWILIMTS","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KFXHEVZR","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:40886407de0de64344ccfc8cdb08d8361f4942e9c70468bd037b414073d8af53","target":"graph","created_at":"2026-05-18T04:42:14Z","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":"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","authors_text":"Anas Chaaban, Aydin Sezgin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T08:34:16Z","title":"Achievable Rates and Upper bounds for the Interference Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2266","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:76c682706f2910a593f88d99282f143d8650496301baea92b5a8cfbfb22f70b9","target":"record","created_at":"2026-05-18T04:42:14Z","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":"16ed4f171ea455a65b5ba5b6f3ba1fc05ddf1c3c99a3ce65581f0f9d1c408a32","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T08:34:16Z","title_canon_sha256":"23485dd2a21b87604c560dde2e2341613769d451c073081fd06beb49d5b9278a"},"schema_version":"1.0","source":{"id":"1008.2266","kind":"arxiv","version":1}},"canonical_sha256":"516e725731c590b4327276a21c1091be8859337bfe60655a2e91ea472a6f9f02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"516e725731c590b4327276a21c1091be8859337bfe60655a2e91ea472a6f9f02","first_computed_at":"2026-05-18T04:42:14.302614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:14.302614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Klwy6ylqtvjvSFdpeEd51VOQnLlpPG/v5Hohlcwufyc7QlevT4OW6Fc3+d6h5MUPixRPs2YWjH8dLxozCHRmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:14.303165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76c682706f2910a593f88d99282f143d8650496301baea92b5a8cfbfb22f70b9","sha256:40886407de0de64344ccfc8cdb08d8361f4942e9c70468bd037b414073d8af53"],"state_sha256":"ab0c0d796a383f4d0d28b3805136501c78ceabe388f41536b950c08ecf4ee01a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5fEEhFpHSMxUd6ZUI5hlOCTYEsa/1zxs5fKeSyV8bKd3/Q7CX4OPhVfGjCQhxRPc9gnaTHh0SuIEUGQoJDABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:33:58.420399Z","bundle_sha256":"90743bc3d18c2d69583a5689ddbc085af5d1a5c8c864b0cdb6baf3464d793bf5"}}