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 delivery array design for centralized coded caching scheme"):
  Abstract: Caching is a promising solution to satisfy the ever-increasing demands for the multi-media traffics. In caching networks, coded caching is a recently proposed technique that achieves significant performance gains over the uncoded caching schemes. However, to implement the coded caching schemes, each file has to be split into    $F$    packets, which usually increases exponentially with the number of users    $K$   . Thus, designing caching schemes that decrease the order of    $F$    is meaningful for practical implementations. In this paper, by reviewing the Ali-Niesen caching scheme, the placement delivery array (PDA) design problem is first formulated to characterize the placement issue and the delivery issue with a single array. Moreover, we show that, through designing appropriate PDA, new centralized coded caching schemes can be discovered. Second, it is shown that the Ali-Niesen scheme corresponds to a special class of PDA, which realizes the best coding gain with the least    $F$   . Third, we present a new construction of PDA for the centralized coded caching system, wherein the cache size    $M$    at each user (identical cache size is assumed at all users) and the number of files    $N$    satisfies    $M/N=1/q$    or    ${(q-1)}/{q}$    (   $q$    is an integer, such that    $q\geq 2$   ). The new construction can decrease the required    $F$    from the order    $O(e^{K\cdot (({M}/{N})\ln ({N}/{M}) +(1-({M}/{N}))\ln ~(N/(N-M))})$    of Ali-Niesen scheme to    $O(e^{K\cdot ({M}/{N})\ln \!\,({N}/\!{M})})$    or    $O(e^{K\cdot (1-({M}/\!{N}))\ln \!\,(N/(N-M))})$   , respectively, while the coding gain loss is only 1.

Includes members:
  Member "coded caching with low subpacketization levels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "symmetric uncoded caching schemes with low subpacketization levels")
  Member "on the optimality of uncoded cache placement":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "order optimal rate of caching and coded multicasting with random demands":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  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 "a framework of constructions of minimal storage regenerating codes with the optimal access update property":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a systematic construction of mds codes with small sub packetization level and near optimal repair bandwidth")
  Member "zigzag codes mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  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)