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 optimal load memory tradeoff of cache aided scalar linear function retrieval"):
  Abstract: Coded caching has the potential to greatly reduce network traffic by leveraging the cheap and abundant storage available in end-user devices so as to create multicast opportunities in the delivery phase. In the seminal work by Maddah-Ali and Niesen (MAN), the shared-link coded caching problem was formulated, where each user demands one file (i.e., single file retrieval). This paper generalizes the MAN problem so as to allow users to request scalar linear functions of the files. This paper proposes a novel coded delivery scheme that, based on MAN uncoded cache placement, is shown to allow for the decoding of arbitrary scalar linear functions of the files (on arbitrary finite fields). Interestingly, and quite surprisingly, it is shown that the load for cache-aided scalar linear function retrieval depends on the number of linearly independent functions that are demanded, akin to the cache-aided single-file retrieval problem where the load depends on the number of distinct file requests. The proposed scheme is optimal under the constraint of uncoded cache placement, in terms of worst-case load, and within a factor 2 otherwise. The key idea of this paper can be extended to all scenarios which the original MAN scheme has been extended to, including demand-private and/or device-to-device settings.

Includes members:
  Member "codedprivateml a fast and privacy preserving framework for distributed machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "on coded caching with private demands":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of device to device private caching with trusted server")
  Member "device to device private caching with trusted server":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a new design framework on device to device coded caching with optimal rate and significantly less subpacketizations")
  Member "private and secure distributed matrix multiplication with flexible communication load":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "entangled polynomial codes for secure private and batch distributed matrix multiplication breaking the cubic barrier")
  Member "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "on the fundamental limits of coded data shuffling for distributed learning systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "near optimal coded data shuffling for distributed learning")
  Member "near optimal coded data shuffling for distributed learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "heterogeneous computation assignments in coded elastic computing")

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)