{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NZR3GBKQERZNEW664NYA66LR3J","short_pith_number":"pith:NZR3GBKQ","canonical_record":{"source":{"id":"2411.17056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-26T02:52:48Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"b83a1f30fb230ceeaded5bf668a450169e9af3912e9437d84aefabb4ba087de7","abstract_canon_sha256":"08ed6a1779740e6c222bd4b36033a8e3f19f8f56c078873b45520da78f8a0867"},"schema_version":"1.0"},"canonical_sha256":"6e63b305502472d25bdee3700f7971da42118e97418580212505e324c96e11a7","source":{"kind":"arxiv","id":"2411.17056","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17056","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17056v2","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17056","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"NZR3GBKQERZN","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"pith_short_16","alias_value":"NZR3GBKQERZNEW66","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"pith_short_8","alias_value":"NZR3GBKQ","created_at":"2026-07-05T09:41:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NZR3GBKQERZNEW664NYA66LR3J","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-26T02:52:48Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"b83a1f30fb230ceeaded5bf668a450169e9af3912e9437d84aefabb4ba087de7","abstract_canon_sha256":"08ed6a1779740e6c222bd4b36033a8e3f19f8f56c078873b45520da78f8a0867"},"schema_version":"1.0"},"canonical_sha256":"6e63b305502472d25bdee3700f7971da42118e97418580212505e324c96e11a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:04.806231Z","signature_b64":"IzAs6Wo4q8SwM5qm8/0jHOyzg9Cc46r7RGTD80LhghPEMRLJ4uaUSKcVDstXa8WCD2xP2E6wDmmg97I57lnrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e63b305502472d25bdee3700f7971da42118e97418580212505e324c96e11a7","last_reissued_at":"2026-07-05T09:41:04.805816Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:04.805816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17056","source_version":2,"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-07-05T09:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdANU7Iut3T8MC/q8K1j1198wQPy8hjJ4J4WBICWGniJ0V+u3i2UfASSeTNzmKbAa3N6ESwaXGfbHevoKc9QBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T19:07:43.427003Z"},"content_sha256":"49a9f129110dc81231a03519f475a2752eb92a1778391763bd2dca42748a9f92","schema_version":"1.0","event_id":"sha256:49a9f129110dc81231a03519f475a2752eb92a1778391763bd2dca42748a9f92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NZR3GBKQERZNEW664NYA66LR3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Max-Min Fair Beamforming Design for Rate Splitting Multiple Access-aided Visible Light Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Bruno Clerckx, Shuai Ma, Yijie Mao, Zhengqing Qiu","submitted_at":"2024-11-26T02:52:48Z","abstract_excerpt":"This paper addresses the robust beamforming design for rate splitting multiple access (RSMA)-aided visible light communication (VLC) networks with imperfect channel state information at the transmitter (CSIT). In particular, we first derive the theoretical lower bound for the channel capacity of RSMA-aided VLC networks. Then we investigate the beamforming design to solve the max-min fairness (MMF) problem of RSMA-aided VLC networks under the practical optical power constraint and electrical power constraint while considering the practical imperfect CSIT scenario. To address the problem, we pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17056","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17056/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZQZFzKFpUvxya03U8FtmpGo5Kjj7copT252WUGPhSjA55JWNF0YzH1sF7+zNOUTUeIcJRfBdrSEpVX77j8kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T19:07:43.427525Z"},"content_sha256":"a996a6adc30dfb2238c585c672f26e09076000d59e2a3e6505ae3eb3d5a06aa7","schema_version":"1.0","event_id":"sha256:a996a6adc30dfb2238c585c672f26e09076000d59e2a3e6505ae3eb3d5a06aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZR3GBKQERZNEW664NYA66LR3J/bundle.json","state_url":"https://pith.science/pith/NZR3GBKQERZNEW664NYA66LR3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZR3GBKQERZNEW664NYA66LR3J/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-08-19T19:07:43Z","links":{"resolver":"https://pith.science/pith/NZR3GBKQERZNEW664NYA66LR3J","bundle":"https://pith.science/pith/NZR3GBKQERZNEW664NYA66LR3J/bundle.json","state":"https://pith.science/pith/NZR3GBKQERZNEW664NYA66LR3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZR3GBKQERZNEW664NYA66LR3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NZR3GBKQERZNEW664NYA66LR3J","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":"08ed6a1779740e6c222bd4b36033a8e3f19f8f56c078873b45520da78f8a0867","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-26T02:52:48Z","title_canon_sha256":"b83a1f30fb230ceeaded5bf668a450169e9af3912e9437d84aefabb4ba087de7"},"schema_version":"1.0","source":{"id":"2411.17056","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17056","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17056v2","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17056","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"NZR3GBKQERZN","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"pith_short_16","alias_value":"NZR3GBKQERZNEW66","created_at":"2026-07-05T09:41:04Z"},{"alias_kind":"pith_short_8","alias_value":"NZR3GBKQ","created_at":"2026-07-05T09:41:04Z"}],"graph_snapshots":[{"event_id":"sha256:a996a6adc30dfb2238c585c672f26e09076000d59e2a3e6505ae3eb3d5a06aa7","target":"graph","created_at":"2026-07-05T09:41:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.17056/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper addresses the robust beamforming design for rate splitting multiple access (RSMA)-aided visible light communication (VLC) networks with imperfect channel state information at the transmitter (CSIT). In particular, we first derive the theoretical lower bound for the channel capacity of RSMA-aided VLC networks. Then we investigate the beamforming design to solve the max-min fairness (MMF) problem of RSMA-aided VLC networks under the practical optical power constraint and electrical power constraint while considering the practical imperfect CSIT scenario. To address the problem, we pro","authors_text":"Bruno Clerckx, Shuai Ma, Yijie Mao, Zhengqing Qiu","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-26T02:52:48Z","title":"Robust Max-Min Fair Beamforming Design for Rate Splitting Multiple Access-aided Visible Light Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17056","kind":"arxiv","version":2},"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:49a9f129110dc81231a03519f475a2752eb92a1778391763bd2dca42748a9f92","target":"record","created_at":"2026-07-05T09:41:04Z","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":"08ed6a1779740e6c222bd4b36033a8e3f19f8f56c078873b45520da78f8a0867","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-26T02:52:48Z","title_canon_sha256":"b83a1f30fb230ceeaded5bf668a450169e9af3912e9437d84aefabb4ba087de7"},"schema_version":"1.0","source":{"id":"2411.17056","kind":"arxiv","version":2}},"canonical_sha256":"6e63b305502472d25bdee3700f7971da42118e97418580212505e324c96e11a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e63b305502472d25bdee3700f7971da42118e97418580212505e324c96e11a7","first_computed_at":"2026-07-05T09:41:04.805816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:04.805816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IzAs6Wo4q8SwM5qm8/0jHOyzg9Cc46r7RGTD80LhghPEMRLJ4uaUSKcVDstXa8WCD2xP2E6wDmmg97I57lnrCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:04.806231Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17056","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49a9f129110dc81231a03519f475a2752eb92a1778391763bd2dca42748a9f92","sha256:a996a6adc30dfb2238c585c672f26e09076000d59e2a3e6505ae3eb3d5a06aa7"],"state_sha256":"cc1a98871f811ba17b5580767357c444444cc58de734caac59b65d16017ef685"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bbvS6hjwfcziuujjqHjlhL+5nUuVMnSWI6zHHy/WWItvVo2K8SVyCgJYeZHkkzt5uscN0kEOHqH+1xib9rQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T19:07:43.432395Z","bundle_sha256":"b31489ebb5525ae8f51f394a44ace6f6d80a11e3ccb7d55587db3ea8f5d80435"}}