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: "on tdma optimality in locally connected networks with no csit"
  Abstract: In this work, we study scenarios of wireless networks where using simple Time-Division-Multiple-Access (TDMA) is optimal if no channel state information is available at the transmitters (no CSIT). We consider single-hop locally connected interference networks where each transmitter is connected to the receiver that has the same index as well as L succeeding receivers. The considered rate criterion is the per user Degrees of Freedom as the number of transmitter-receiver pairs goes to infinity. For the case when L=1, it was shown in previous work that TDMA is optimal, even if each message can be available at multiple transmitters and linear cooperation schemes are allowed. Here, we extend this conclusion to the case where L=2, by proving optimality of TDMA in this case as well. We then study the problem for general values of L without allowing for cooperative transmission. We prove optimality of TDMA when each transmitter is serving the receiver with the same index, and finally conjecture - based on an example - that the same conclusion applies even if each receiver can be served by any single transmitter connected to it.

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)