{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R2BX4XBCM5BELH2D2WZXCCS3SA","short_pith_number":"pith:R2BX4XBC","canonical_record":{"source":{"id":"1510.07369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T05:51:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da079ad698afbb2b17b226cb98a96e7c04653ed0ce7ba0df0db3fede1c964248","abstract_canon_sha256":"f2b270f6b37698ba6e0e73bdc877c9a438a8b7f7a76a2b5b89dd59e88c41abd6"},"schema_version":"1.0"},"canonical_sha256":"8e837e5c226742459f43d5b3710a5b90387b22d282dd21bd6b04528612063c80","source":{"kind":"arxiv","id":"1510.07369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07369","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07369v1","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07369","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"R2BX4XBCM5BE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R2BX4XBCM5BELH2D","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R2BX4XBC","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R2BX4XBCM5BELH2D2WZXCCS3SA","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T05:51:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da079ad698afbb2b17b226cb98a96e7c04653ed0ce7ba0df0db3fede1c964248","abstract_canon_sha256":"f2b270f6b37698ba6e0e73bdc877c9a438a8b7f7a76a2b5b89dd59e88c41abd6"},"schema_version":"1.0"},"canonical_sha256":"8e837e5c226742459f43d5b3710a5b90387b22d282dd21bd6b04528612063c80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:14.264986Z","signature_b64":"8UnqzVvIwKLmRdwJ8qjhtX9yRHieXVHaGG8JXP+mOkQrVvEPIbfhFBgMgyUEkmX+w4ndINpTV4TwfMETuqDIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e837e5c226742459f43d5b3710a5b90387b22d282dd21bd6b04528612063c80","last_reissued_at":"2026-05-18T01:29:14.264375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:14.264375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07369","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-18T01:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wk6CqcAXzCXy1OiHcQNFVSmAJd04OBcLVMLoHb0Y4i/Ky9VYOcnHTDCaZ8uZfNWAT5xnM8WF8RCzkesuLWGoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:41:56.036130Z"},"content_sha256":"33574370f50dd0e2ea8f3d85a568ebe14463e41d86856283f67895d820fee4ab","schema_version":"1.0","event_id":"sha256:33574370f50dd0e2ea8f3d85a568ebe14463e41d86856283f67895d820fee4ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R2BX4XBCM5BELH2D2WZXCCS3SA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Non-Orthogonal Multiple Access By Forming Relaying Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"JungHo So, Youngchul Sung","submitted_at":"2015-10-26T05:51:57Z","abstract_excerpt":"In this paper, using relaying broadcast channels (RBCs) as component channels for non-orthogonal multiple access (NOMA) is proposed to enhance the performance of NOMA in single-input single-output (SISO) cellular downlink systems. To analyze the performance of the proposed scheme, an achievable rate region of a RBC with compress-and-forward (CF) relaying is newly derived based on the recent work of noisy network coding (NNC). Based on the analysis of the achievable rate region of a RBC with decode-and-forward (DF) relaying, CF relaying, or CF relaying with dirty-paper coding (DPC) at the trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07369","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-18T01:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/g0/txREkYW+Gws336k+/Gz0Pwo1TZRlL0MD9N4+npBHoqRE4KziLOLHTJhMObXYpR64VolJH526RevWE+M3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:41:56.036504Z"},"content_sha256":"8d79bc4b13ea72b0b68126d0da24fdb3c12ce7df2bd3b4f5860e9f4801b0cf04","schema_version":"1.0","event_id":"sha256:8d79bc4b13ea72b0b68126d0da24fdb3c12ce7df2bd3b4f5860e9f4801b0cf04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2BX4XBCM5BELH2D2WZXCCS3SA/bundle.json","state_url":"https://pith.science/pith/R2BX4XBCM5BELH2D2WZXCCS3SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2BX4XBCM5BELH2D2WZXCCS3SA/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-26T10:41:56Z","links":{"resolver":"https://pith.science/pith/R2BX4XBCM5BELH2D2WZXCCS3SA","bundle":"https://pith.science/pith/R2BX4XBCM5BELH2D2WZXCCS3SA/bundle.json","state":"https://pith.science/pith/R2BX4XBCM5BELH2D2WZXCCS3SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2BX4XBCM5BELH2D2WZXCCS3SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R2BX4XBCM5BELH2D2WZXCCS3SA","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":"f2b270f6b37698ba6e0e73bdc877c9a438a8b7f7a76a2b5b89dd59e88c41abd6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T05:51:57Z","title_canon_sha256":"da079ad698afbb2b17b226cb98a96e7c04653ed0ce7ba0df0db3fede1c964248"},"schema_version":"1.0","source":{"id":"1510.07369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07369","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07369v1","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07369","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"R2BX4XBCM5BE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R2BX4XBCM5BELH2D","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R2BX4XBC","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:8d79bc4b13ea72b0b68126d0da24fdb3c12ce7df2bd3b4f5860e9f4801b0cf04","target":"graph","created_at":"2026-05-18T01:29: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":"In this paper, using relaying broadcast channels (RBCs) as component channels for non-orthogonal multiple access (NOMA) is proposed to enhance the performance of NOMA in single-input single-output (SISO) cellular downlink systems. To analyze the performance of the proposed scheme, an achievable rate region of a RBC with compress-and-forward (CF) relaying is newly derived based on the recent work of noisy network coding (NNC). Based on the analysis of the achievable rate region of a RBC with decode-and-forward (DF) relaying, CF relaying, or CF relaying with dirty-paper coding (DPC) at the trans","authors_text":"JungHo So, Youngchul Sung","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T05:51:57Z","title":"Enhancing Non-Orthogonal Multiple Access By Forming Relaying Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07369","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:33574370f50dd0e2ea8f3d85a568ebe14463e41d86856283f67895d820fee4ab","target":"record","created_at":"2026-05-18T01:29: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":"f2b270f6b37698ba6e0e73bdc877c9a438a8b7f7a76a2b5b89dd59e88c41abd6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T05:51:57Z","title_canon_sha256":"da079ad698afbb2b17b226cb98a96e7c04653ed0ce7ba0df0db3fede1c964248"},"schema_version":"1.0","source":{"id":"1510.07369","kind":"arxiv","version":1}},"canonical_sha256":"8e837e5c226742459f43d5b3710a5b90387b22d282dd21bd6b04528612063c80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e837e5c226742459f43d5b3710a5b90387b22d282dd21bd6b04528612063c80","first_computed_at":"2026-05-18T01:29:14.264375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:14.264375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8UnqzVvIwKLmRdwJ8qjhtX9yRHieXVHaGG8JXP+mOkQrVvEPIbfhFBgMgyUEkmX+w4ndINpTV4TwfMETuqDIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:14.264986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33574370f50dd0e2ea8f3d85a568ebe14463e41d86856283f67895d820fee4ab","sha256:8d79bc4b13ea72b0b68126d0da24fdb3c12ce7df2bd3b4f5860e9f4801b0cf04"],"state_sha256":"bd141587745f46877c376e58c962ade2117933698eb3c77895a7046ab8d653a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRch4Fw1tP+sfqd3KHUAunPbW6Vrj5j2uFoyQh6iG/5e1U9RwkI3vHJ7f5N+y7zzZ1oDAzVfmghzJxCki/b0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:41:56.038484Z","bundle_sha256":"e62263a2b52e4e5b7c7611e80946d1fdd1268d6be6acf7c3920252d44e58704a"}}