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 the capacity region for index coding"):
  Abstract: A new inner bound on the capacity region of the general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound relies on a random coding scheme and optimal decoding, and has a simple polymatroidal single-letter expression. The utility of the inner bound is demonstrated by examples that include the capacity region for all index coding problems with up to five messages (there are 9846 nonisomorphic ones).

Includes members:
  Member "index coding capacity how far can one go with only shannon inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "local graph coloring and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "embedded index coding")
  Member "an equivalence between network coding and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "embedded index coding")
  Member "simultaneous nonunique decoding is rate optimal":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "index coding an interference alignment perspective":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "optimal index codes with near extreme rates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches")
  Member "on linear index coding for random graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "index codes with minimum locality for three receiver unicast problems")
  Member "network coding is zero error always possible":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lossless source coding in the point to point multiple access and random access scenarios")

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)