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: "outage local throughput and capacity of random wireless networks"
  Abstract: Outage probabilities and single-hop throughput are two important performance metrics that have been evaluated for certain specific types of wireless networks. However, there is a lack of comprehensive results for larger classes of networks, and there is no systematic approach that permits the convenient comparison of the performance of networks with different geometries and levels of randomness. The uncertainty cube is introduced to categorize the uncertainty present in a network. The three axes of the cube represent the three main potential sources of uncertainty in interference-limited networks: the node distribution, the channel gains (fading), and the channel access scheme (set of transmitting nodes). For the performance analysis, a new parameter, the so- called spatial contention, is defined. It measures the slope of the outage probability in an ALOHA network as a function of the transmit probability p at p = 0. Outage is defined as the event that the signal-to-interference ratio (SIR) is below a certain threshold in a given time slot. It is shown that the spatial contention is sufficient to characterize outage and throughput in large classes of wireless networks, corresponding to different positions on the uncertainty cube. Existing results are placed in this framework, and new ones are derived. Further, interpreting the outage probability as the SIR distribution, the ergodic capacity of unit-distance links is determined and compared to the throughput achievable for fixed (yet optimized) transmission rates.

Connected through hyperedge HE-1 (induced by source paper "modeling analysis and mitigation of dynamic botnet formation in wireless iot networks"):
  with members:
    - "secure and reconfigurable network design for critical information dissemination in the internet of battlefield things iobt"
    - "designing security aware incentives for computation offloading via device to device communication"
    - "an overview of the transmission capacity of wireless networks"

Connected through hyperedge HE-2 (induced by source paper "performance analysis of cooperative communications at road intersections using stochastic geometry tools"):
  with members:
    - "outage analysis of cooperative noma using maximum ratio combining at intersections"
    - "fine grained reliability for v2v communications around suburban and urban intersections"
    - "modeling and design of millimeter wave networks for highway vehicular communication"
    - "vehicle to vehicle communications with urban intersection path loss models"
    - "cooperative relaying under spatially and temporally correlated interference"
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "on the outage probability of the full duplex interference limited relay channel"
    - "dual branch mrc receivers under spatial interference correlation and nakagami fading"

Connected through hyperedge HE-3 (induced by source paper "lower bound on the localization error in infinite networks with random sensor locations"):
  with members:
    - "on localization of a non cooperative target with non coherent binary detectors"
    - "an overview of the transmission capacity of wireless networks"
    - "transmission capacity of ad hoc networks with spatial diversity"

Connected through hyperedge HE-4 (induced by source paper "sinr and throughput of dense cellular networks with stretched exponential path loss"):
  with members:
    - "effect of densification on cellular network performance with bounded pathloss model"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "ergodic spectral efficiency in mimo cellular networks"
    - "a primer on cellular network analysis using stochastic geometry"
    - "coverage and capacity scaling laws in downlink ultra dense cellular networks"
    - "study on the idle mode capability with los and nlos transmissions"
    - "unified stochastic geometry modeling and analysis of cellular networks in los nlos and shadowed fading"
    - "modeling cellular networks in fading environments with dominant specular components"

Connected through hyperedge HE-5 (induced by source paper "interference functionals in poisson networks"):
  with members:
    - "cooperative relaying under spatially and temporally correlated interference"
    - "managing interference correlation through random medium access"
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "a stochastic geometry analysis of inter cell interference coordination and intra cell diversity"
    - "dual branch mrc receivers under spatial interference correlation and nakagami fading"
    - "diversity polynomials for the analysis of temporal correlations in wireless networks"
    - "equivalence and comparison of heterogeneous cellular networks"
    - "packet travel times in wireless relay chains under spatially and temporally dependent interference"

Connected through hyperedge HE-6 (induced by source paper "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"):
  with members:
    - "full duplex mimo small cell networks performance analysis"
    - "outage analysis of full duplex architectures in 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"
    - "throughput analysis for wireless networks with full duplex radios"
    - "low complexity end to end performance optimization in mimo full duplex relay systems"
    - "hybrid full half duplex system analysis in heterogeneous wireless networks"
    - "pushing the limits of full duplex design and real time implementation"

Connected through hyperedge HE-7 (induced by source paper "cooperative relaying under spatially and temporally correlated interference"):
  with members:
    - "managing interference correlation through random medium access"
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "dual branch mrc receivers under spatial interference correlation and nakagami fading"
    - "cooperative relaying in a poisson field of interferers a diversity order analysis"
    - "diversity loss due to interference correlation"
    - "capacity bounds of half duplex gaussian cooperative interference channel"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-8 (induced by source paper "interference and sinr coverage in spatial non slotted aloha networks"):
  with members:
    - "equivalence and comparison of heterogeneous cellular networks"
    - "stochastic analysis of non slotted aloha in 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)