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 "delivery secrecy tradeoff for cache enabled stochastic networks content placement optimization"):
  Abstract: Wireless caching has been widely recognized as a promising technique for efficient content delivery. In this paper, by taking different file secrecy levels into consideration, physical-layer security oriented content placement is optimized in a stochastic cache-enabled cellular network. We propose an analytical framework to investigate the nontrivial file delivery-secrecy tradeoff. Specifically, we first derive the closed-form expressions for the file hit and secrecy probabilities. The global optimal probabilistic content placement policy is then analytically derived in terms of hit probability maximization under file secrecy constraints. Numerical results are demonstrated to verify our analytical findings and show that the targeted file secrecy levels are crucial in balancing the file delivery-secrecy tradeoff.

Includes members:
  Member "cache enabled physical layer security for video streaming in backhaul limited cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "edge cache assisted secure low latency millimeter wave transmission")
  Member "on edge caching with secrecy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decentralized caching schemes and performance limits in two layer networks")
  Member "caching placement in stochastic wireless caching helper networks channel selection diversity via caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "cache enabled heterogeneous cellular networks optimal tier level content placement":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "optimal geographic caching in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online convex optimization for caching networks")
  Member "fundamental limits of caching with secure delivery":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on coded caching with private demands")
  Member "analysis and optimization of caching and multicasting in large scale cache enabled wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "living on the edge the role of proactive caching in 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing")

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)