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 "some new constructions of coded caching schemes with reduced subpacketization"):
  Abstract: First, a new perspective based on binary matrices of placement delivery array (PDA) design was introduced, by which the PDA design problem can be simplified. From this new perspective, and based on some families of combinatorial designs, new schemes with low subpacketization for centralized coded caching problem were constructed. We also give a technique for constructing new coded caching scheme from known schemes based on direct product of PDAs.

Includes members:
  Member "coded caching based on combinatorial designs":
    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 "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "coded caching via line graphs of bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "placement delivery array design through strong edge coloring of bipartite graphs":
    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 "on the placement delivery array design for centralized coded caching scheme":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "coded caching schemes with reduced subpacketization from linear block codes":
    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 "constructions of coded caching schemes with flexible memory size":
    also connected through other hyperedges:
      (none)
  Member "centralized coded caching schemes a hypergraph theoretical approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")

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)