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 "decentralized caching schemes and performance limits in two layer networks"):
  Abstract: We study the decentralized caching scheme in a two-layer network, which includes a sever, multiple helpers, and multiple users. Basically, the proposed caching scheme consists of two phases, i.e, placement phase and delivery phase. In the placement phase, each helper/user randomly and independently selects contents from the server and stores them into its memory. In the delivery phase, the users request contents from the server, and the server satisfies each user through a helper. Different from the existing caching scheme, the proposed caching scheme takes into account the pre-stored contents at both helpers and users in the placement phase to design the delivery phase. Meanwhile, the proposed caching scheme exploits index coding in the delivery phase and leverages multicast opportunities, even when different users request distinct contents. Besides, we analytically characterize the performance limit of the proposed caching scheme, and show that the achievable rate region of the proposed caching scheme lies within constant margins to the information-theoretic optimum. In particular, the multiplicative and additive factors are carefully sharpened to be $\frac{1}{48}$ and $4$ respectively, both of which are better than the state of arts. Finally, simulation results demonstrate the advantage of the proposed caching scheme compared with the state of arts.

Includes members:
  Member "riding on the primary a new spectrum sharing paradigm for wireless powered iot devices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint time scheduling and transaction fee selection in blockchain based rf powered backscatter cognitive radio network")
  Member "low subpacketization schemes for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of caching in heterogeneous networks with uncoded prefetching")
  Member "modeling analysis and optimization of coded caching in small cell networks":
    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 "on edge caching with secrecy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure and energy efficient transmissions in cache enabled heterogeneous cellular networks performance analysis and optimization")
  Member "decentralized coded caching with distinct cache capacities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an approximation algorithm for optimal clique cover delivery in coded caching")
  Member "improved approximation of storage rate tradeoff for caching with multiple demands":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval")
  Member "fundamental limits of secretive coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subpacketization in coded caching with demand privacy")
  Member "caching aided coded multicasting with multiple random requests":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval")

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)