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 "on jamming against wireless networks"):
  Abstract: In this paper, we study jamming attacks against wireless networks. Specifically, we consider a network of base stations (BSs) or access points (APs) and investigate the impact of a fixed number of jammers that are randomly deployed according to a Binomial point process. We investigate the network performance in terms of: 1) the outage probability and 2) the error probability of a victim receiver in the downlink of this wireless network. We derive analytical expressions for both these metrics and discuss in detail how the jammer network must adapt to the various wireless network parameters in order to effectively attack the victim receivers. For instance, we will show that with only 1 jammer per BS/AP: 1) the outage probability of the wireless network can be increased from 1% (as seen in the non-jamming case) to 80% and 2) when retransmissions are used, the jammers cause the effective network activity factor (and hence the interference among the BSs) to be doubled. Furthermore, we show that the behavior of the jammer network as a function of the BS/AP density is not obvious. In particular, a non-trivial behavior is seen, which indicates that the number of jammers required to attack the wireless network must scale with the BS density only until a certain value beyond which it decreases. In the context of error probability of the victim receiver, we study whether or not some recent results related to jamming in the point-to-point link scenario can be extended to the case of jamming against wireless networks. Numerical results are presented to validate all the theoretical inferences presented.

Includes members:
  Member "towards a tractable analysis of localization fundamentals in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a tractable analysis of the improvement in unique localizability through collaboration")
  Member "fundamentals of throughput maximization with random arrivals for m2m communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "quality of service in wireless cellular networks subject to log normal shadowing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")
  Member "downlink rate distribution in heterogeneous cellular networks under generalized cell selection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "millimeter wave integrated access and backhaul in 5g performance analysis and design insights")
  Member "load aware modeling and analysis of heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an efficient requirement aware attachment policy for future millimeter wave vehicular networks")
  Member "modeling and analysis of k tier downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "throughput delay reliability tradeoff with arq in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "delay analysis of spatially coded mimo zfbf with retransmissions in random 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)