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 "optimal index codes via a duality between index coding and network coding"):
  Abstract: In Index Coding, the goal is to use a broadcast channel as efficiently as possible to communicate information from a source to multiple receivers which can possess some of the information symbols at the source as side-information. In this work, we present a duality relationship between index coding (IC) and multiple-unicast network coding (NC). It is known that the IC problem can be represented using a side-information graph $G$ (with number of vertices $n$ equal to the number of source symbols). The size of the maximum acyclic induced subgraph, denoted by $MAIS$ is a lower bound on the \textit{broadcast rate}. For IC problems with $MAIS=n-1$ and $MAIS=n-2$, prior work has shown that binary (over ${\mathbb F}_2$) linear index codes achieve the $MAIS$ lower bound for the broadcast rate and thus are optimal. In this work, we use the the duality relationship between NC and IC to show that for a class of IC problems with $MAIS=n-3$, binary linear index codes achieve the $MAIS$ lower bound on the broadcast rate. In contrast, it is known that there exists IC problems with $MAIS=n-3$ and optimal broadcast rate strictly greater than $MAIS$.

Includes members:
  Member "on a duality between recoverable distributed storage and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "embedded index coding")
  Member "bounding multiple unicasts through index coding and locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "embedded index coding")
  Member "a new class of index coding instances where linear coding is optimal":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal finite length and asymptotic index codes for five or fewer receivers")
  Member "optimal index codes with near extreme rates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches")
  Member "index coding via linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "embedded index coding")
  Member "on the index coding problem and its relation to network coding and matroid theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient 3d road map data exchange for intelligent vehicles in vehicular fog networks")

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)