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 "placement delivery array design for combination networks with edge caching"):
  Abstract: A major limitation for implementing coded caching techniques into practical systems, are their high subpacketization levels. For the simple network with a single server and multiple users with cache memories, Yan et al. proposed an alternative scheme that requires slightly larger link rates but significantly reduces the subpacketization level. The main contribution of this paper are three low-subpacketization schemes for combination networks, i.e. for networks with a single server, multiple relays, and multiple users with cache memories that are connected to subsets of relays. One of the schemes achieves the cutset lower bound on the link rate when the cache memories are sufficiently large. Our other two schemes apply only to resolvable combination networks. For these networks, the new schemes perform close to the currently best-known coded caching schemes for a wide range of cache sizes while having significantly reduced subpacketization levels. These schemes are obtained by extending placement delivery arrays (PDA), proposed by Yan et al. to combination networks. Specifically, we define the class of combinational PDAs (C-PDA) to characterize the caching schemes for combination network with a single array.

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 combination networks with cache aided relays and users":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved constructions of coded caching schemes for combination networks")
  Member "a novel asymmetric coded placement in combination networks with end user caches":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved constructions of coded caching schemes for combination networks")
  Member "low subpacketization schemes for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of caching in heterogeneous networks with uncoded prefetching")
  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 "combination networks with or without secrecy constraints the impact of caching relays":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on coded caching with private demands")
  Member "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs":
    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 "scalable content delivery with coded caching in multi antenna fading channels":
    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)