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: "information theoretic capacity of clustered random networks"
  Abstract: We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shot-noise Cox process. We identify five different operational regimes, and for each regime we devise a communication strategy that allows to achieve a throughput to within a poly-logarithmic factor (in the number of nodes) of the maximum theoretical capacity.

Connected through hyperedge HE-1 (induced by source paper "laplace functional ordering of point processes in large scale wireless networks"):
  with members:
    - "fundamentals of modeling finite wireless networks using binomial point process"
    - "partition based caching in large scale sic enabled wireless networks"
    - "downlink mimo hetnets modeling ordering results and performance analysis"
    - "cognitive radio with random number of secondary number of users"
    - "stochastic ordering of interferences in large scale wireless networks"
    - "user association for load balancing in heterogeneous cellular networks"
    - "stochastic ordering based carrier to interference ratio analysis for the shotgun cellular systems"
    - "applications of stochastic ordering to wireless communications"

Connected through hyperedge HE-2 (induced by source paper "stochastic ordering of interferences in large scale wireless networks"):
  with members:
    - "applications of stochastic ordering to wireless communications"
    - "performance of interference alignment in clustered wireless ad hoc networks"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "interference and outage in clustered wireless ad hoc networks"

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)