{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EBAPJLIEO46LRUEWBJJPKHMKOG","short_pith_number":"pith:EBAPJLIE","canonical_record":{"source":{"id":"1907.02153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T22:40:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"870a5908c4e4ab20d77f687d22343da59723aa986417e6dad279976b3466171b","abstract_canon_sha256":"7ab6022a834f9789c75720470c71b612687487d120d4ceb3f11a3e3a1a795e39"},"schema_version":"1.0"},"canonical_sha256":"2040f4ad04773cb8d0960a52f51d8a71851c39e9ecb8bbbacdd55cf7b774bb37","source":{"kind":"arxiv","id":"1907.02153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02153","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02153v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02153","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"EBAPJLIEO46L","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EBAPJLIEO46LRUEW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EBAPJLIE","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EBAPJLIEO46LRUEWBJJPKHMKOG","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T22:40:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"870a5908c4e4ab20d77f687d22343da59723aa986417e6dad279976b3466171b","abstract_canon_sha256":"7ab6022a834f9789c75720470c71b612687487d120d4ceb3f11a3e3a1a795e39"},"schema_version":"1.0"},"canonical_sha256":"2040f4ad04773cb8d0960a52f51d8a71851c39e9ecb8bbbacdd55cf7b774bb37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:29.648614Z","signature_b64":"vk9NtRC+8Nm1TWPKqRylqWgnoIUfZKjfSPnzczKoqDRvVzptcsqS4YO6ZsreWex0wFLOOImyeas5A6sZ60STCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2040f4ad04773cb8d0960a52f51d8a71851c39e9ecb8bbbacdd55cf7b774bb37","last_reissued_at":"2026-05-17T23:41:29.647872Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:29.647872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02153","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-17T23:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cq4ZL3/BR1lQGnK5ClKlLm4t/DQGjn65nTBFjXincFk413TXicx65ZT2XJmRt9JNY4r6r2Wb15F3Scq0h11Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:51:58.980134Z"},"content_sha256":"d52ab07cf892515e279e6752a8e4b16af00addb2c306d9a38960cab8905941a1","schema_version":"1.0","event_id":"sha256:d52ab07cf892515e279e6752a8e4b16af00addb2c306d9a38960cab8905941a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EBAPJLIEO46LRUEWBJJPKHMKOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Rate-Splitting Multiple Access Scheme for the Downlink of C-RAN Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"DaeSung Yu, Junbeom Kim, Seok-Hwan Park","submitted_at":"2019-07-03T22:40:49Z","abstract_excerpt":"This work studies the optimization of rate-splitting multiple access (RSMA) transmission technique for a cloud radio access network (C-RAN) downlink system. Main idea of RSMA is to split the message for each user equipment (UE) to private and common messages and perform superposition coding at transmitters so as to enable flexible decoding at receivers. It is challenging to implement ideal RSMA scheme particularly when there are many UEs, since the number of common signals exponentially increases with the number of UEs. An efficient RSMA scheme is hence proposed that uses a linearly increasing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02153","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-17T23:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LpBj0tsL1K7+op4h32hHk/JWwpGPzn8D/k1laJbcOpKWOFNg6tpyoGSqcR0xZ/XcVUuQC+sKbbKvsUd/cAGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:51:58.980858Z"},"content_sha256":"4509e8030056ed42259342163af823ff21595a9b89dbe203431d96679d9c31bf","schema_version":"1.0","event_id":"sha256:4509e8030056ed42259342163af823ff21595a9b89dbe203431d96679d9c31bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBAPJLIEO46LRUEWBJJPKHMKOG/bundle.json","state_url":"https://pith.science/pith/EBAPJLIEO46LRUEWBJJPKHMKOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBAPJLIEO46LRUEWBJJPKHMKOG/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-29T14:51:58Z","links":{"resolver":"https://pith.science/pith/EBAPJLIEO46LRUEWBJJPKHMKOG","bundle":"https://pith.science/pith/EBAPJLIEO46LRUEWBJJPKHMKOG/bundle.json","state":"https://pith.science/pith/EBAPJLIEO46LRUEWBJJPKHMKOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBAPJLIEO46LRUEWBJJPKHMKOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EBAPJLIEO46LRUEWBJJPKHMKOG","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":"7ab6022a834f9789c75720470c71b612687487d120d4ceb3f11a3e3a1a795e39","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T22:40:49Z","title_canon_sha256":"870a5908c4e4ab20d77f687d22343da59723aa986417e6dad279976b3466171b"},"schema_version":"1.0","source":{"id":"1907.02153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02153","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02153v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02153","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"EBAPJLIEO46L","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EBAPJLIEO46LRUEW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EBAPJLIE","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:4509e8030056ed42259342163af823ff21595a9b89dbe203431d96679d9c31bf","target":"graph","created_at":"2026-05-17T23:41:29Z","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":"This work studies the optimization of rate-splitting multiple access (RSMA) transmission technique for a cloud radio access network (C-RAN) downlink system. Main idea of RSMA is to split the message for each user equipment (UE) to private and common messages and perform superposition coding at transmitters so as to enable flexible decoding at receivers. It is challenging to implement ideal RSMA scheme particularly when there are many UEs, since the number of common signals exponentially increases with the number of UEs. An efficient RSMA scheme is hence proposed that uses a linearly increasing","authors_text":"DaeSung Yu, Junbeom Kim, Seok-Hwan Park","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T22:40:49Z","title":"An Efficient Rate-Splitting Multiple Access Scheme for the Downlink of C-RAN Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02153","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:d52ab07cf892515e279e6752a8e4b16af00addb2c306d9a38960cab8905941a1","target":"record","created_at":"2026-05-17T23:41:29Z","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":"7ab6022a834f9789c75720470c71b612687487d120d4ceb3f11a3e3a1a795e39","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T22:40:49Z","title_canon_sha256":"870a5908c4e4ab20d77f687d22343da59723aa986417e6dad279976b3466171b"},"schema_version":"1.0","source":{"id":"1907.02153","kind":"arxiv","version":1}},"canonical_sha256":"2040f4ad04773cb8d0960a52f51d8a71851c39e9ecb8bbbacdd55cf7b774bb37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2040f4ad04773cb8d0960a52f51d8a71851c39e9ecb8bbbacdd55cf7b774bb37","first_computed_at":"2026-05-17T23:41:29.647872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:29.647872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vk9NtRC+8Nm1TWPKqRylqWgnoIUfZKjfSPnzczKoqDRvVzptcsqS4YO6ZsreWex0wFLOOImyeas5A6sZ60STCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:29.648614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d52ab07cf892515e279e6752a8e4b16af00addb2c306d9a38960cab8905941a1","sha256:4509e8030056ed42259342163af823ff21595a9b89dbe203431d96679d9c31bf"],"state_sha256":"e32ac34a3f7992db824fa86fa1cb3dd7e0b06afa209cec6d49e3cbdad3e7867d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Metdh94gm6Lavs5OkNMy1gnIgb6/PxQgvTmQNV6S6e3zoalQhxrjhqPdH/fiVlYlYqi8b07wjNZtITKe3MXdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:51:58.984549Z","bundle_sha256":"0781f7d10dfea965428def485a18859c88630f14697f0a84e95715c9457595c7"}}