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: "on node density outage probability tradeoff in wireless networks"
  Abstract: A statistical model of interference in wireless networks is considered, which is based on the traditional propagation channel model and a Poisson model of random spatial distribution of nodes in 1-D, 2-D and 3-D spaces with both uniform and non-uniform densities. The power of nearest interferer is used as a major performance indicator, instead of a traditionally-used total interference power, since at the low outage region, they have the same statistics so that the former is an accurate approximation of the latter. This simplifies the problem significantly and allows one to develop a unified framework for the outage probability analysis, including the impacts of complete/partial interference cancelation, of different types of fading and of linear filtering, either alone or in combination with each other. When a given number of nearest interferers are completely canceled, the outage probability is shown to scale down exponentially in this number. Three different models of partial cancelation are considered and compared via their outage probabilities. The partial cancelation level required to eliminate the impact of an interferer is quantified. The effect of a broad class of fading processes (including all popular fading models) is included in the analysis in a straightforward way, which can be positive or negative depending on a particular model and propagation/system parameters. The positive effect of linear filtering (e.g. by directional antennas) is quantified via a new statistical selectivity parameter. The analysis results in formulation of a tradeoff relationship between the network density and the outage probability, which is a result of the interplay between random geometry of node locations, the propagation path loss and the distortion effects at the victim receiver.

Connected through hyperedge HE-1 (induced by source paper "generalized interference alignment part ii application to wireless secrecy"):
  with members:
    - "the feasibility conditions for interference alignment in mimo networks"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "on cooperative relaying schemes for wireless physical layer security"
    - "cooperative jamming for secure communications in mimo relay networks"
    - "outage probability of general ad hoc networks in the high reliability regime"
    - "ergodic secret alignment"
    - "on feasibility of interference alignment in mimo interference networks"

Connected through hyperedge HE-2 (induced by source paper "successive interference cancellation in heterogeneous cellular networks"):
  with members:
    - "the performance of successive interference cancellation in random wireless networks"
    - "sinr based k coverage probability in cellular networks with arbitrary shadowing"
    - "equivalence and comparison of heterogeneous cellular networks"
    - "offloading in heterogeneous networks modeling analysis and design insights"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"
    - "user association for load balancing in heterogeneous cellular networks"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "transmission capacity of wireless networks"

Connected through hyperedge HE-3 (induced by source paper "on convexity of error rates in digital communications"):
  with members:
    - "error rates of capacity achieving codes are convex"
    - "error rates of the maximum likelihood detector for arbitrary constellations convex concave behavior and applications"
    - "bit error rate is convex at high snr"
    - "log concavity property of the error probability with application to local bounds for wireless communications"
    - "on optimum power allocation for the v blast"
    - "symbol error rates of maximum likelihood detector convex concave behavior and applications"

Connected through hyperedge HE-4 (induced by source paper "throughput analysis of cognitive wireless networks with poisson distributed nodes based on location information"):
  with members:
    - "transmission capacity of wireless networks"
    - "high sir transmission capacity of wireless networks with general fading and node distribution"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"
    - "spatial interference cancellation for multi antenna mobile ad hoc networks"
    - "rethinking information theory for mobile ad hoc networks"
    - "femtocell networks a survey"

Connected through hyperedge HE-5 (induced by source paper "transmission capacity of wireless networks"):
  with members:
    - "downlink sdma with limited feedback in interference limited wireless networks"
    - "high sir transmission capacity of wireless networks with general fading and node distribution"
    - "multi antenna communication in ad hoc networks achieving mimo gains with simo transmission"
    - "open loop spatial multiplexing and diversity communications in ad hoc networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"
    - "an overview of the transmission capacity of wireless networks"
    - "random access transport capacity"

Connected through hyperedge HE-6 (induced by source paper "performance of optimum combining in a poisson field of interferers and rayleigh fading channels"):
  with members:
    - "spatial interference cancellation for multi antenna mobile ad hoc networks"
    - "on capacity of wireless ad hoc networks with mimo mmse receivers"
    - "transmission capacity of ad hoc networks with spatial diversity"

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)