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: "spatio temporal modeling for massive and sporadic access"
  Abstract: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integration of mMTC. Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism. In this paper, we propose and define the notion of massive and sporadic access (MSA) to quantitatively describe the scenario of mMTC. We evaluate the correlation of interference and the correlation of successful transmission events, and verify that these correlations are negligible in the scenario of MSA. In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time instants. Furthermore, we compare the original static network and the equivalent network with high mobility to demonstrate the effectiveness of the proposed approximation method. The proposed approach is promising for providing a convenient and general solution to evaluate and design the mMTC with massive and sporadic access.

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)