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 scalability of wireless networks a practical primer for large scale cooperation"
  Abstract: An intuitive overview of the scalability of a variety of types of wireless networks is presented. Simple heuris- tic arguments are demonstrated here for scaling laws presented in other works, as well as for conditions not previously considered in the literature. Unicast and multicast messages, topology, hierarchy, and e?ects of reliability protocols are discussed. We show how two key factors, bottlenecks and erasures, can often domi- nate the network scaling behavior. Scaling of through- put or delay with the number of transmitting nodes, the number of receiving nodes, and the ?le size is described.

Connected through hyperedge HE-1 (induced by source paper "capacity scaling of cellular networks impact of bandwidth infrastructure density and number of antennas"):
  with members:
    - "unified capacity limit of non coherent wideband fading channels"
    - "understanding noise and interference regimes in 5g millimeter wave cellular networks"
    - "spectrum sharing for device to device communication in cellular networks"
    - "demystifying the scaling laws of dense wireless networks no linear scaling in practice"
    - "tractable model for rate in self backhauled millimeter wave cellular networks"
    - "massive mimo for next generation wireless systems"
    - "improving third party relaying for lte a a realistic simulation approach"
    - "scaling laws for infrastructure single and multihop wireless networks in wideband regimes"

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)