human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "spatial interference cancelation for mobile ad hoc networks imperfect csi"):
  Abstract: Interference between nodes directly limits the capacity of mobile ad hoc networks. This paper focuses on spatial interference cancellation with perfect channel state information (CSI), and analyzes the corresponding network capacity. Specifically, by using multiple antennas, zero-forcing beamforming is applied at each receiver for canceling the strongest interferers. Given spatial interference cancellation, the network transmission capacity is analyzed in this paper, which is defined as the maximum transmitting node density under constraints on outage and the signal-to-interference-plus-noise ratio. Assuming that the locations of network nodes are Poisson distributed and spatially i.i.d. Rayleigh fading channels, mathematical tools from stochastic geometry are applied for deriving scaling laws for transmission capacity. Specifically, for a large number of antennas per node, the transmission capacity scales with the number of antennas raised to a fractional power, which depends only on the path-loss exponent. Moreover, for small target outage probability, transmission capacity is proved to increase following a power law, where the exponent is the inverse of the size of antenna array or larger depending on the pass-loss exponent. As shown by simulations, spatial interference cancellation increases transmission capacity by an order of magnitude or more even if only one extra antenna is added to each node.

Includes members:
  Member "transmission capacity of ad hoc networks with spatial diversity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "the effect of fading channel inversion and threshold scheduling on ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hiding communications in awgn channels and thz band with interference uncertainty")
  Member "interference alignment and the degrees of freedom for the k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on off switched interference alignment for diversity multiplexing tradeoff improvement in the 2 user x network with two antennas")
  Member "mimo broadcast channels with finite rate feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dl based csi feedback and cooperative recovery in massive mimo")
  Member "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wireless mesh networking with devices equipped with multi connectivity")

Question: Please tell me which class the source paper 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)