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 "optimal placement delivery arrays with minimum number of rows"):
  Abstract: Coded caching scheme, which is an effective technique to reduce the load during peak traffic times, has recently become quite popular among the coding community. A placement delivery array (PDA in short) can be used to design a coded caching scheme. The number of rows of a PDA corresponds to the subpacketization level in the coded caching scheme. Thus, it is meaningful to construct the optimal PDAs with minimum number of rows. However, no one has yet proved that one of the previously known PDAs (or optimal PDAs) has minimum number of rows. We mainly focus on such optimal PDAs in this paper. We first prove that one class of the optimal PDAs by Maddah-Ali and Niesen has minimum number of rows. Next other two classes of optimal PDAs with minimum number of rows are obtained and proved from a new characterization of a PDA by means of a set of $3$ dimensional vectors and a new derived lower bound.

Includes members:
  Member "on the placement delivery array design for centralized coded caching scheme":
    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 "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs":
    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 "coded caching with low subpacketization levels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "symmetric uncoded caching schemes with low subpacketization levels")
  Member "fundamental limits of caching improved delivery rate cache capacity trade off":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  Member "wireless content caching for small cell and d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a unified framework for constructing centralized coded caching schemes")
  Member "caching and delivery via interference elimination":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "the optimal placement delivery arrays":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "some new bounds of placement delivery arrays")

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)