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: "separating the effect of independent interference sources with rayleigh faded signal link outage analysis and applications"
  Abstract: We show that, for independent interfering sources and a signal link with exponentially distributed received power, the total probability of outage can be decomposed as a simple expression of the outages from the individual interfering sources. We give a mathematical proof of this result, and discuss some immediate implications, showing how it results in important simplifications to statistical outage analysis. We also discuss its application to two active topics of study: spectrum sharing and sum of interference powers (e.g., lognormal) analysis.

Connected through hyperedge HE-1 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff"):
  with members:
    - "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities"
    - "jointly optimal spatial channel assignment and power allocation for mimo swipt systems"
    - "optimal power allocation and active interference mitigation for spatial multiplexed mimo cognitive systems"
    - "simultaneous spectrum sensing and data reception for cognitive spatial multiplexing distributed systems"
    - "full duplex mimo small cell networks with interference cancellation"
    - "practical non linear energy harvesting model and resource allocation for swipt systems"
    - "energy efficiency in massive mimo based 5g networks opportunities and challenges"
    - "full duplex wireless powered relay with self energy recycling"

Connected through hyperedge HE-2 (induced by source paper "outage probability in arbitrarily shaped finite wireless networks"):
  with members:
    - "distance distributions in regular polygons"
    - "stochastic ordering of interferences in large scale wireless networks"
    - "transmission capacity of wireless networks"
    - "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 "mobile communication systems in the presence of fading shadowing noise and interference"):
  with members:
    - "capacity analysis of a multi cell multi antenna cooperative cellular network with co channel interference"
    - "a tractable approach to coverage and rate in 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.NI(Networking and Internet Architecture)