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: "stochastic ordering of interferences in large scale wireless networks"
  Abstract: Stochastic orders are binary relations defined on probability distributions which capture intuitive notions like being larger or being more variable. This paper introduces stochastic ordering of interference distributions in large-scale networks modeled as point process. Interference is the main performance-limiting factor in most wireless networks, thus it is important to understand its statistics. Since closed-form results for the distribution of interference for such networks are only available in limited cases, interference of networks are compared using stochastic orders, even when closed form expressions for interferences are not tractable. We show that the interference from a large-scale network depends on the fading distributions with respect to the stochastic Laplace transform order. The condition for path-loss models is also established to have stochastic ordering between interferences. The stochastic ordering of interferences between different networks are also shown. Monte-Carlo simulations are used to supplement our analytical results.

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"
    - "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"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-2 (induced by source paper "outage probability in arbitrarily shaped finite wireless networks"):
  with members:
    - "distance distributions in regular polygons"
    - "transmission capacity of wireless networks"
    - "separating the effect of independent interference sources with rayleigh faded signal link outage analysis and applications"
    - "the outage probability of a finite ad hoc network in nakagami fading"
    - "an overview of the transmission capacity of wireless networks"
    - "interference and outage in clustered wireless ad hoc networks"
    - "distance distributions in finite uniformly random networks theory and applications"
    - "transmission capacity of ad hoc networks with spatial diversity"

Connected through hyperedge HE-3 (induced by source paper "downlink mimo hetnets modeling ordering results and performance analysis"):
  with members:
    - "downlink rate distribution in heterogeneous cellular networks under generalized cell selection"
    - "offloading in heterogeneous networks modeling analysis and design insights"
    - "modeling non uniform ue distributions in downlink cellular networks"
    - "analytical modeling of uplink cellular networks"
    - "load aware modeling and analysis of heterogeneous cellular networks"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"
    - "modeling heterogeneous network interference using poisson point processes"
    - "stochastic ordering based carrier to interference ratio analysis for the shotgun cellular systems"

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)