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 "a performance analysis of multi hop ad hoc networks with adaptive antenna array systems"):
  Abstract: Based on a stochastic geometry framework, we establish an analysis of the multi-hop spatial reuse aloha protocol (MSR-Aloha) in ad hoc networks. We compare MSR-Aloha to a simple routing strategy, where a node selects the next relay of the treated packet as to be its nearest receiver with a forward progress toward the final destination (NFP). In addition, performance gains achieved by employing adaptive antenna array systems are quantified in this paper. We derive a tight upper bound on the spatial density of progress of MSR-Aloha. Our analytical results demonstrate that the spatial density of progress scales as the square root of the density of users, and the optimal contention density (that maximizes the spatial density of progress) is independent of the density of users. These two facts are consistent with the observations of Baccelli et al., established through an analytical lower bound and through simulations.

Includes members:
  Member "performance of optimum combining in a poisson field of interferers and rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless powered asynchronous backscatter networks with sporadic short packets performance analysis and optimization")
  Member "transmission capacity of ad hoc networks with spatial diversity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")

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)