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 "device to device coded caching with distinct cache sizes"):
  Abstract: This paper considers a cache-aided device-to-device (D2D) system where the users are equipped with cache memories of different size. During low traffic hours, a server places content in the users' cache memories, knowing that the files requested by the users during peak traffic hours will have to be delivered by D2D transmissions only. The worst-case D2D delivery load is minimized by jointly designing the uncoded cache placement and linear coded D2D delivery. Next, a novel lower bound on the D2D delivery load with uncoded placement is proposed and used in explicitly characterizing the minimum D2D delivery load (MD2DDL) with uncoded placement for several cases of interest. In particular, having characterized the MD2DDL for equal cache sizes, it is shown that the same delivery load can be achieved in the network with users of unequal cache sizes, provided that the smallest cache size is greater than a certain threshold. The MD2DDL is also characterized in the small cache size regime, the large cache size regime, and the three-user case. Comparisons of the server-based delivery load with the D2D delivery load are provided. Finally, connections and mathematical parallels between cache-aided D2D systems and coded distributed computing (CDC) systems are discussed.

Includes members:
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "device to device secure coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on coded caching with private demands")
  Member "on coded caching with heterogeneous distortion requirements":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rate distortion memory trade offs in heterogeneous caching networks")
  Member "coded caching for heterogeneous systems an optimization perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases")
  Member "coded caching with heterogeneous cache sizes and link qualities the two user case":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the fundamental limits of fog ran cache aided networks with downlink and sidelink communications")
  Member "optimization of heterogeneous coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the dynamic centralized coded caching design")
  Member "coded caching in partially cooperative d2d communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery")
  Member "a novel index coding scheme and its application to coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "rate memory trade off for multi access coded caching with uncoded placement")

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)