human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "asymptotically optimal multiple access communication via distributed rate splitting"
  Abstract: We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the optimal rates allowed by information theory in a distributed manner. In this scheme, each real user creates a number of virtual users via a power/rate splitting mechanism in the M-user Gaussian channel or via a random switching mechanism in the M-user discrete memoryless channel. At the receiver, all virtual users are successively decoded. Compared with other multiple-access techniques, Distributed Rate Splitting (DRS) can be implemented with lower complexity and less coordination. Furthermore, in a symmetric setting, we show that the rate tuple achieved by this scheme converges to the maximum equal rate point allowed by the information-theoretic bound as the number of virtual users per real user tends to infinity. When the capacity regions are asymmetric, we show that a point on the dominant face can be achieved asymptotically. Finally, when there is an unequal number of virtual users per real user, we show that differential user rate requirements can be accommodated in a distributed fashion

Connected through hyperedge HE-1 (induced by source paper "sum rate maximization of uplink rate splitting multiple access rsma communication"):
  with members:
    - "rate splitting for multi user multi antenna wireless information and power transfer"
    - "a vision of 6g wireless systems applications trends technologies and open research problems"
    - "interference mitigation via rate splitting and common message decoding in cloud radio access networks"
    - "rate splitting multiple access for downlink communication systems bridging generalizing and outperforming sdma and noma"
    - "mobile unmanned aerial vehicles uavs for energy efficient internet of things communications"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"
    - "caching in the sky proactive deployment of cache enabled unmanned aerial vehicles for optimized quality of experience"

Connected through hyperedge HE-2 (induced by source paper "least squares superposition codes of moderate dictionary size reliable at rates up to capacity"):
  with members:
    - "capacity achieving random sparse linear codes"
    - "toward fast reliable communication at rates near capacity with gaussian noise"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "necessary and sufficient conditions for sparsity pattern recovery"
    - "on off random access channels a compressed sensing framework"
    - "on the rate of channel polarization"
    - "shannon theoretic limits on noisy compressive sampling"
    - "channel coding the road to channel capacity"

Connected through hyperedge HE-3 (induced by source paper "toward fast reliable communication at rates near capacity with gaussian noise"):
  with members:
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "necessary and sufficient conditions for sparsity pattern recovery"
    - "on the rate of channel polarization"

Connected through hyperedge HE-4 (induced by source paper "using distributed rate splitting game to approach rate region boundary of the gaussian interference channel"):
  with members:
    - "the two user gaussian interference channel a deterministic view"
    - "cooperative game theory and the gaussian interference channel"

Question: Please tell me which class the center node 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)