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: "cell associations that maximize the average uplink downlink degrees of freedom"
  Abstract: We study the problem of associating mobile terminals to base stations in a linear interference network, with the goal of maximizing the average rate achieved over both the uplink and downlink sessions. The cell association decision is made at a centralized cloud level, with access to global network topology information. More specifically, given the constraint that each mobile terminal can be associated to a maximum of N base stations at once, we characterize the maximum achievable pre-log factor (degrees of freedom) and the corresponding cell association pattern. Interestingly, the result indicates that for the case where N > 1, the optimal cell association guarantees the achievability of the maximum uplink rate even when optimizing for the uplink alone, and for the case where N=1, the optimal cell association is that of the downlink. Hence, this work draws attention to the question of characterizing network topologies for which the problem can be simplified by optimizing only for the uplink or only for the downlink.

Connected through hyperedge HE-1 (induced by source paper "joint uplink downlink cell associations for interference networks with local connectivity"):
  with members:
    - "conferencing in wyner s asymmetric interference network effect of number of rounds"
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "degrees of freedom in wireless interference networks with cooperative transmission and backhaul load constraints"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "performance of cloud radio networks"
    - "degrees of freedom of interference channels with comp transmission and reception"

Connected through hyperedge HE-2 (induced by source paper "degrees of freedom in wireless interference networks with cooperative transmission and backhaul load constraints"):
  with members:
    - "layered downlink precoding for c ran systems with full dimensional mimo"
    - "conferencing in wyner s asymmetric interference network effect of number of rounds"
    - "network mimo transmitters with no csi can still be very useful"
    - "cloud based topological interference management a case with no cooperative transmission gain"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "performance of cloud radio networks"
    - "topological interference management with transmitter cooperation"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"

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)