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 the placement and delivery schemes for decentralized coded caching system"):
  Abstract: Network based on distributed caching of content is a new architecture to alleviate the ongoing explosive demands for rate of multi-media traffic. In caching networks, coded caching is a recently proposed technique that achieves significant performance gains compared to uncoded caching schemes. In this paper, we derive a lower bound on the average rate with a memory constraint for a family of caching allocation placement and a family of XOR cooperative delivery. The lower bound inspires us how placement and delivery affect the rate memory tradeoff. Based on the clues, we design a new placement and two new delivery algorithms. On one hand, the new placement scheme can allocate the cache more flexibly compared to grouping scheme. On the other hand, the new delivery can exploit more cooperative opportunities compared to the known schemes. The simulations validate our idea.

Includes members:
  Member "placement delivery array design through strong edge coloring of bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "on the placement delivery array design for centralized coded caching scheme":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "on the gap between decentralized and centralized coded caching schemes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit")
  Member "finite length analysis of caching aided coded multicasting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "coded caching for delay sensitive content":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decentralized asynchronous coded caching design and performance analysis in fog radio access networks")
  Member "hierarchical coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "decentralized coded caching attains order optimal memory rate tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)