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 bounds of placement delivery arrays"):
  Abstract: Coded caching scheme is a technique which reduce the load during peak traffic times in a wireless network system. Placement delivery array (PDA in short) was first introduced by Yan et al.. It can be used to design coded caching scheme. In this paper, we prove some lower bounds of PDA on the element and some lower bounds of PDA on the column. We also give some constructions for optimal PDA.

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 "optimal placement delivery arrays with minimum number of rows":
    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 "a new converse bound for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "fundamental limits of caching improved delivery rate cache capacity trade off":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  Member "centralized coded caching schemes a hypergraph theoretical approach":
    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 "the optimal placement delivery arrays":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal placement delivery arrays with minimum number of rows")
  Member "new results for traitor tracing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bounds on traceability schemes")
  Member "a note on the fundamental limits of coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of coded caching the memory rate pair k 1 1 k 1 k 1")

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)