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: "tdma achieves the optimal diversity gain in relay assisted cellular networks"
  Abstract: In multi-access wireless networks, transmission scheduling is a key component that determines the efficiency and fairness of wireless spectrum allocation. At one extreme, greedy opportunistic scheduling that allocates airtime to the user with the largest instantaneous channel gain achieves the optimal spectrum efficiency and transmission reliability but the poorest user-level fairness. At the other extreme, fixed TDMA scheduling achieves the fairest airtime allocation but the lowest spectrum efficiency and transmission reliability. To balance the two competing objectives, extensive research efforts have been spent on designing opportunistic scheduling schemes that reach certain tradeoff points between the two extremes. In this paper and in contrast to the conventional wisdom, we find that in relay-assisted cellular networks, fixed TDMA achieves the same optimal diversity gain as greedy opportunistic scheduling. In addition, by incorporating very limited opportunism, a simple relaxed-TDMA scheme asymptotically achieves the same optimal system reliability in terms of outage probability as greedy opportunistic scheduling. This reveals a surprising fact: transmission reliability and user fairness are no longer contradicting each other in relay-assisted systems. They can be both achieved by the simple TDMA schemes. For practical implementations, we further propose a fully distributed algorithm to implement the relaxed-TDMA scheme. Our results here may find applications in the design of next-generation wireless communication systems with relay architectures such as LTE-advanced and WiMAX.

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.NI(Networking and Internet Architecture)