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 cancellation for multi antenna mobile ad hoc networks"):
  Abstract: Interference between nodes is a critical impairment in mobile ad hoc networks (MANETs). This paper studies the role of multiple antennas in mitigating such interference. Specifically, a network is studied in which receivers apply zero-forcing beamforming to cancel the strongest interferers. Assuming a network with Poisson distributed transmitters and independent Rayleigh fading channels, the transmission capacity is derived, which gives the maximum number of successful transmissions per unit area. Mathematical tools from stochastic geometry are applied to obtain the asymptotic transmission capacity scaling and characterize the impact of inaccurate channel state information (CSI). It is shown that, if each node cancels L interferers, the transmission capacity decreases as the outage probability to the power of 1/(L+1) as the outage probability vanishes. For fixed outage probability, as L grows, the transmission capacity increases as L to the power of (1-2/alpha) where alpha is the path-loss exponent. Moreover, CSI inaccuracy is shown to have no effect on the transmission capacity scaling as the outage probability vanishes, provided that the CSI training sequence has an appropriate length, which we derived. Numerical results suggest that canceling merely one interferer by each node increases the transmission capacity by an order of magnitude or more, even when the CSI is imperfect.

Includes members:
  Member "random access transport capacity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal and suboptimal routing based on partial csi in random ad hoc networks")
  Member "bandwidth partitioning in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reliability and local delay in wireless networks does bandwidth partitioning help")
  Member "spatial interference cancelation for mobile ad hoc networks imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatial throughput of mobile ad hoc networks powered by energy harvesting")
  Member "transmission capacity of ad hoc networks with spatial diversity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (induced by source paper "on off switched interference alignment for diversity multiplexing tradeoff improvement in the 2 user x network with two antennas")
  Member "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)