human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "non orthogonal multiple access for visible light communications with ambient light and user mobility"):
  Abstract: The ever-increasing demand for high data-rate applications and the proliferation of connected devices pose several theoretical and technological challenges for the fifth generation (5G) networks and beyond. Among others, this includes the spectrum scarcity and massive connectivity of devices, particularly in the context of the Internet of Things (IoT) ecosystem. In this respect, visible light communication (VLC) has recently emerged as a potential solution for these challenges, particularly in scenarios relating to indoor communications. Additionally, non-orthogonal multiple access (NOMA) for VLC has been envisioned to address some of the key challenges in the next generation wireless networks. However, in realistic environments, it has been shown that VLC systems suffer from additive optical interference due to ambient light, and user-mobility which cause detrimental outages and overall degraded data rates. Motivated by this, in this work, we first derive the statistics of the incurred additive interference, and then analyze the rate of the considered NOMA-VLC channel. An analytical expression is subsequently derived for the rate of NOMA-VLC systems with ambient light and user-mobility, followed by the formulation of a power-allocation technique for the underlying scenario, which has been shown to outperform classical gain-ratio power allocation in terms of achievable rate. The obtained analytical results are corroborated with computer simulations for various realistic VLC scenarios of interest, which lead to useful insights of theoretical and practical interest. For example, it is shown that, in a NOMA-enabled VLC system, the maximum rate at which information can be transmitted over a static VLC communication channel with ambient light asymptotically converges to the Shannon Hartley capacity formula.

Includes members:
  Member "non orthogonal multiple access common myths and critical questions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "precoded chebyshev nlms based pre distorter for nonlinear led compensation in noma vlc":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "non orthogonal multiple access for visible light communications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optical rate splitting multiple access for visible light communications")
  Member "the application of mimo to non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "a general mimo framework for noma downlink and uplink transmission based on signal alignment":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)