{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QGIUIGFXBQGEKDS3HGXS4XIZCB","short_pith_number":"pith:QGIUIGFX","canonical_record":{"source":{"id":"1311.4310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-18T09:47:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d0c81f2b9b519ff250d80c9994948ae4cf5686911d1e2ea8f41370d5a710c33","abstract_canon_sha256":"0f699f26496ba8248f1ff44b5f9493a663526b356ff1b29929ce9ffee5a826ee"},"schema_version":"1.0"},"canonical_sha256":"81914418b70c0c450e5b39af2e5d19104998cf6540d0d1e5f72fa831d3ae8b11","source":{"kind":"arxiv","id":"1311.4310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4310","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4310v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4310","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"QGIUIGFXBQGE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QGIUIGFXBQGEKDS3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QGIUIGFX","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QGIUIGFXBQGEKDS3HGXS4XIZCB","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-18T09:47:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d0c81f2b9b519ff250d80c9994948ae4cf5686911d1e2ea8f41370d5a710c33","abstract_canon_sha256":"0f699f26496ba8248f1ff44b5f9493a663526b356ff1b29929ce9ffee5a826ee"},"schema_version":"1.0"},"canonical_sha256":"81914418b70c0c450e5b39af2e5d19104998cf6540d0d1e5f72fa831d3ae8b11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.875921Z","signature_b64":"Ow5GvzAE0evQwVWRv+47PLFfkHJWZTuvx7UQJzEQPviO+UyBiO6Y0JupWxByxA8t7o3HEzY9mjGwwwJXXzVbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81914418b70c0c450e5b39af2e5d19104998cf6540d0d1e5f72fa831d3ae8b11","last_reissued_at":"2026-05-18T00:58:41.875218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.875218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4310","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-18T00:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWfuLMhFQQjw1wv8GeGWeD3lFL8sh2Yy3V93rHVas1NdOq3K8XX4zBHYUmQF38Vme+AEYamVwCMdmrDCvHf9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:39:03.591346Z"},"content_sha256":"c2e35755f53727a162808028f78749bc4a97c20d4a00d1b84985da3e276d118f","schema_version":"1.0","event_id":"sha256:c2e35755f53727a162808028f78749bc4a97c20d4a00d1b84985da3e276d118f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QGIUIGFXBQGEKDS3HGXS4XIZCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievable Rate Region of the Bidirectional Buffer-Aided Relay Channel with Block Fading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aissa Ikhlef, Nikola Zlatanov, Robert Schober, Vahid Jamali","submitted_at":"2013-11-18T09:47:43Z","abstract_excerpt":"The bidirectional relay channel, in which two users communicate with each other through a relay node, is a simple but fundamental and practical network architecture. In this paper, we consider the block fading bidirectional relay channel and propose efficient transmission strategies that exploit the block fading property of the channel. Thereby, we consider a decode-and-forward relay and assume that a direct link between the two users is not present. Our aim is to characterize the long-term achievable rate region and to develop protocols which achieve all points of the obtained rate region. Sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4310","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-18T00:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqZor5KIAa+VDHhr8/XewREmDa6rxFmRN1qF8jlZ5jmr+9e+DOkuoJPP7WmMc+5QDZ6riZtObuGiaKlcBRPxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:39:03.591695Z"},"content_sha256":"b69f13fdadd721770bfd33be514b34fabb459c4fdad8e8d50d479062dc9feffb","schema_version":"1.0","event_id":"sha256:b69f13fdadd721770bfd33be514b34fabb459c4fdad8e8d50d479062dc9feffb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGIUIGFXBQGEKDS3HGXS4XIZCB/bundle.json","state_url":"https://pith.science/pith/QGIUIGFXBQGEKDS3HGXS4XIZCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGIUIGFXBQGEKDS3HGXS4XIZCB/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-06-01T09:39:03Z","links":{"resolver":"https://pith.science/pith/QGIUIGFXBQGEKDS3HGXS4XIZCB","bundle":"https://pith.science/pith/QGIUIGFXBQGEKDS3HGXS4XIZCB/bundle.json","state":"https://pith.science/pith/QGIUIGFXBQGEKDS3HGXS4XIZCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGIUIGFXBQGEKDS3HGXS4XIZCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QGIUIGFXBQGEKDS3HGXS4XIZCB","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":"0f699f26496ba8248f1ff44b5f9493a663526b356ff1b29929ce9ffee5a826ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-18T09:47:43Z","title_canon_sha256":"1d0c81f2b9b519ff250d80c9994948ae4cf5686911d1e2ea8f41370d5a710c33"},"schema_version":"1.0","source":{"id":"1311.4310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4310","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4310v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4310","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"QGIUIGFXBQGE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QGIUIGFXBQGEKDS3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QGIUIGFX","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:b69f13fdadd721770bfd33be514b34fabb459c4fdad8e8d50d479062dc9feffb","target":"graph","created_at":"2026-05-18T00:58: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":"The bidirectional relay channel, in which two users communicate with each other through a relay node, is a simple but fundamental and practical network architecture. In this paper, we consider the block fading bidirectional relay channel and propose efficient transmission strategies that exploit the block fading property of the channel. Thereby, we consider a decode-and-forward relay and assume that a direct link between the two users is not present. Our aim is to characterize the long-term achievable rate region and to develop protocols which achieve all points of the obtained rate region. Sp","authors_text":"Aissa Ikhlef, Nikola Zlatanov, Robert Schober, Vahid Jamali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-18T09:47:43Z","title":"Achievable Rate Region of the Bidirectional Buffer-Aided Relay Channel with Block Fading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4310","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:c2e35755f53727a162808028f78749bc4a97c20d4a00d1b84985da3e276d118f","target":"record","created_at":"2026-05-18T00:58: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":"0f699f26496ba8248f1ff44b5f9493a663526b356ff1b29929ce9ffee5a826ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-18T09:47:43Z","title_canon_sha256":"1d0c81f2b9b519ff250d80c9994948ae4cf5686911d1e2ea8f41370d5a710c33"},"schema_version":"1.0","source":{"id":"1311.4310","kind":"arxiv","version":1}},"canonical_sha256":"81914418b70c0c450e5b39af2e5d19104998cf6540d0d1e5f72fa831d3ae8b11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81914418b70c0c450e5b39af2e5d19104998cf6540d0d1e5f72fa831d3ae8b11","first_computed_at":"2026-05-18T00:58:41.875218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.875218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ow5GvzAE0evQwVWRv+47PLFfkHJWZTuvx7UQJzEQPviO+UyBiO6Y0JupWxByxA8t7o3HEzY9mjGwwwJXXzVbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.875921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2e35755f53727a162808028f78749bc4a97c20d4a00d1b84985da3e276d118f","sha256:b69f13fdadd721770bfd33be514b34fabb459c4fdad8e8d50d479062dc9feffb"],"state_sha256":"bc8c06d4dc9f866996ee8f2a70cb5e7a0992187128e9e6275110305b41834f3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IA6DIWhx0z+6vh44sq1g999hzBSupBRROm/UJ069VN3IgocyB4dcTOUvJ8/pskNyrQZKMyYe2vmrJEkz91/GDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:39:03.593694Z","bundle_sha256":"72935a95ddfac321700e765e9d8529ee3f032a78640a28362a264df4a7f37762"}}