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 "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1"):
  Abstract: We provide an open source toolbox at this https URL to conduct computer-aided investigation on the fundamental limits of information systems. The toolbox relies on either Gurobi or Cplex as the linear program solving engine. The program can read a problem description file, and then fulfill the following tasks: 1) compute a bound for a given linear combination of information measures; 2) efficiently compute a polytope tradeoff outer bound between two information quantities; and 3) produce a proof (as a weighted sum of known information inequalities). This technical report provides an overview of this toolbox, a detailed description of the syntax of the problem description file, and a few example use cases.

Includes members:
  Member "caching and delivery via interference elimination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "symmetry outer bounds and code constructions a computer aided investigation on the fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery")
  Member "multilevel diversity coding with regeneration":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point")
  Member "characterizing the rate region of the 4 3 3 exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "multilevel diversity coding systems rate regions codes computation forbidden minors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the explicit coding rate region of symmetric multilevel diversity coding")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "a survey on network codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")

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)