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 "a novel index coding scheme and its application to coded caching"):
  Abstract: This paper proposes a novel achievable scheme for the index problem and applies it to the caching problem. Index coding and caching are noiseless broadcast channel problems where receivers have message side information.In the index coding problem the side information sets are fixed, while in the caching problem the side information sets correspond the cache contents, which are under the control of the system designer. The proposed index coding scheme, based on distributed source coding and non-unique decoding,is shown to strictly enlarge the rate region achievable by composite coding.The novel index coding scheme applied to the caching problem is then shown to match an outer bound (previously proposed by the authors and also based on known results for the index coding problem) under the assumption of uncoded cache placement/prefetching.

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 "on the capacity for distributed index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "information theoretic caching the multi user case":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery")
  Member "local partial clique covers for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on locally decodable index codes")
  Member "a rate distortion approach to caching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rate distortion memory trade offs in heterogeneous caching networks")
  Member "on caching with more users than files":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "on the optimality of uncoded cache placement":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "a rate distortion approach to index coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cooperative multi sender index coding")

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)