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 "physical layer security in cellular networks a stochastic geometry approach"):
  Abstract: This paper studies the information-theoretic secrecy performance in large-scale cellular networks based on a stochastic geometry framework. The locations of both base stations and mobile users are modeled as independent two-dimensional Poisson point processes. We consider two important features of cellular networks, namely, information exchange between base stations and cell association, to characterize their impact on the achievable secrecy rate of an arbitrary downlink transmission with a certain portion of the mobile users acting as potential eavesdroppers. In particular, tractable results are presented under diverse assumptions on the availability of eavesdroppers' location information at the serving base station, which captures the benefit from the exchange of the location information between base stations.

Includes members:
  Member "modeling and analysis of k tier downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "downlink capacity and base station density in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ran slicing for massive iot and bursty urllc service multiplexing analysis and optimization")
  Member "on the throughput cost of physical layer security in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secrecy transmission in large scale uav enabled wireless networks")
  Member "a tractable approach to coverage and rate in cellular networks":
    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 "continuum percolation in the intrinsically secure communications graph":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "the secrecy graph and some of its properties":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure communication in dynamic wireless ad hoc networks")
  Member "a geometric interpretation of fading in wireless networks theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secrecy analysis of random mimo wireless networks over alpha mu fading channels")

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)