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 "pilot spoofing attack by multiple eavesdroppers"):
  Abstract: In this paper, we investigate the design of a pilot spoofing attack (PSA) carried out by multiple single-antenna eavesdroppers (Eves) in a downlink time-division duplex (TDD) system, where a multiple antenna base station (BS) transmits confidential information to a single-antenna legitimate user (LU). During the uplink channel training phase, multiple Eves collaboratively impair the channel acquisition of the legitimate link, aiming at maximizing the wiretapping signal-to-noise ratio (SNR) in the subsequent downlink data transmission phase. Two different scenarios are investigated: (1) the BS is unaware of the PSA, and (2) the BS attempts to detect the presence of the PSA. For both scenarios, we formulate wiretapping SNR maximization problems. For the second scenario, we also investigate the probability of successful detection and constrain it to remain below a pre-designed threshold. The two resulting optimization problems can be unified into a more general non-convex optimization problem, and we propose an efficient algorithm based on the minorization-maximization (MM) method and the alternating direction method of multipliers (ADMM) to solve it. The proposed MM-ADMM algorithm is shown to converge to a stationary point of the general problem. In addition, we propose a semidefinite relaxation (SDR) method as a benchmark to evaluate the efficiency of the MM-ADMM algorithm. Numerical results show that the MM-ADMM algorithm achieves near-optimal performance and is computationally more efficient than the SDRbased method.

Includes members:
  Member "admm based fast algorithm for multi group multicast beamforming in large scale wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bandwidth gain from mobile edge computing and caching in wireless multicast systems")
  Member "impact of artificial noise on cellular networks a stochastic geometry approach":
    also connected through other hyperedges:
      (none)
  Member "an algorithm for global maximization of secrecy rates in gaussian mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure mimo transmission via intelligent reflecting surface")
  Member "secure massive mimo transmission with an active eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "physical layer security in massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vulnerabilities of massive mimo systems to pilot contamination attacks")
  Member "secret key agreement with large antenna arrays under the pilot contamination attack":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "data aided secure massive mimo transmission under the pilot contamination attack")
  Member "securing massive mimo at the physical layer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "secure communication over parallel relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the arbitrarily varying relay channel")

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)