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 "caching and coded multicasting multiple groupcast index coding"):
  Abstract: The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the case of a single server (e.g., a base station) and multiple users, each of which caches segments of files in a finite library. Each user requests one (whole) file in the library and the server sends a common coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible codeword length to satisfy such requests. In this paper we consider the generalization to the case where each user places $L \geq 1$ requests. The obvious naive scheme consists of applying $L$ times the order-optimal scheme for a single request, obtaining a linear in $L$ scaling of the multicast codeword length. We propose a new achievable scheme based on multiple groupcast index coding that achieves a significant gain over the naive scheme. Furthermore, through an information theoretic converse we find that the proposed scheme is approximately optimal within a constant factor of (at most) $18$.

Includes members:
  Member "wireless device to device caching networks basic principles and system performance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "on the average performance of caching and coded multicasting with random demands":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate distortion memory trade offs in heterogeneous caching networks")
  Member "caching eliminates the wireless bottleneck in video aware wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "individual preference aware caching policy design in wireless d2d networks")
  Member "duality codes and the integrality gap bound for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperative multi sender index coding")
  Member "the throughput outage tradeoff of wireless one hop caching networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mobile communications computing and caching resources optimization for coded caching with device computing")
  Member "fundamental limits of distributed caching in d2d wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery")
  Member "asymptotic laws for joint content replication and delivery in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "decentralized coded caching attains order optimal memory rate tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)