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 the design of large scale wireless systems with detailed proofs"
  Abstract: In this paper, we consider the downlink of large OFDMA-based networks and study their performance bounds as a function of the number of - transmitters $B$, users $K$, and resource-blocks $N$. Here, a resource block is a collection of subcarriers such that all such collections, that are disjoint have associated independently fading channels. In particular, we analyze the expected achievable sum-rate as a function of above variables and derive novel upper and lower bounds for a general spatial geometry of transmitters, a truncated path-loss model, and a variety of fading models. We establish the associated scaling laws for dense and extended networks, and propose design guidelines for the regulators to guarantee various QoS constraints and, at the same time, maximize revenue for the service providers. Thereafter, we develop a distributed resource allocation scheme that achieves the same sum-rate scaling as that of the proposed upper bound for a wide range of $K, B, N$. Based on it, we compare low-powered peer-to-peer networks to high-powered single-transmitter networks and give an additional design principle. Finally, we also show how our results can be extended to the scenario where each of the $B$ transmitters have $M (>1)$ co-located antennas.

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)