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 "joint transceiver and offset design for visible light communications with input dependent shot noise"):
  Abstract: In this paper, we investigate the problem of the joint transceiver and offset design (JTOD) for point-to-point multiple-input-multiple-output (MIMO) and multiple user multiple-input-single-output (MU-MISO) visible light communication (VLC) systems. Both uplink and downlink multi-user scenarios are considered. The shot noise induced by the incoming signals is considered, leading to a more realistic MIMO VLC channel model. Under key lighting constraints, we formulate non-convex optimization problems aiming at minimizing the sum mean squared error. To optimize the transceiver and the offset jointly, a gradient projection based procedure is resorted to. When only imperfect channel state information is available, a semidefinite programming (SDP) based scheme is proposed to obtain robust transceiver and offset. The proposed method is shown to non-trivially outperform the conventional scaled zero forcing (ZF) and singular value decomposition (SVD) based equalization methods. The robust scheme works particularly well when the signal is much stronger than the noise.

Includes members:
  Member "non orthogonal multiple access for visible light communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optical rate splitting multiple access for visible light communications")
  Member "on the capacity of free space optical intensity channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "throughput maximization of mixed fso rf uav aided mobile relaying with a buffer")

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)