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: "the spatial outage capacity of wireless networks"
  Abstract: We address a fundamental question in wireless networks that, surprisingly, has not been studied before: what is the maximum density of concurrently active links that satisfy a certain outage constraint? We call this quantity the spatial outage capacity (SOC), give a rigorous definition, and analyze it for Poisson bipolar networks with ALOHA. Specifically, we provide exact analytical and approximate expressions for the density of links satisfying an outage constraint and give simple upper and lower bounds on the SOC. In the high-reliability regime where the target outage probability is close to zero, we obtain an exact closed-form expression of the SOC, which reveals the interesting and perhaps counter-intuitive result that all transmitters need to be always active to achieve the SOC, i.e., the transmit probability needs to be set to 1 to achieve the SOC.

Connected through hyperedge HE-1 (induced by source paper "reliability and local delay in wireless networks does bandwidth partitioning help"):
  with members:
    - "the meta distribution of the sir in poisson bipolar and cellular networks"
    - "managing interference correlation through random medium access"
    - "access point density and bandwidth partitioning in ultra dense wireless networks"
    - "a new phase transitions for local delays in manets"
    - "bandwidth partitioning in decentralized wireless networks"

Connected through hyperedge HE-2 (induced by source paper "per link reliability and rate control two facets of the sir meta distribution"):
  with members:
    - "efficient calculation of meta distributions and the performance of user percentiles"
    - "the meta distribution of the sir in poisson bipolar and cellular networks"

Connected through hyperedge HE-3 (induced by source paper "sir meta distribution of k tier downlink heterogeneous cellular networks with cell range expansion"):
  with members:
    - "efficient calculation of meta distributions and the performance of user percentiles"
    - "the meta distribution of the sir for cellular networks with power control"
    - "ergodic spectral efficiency in mimo cellular networks"
    - "asymptotics and approximation of the sir distribution in general cellular networks"
    - "the meta distribution of the sir in poisson bipolar and cellular networks"
    - "asymptotic deployment gain a simple approach to characterize the sinr distribution in general cellular networks"
    - "the mean interference to signal ratio and its key role in cellular and amorphous networks"
    - "the performance of successive interference cancellation in random wireless networks"

Connected through hyperedge HE-4 (induced by source paper "optimal coverage and rate in downlink cellular networks a sir meta distribution based approach"):
  with members:
    - "sir meta distribution of k tier downlink heterogeneous cellular networks with cell range expansion"
    - "downlink cellular network analysis with los nlos propagation and elevated base stations"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "the meta distribution of the sir for cellular networks with power control"
    - "please lower small cell antenna heights in 5g"
    - "propagation path loss models for 5g urban micro and macro cellular scenarios"
    - "performance impact of los and nlos transmissions in dense cellular networks"
    - "the meta distribution of the sir in poisson bipolar and cellular 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)