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: "overhead aware distributed csi selection in the mimo interference channel"
  Abstract: We consider a MIMO interference channel in which the transmitters and receivers operate in frequency-division duplex mode. In this setting, interference management through coordinated transceiver design necessitates channel state information at the transmitters (CSI-T). The acquisition of CSI-T is done through feedback from the receivers, which entitles a loss in degrees of freedom, due to training and feedback. This loss increases with the amount of CSI-T. In this work, after formulating an overhead model for CSI acquisition at the transmitters, we propose a distributed mechanism to find for each transmitter a subset of the complete CSI, which is used to perform interference management. The mechanism is based on many-to-many stable matching. We prove the existence of a stable matching and exploit an algorithm to reach it. Simulation results show performance improvement compared to full and minimal CSI-T.

Connected through hyperedge HE-1 (induced by source paper "distributed long term base station clustering in cellular networks using coalition formation"):
  with members:
    - "adaptive pilot clustering in heterogeneous massive mimo networks"
    - "globally optimal base station clustering in interference alignment based multicell networks"
    - "cooperative base station coloring for pair wise multi cell coordination"
    - "interference alignment aided base station clustering using coalition formation"
    - "what will 5g be"
    - "on the feasibility of linear interference alignment for mimo interference broadcast channels with constant coefficients"
    - "coalitional games in partition form for joint spectrum sensing and access in cognitive radio networks"
    - "fundamental limits of cooperation"

Connected through hyperedge HE-2 (induced by source paper "interference alignment aided base station clustering using coalition formation"):
  with members:
    - "coalitional games in partition form for joint spectrum sensing and access in cognitive radio networks"
    - "fundamental limits of cooperation"
    - "user partitioning for less overhead in mimo interference channels"
    - "on feasibility of interference alignment in mimo interference networks"
    - "interference alignment with analog channel state feedback"
    - "on feasibility of interference alignment in mimo interference networks"

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)