human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a new class of index coding instances where linear coding is optimal"
  Abstract: We study index-coding problems (one sender broadcasting messages to multiple receivers) where each message is requested by one receiver, and each receiver may know some messages a priori. This type of index-coding problems can be fully described by directed graphs. The aim is to find the minimum codelength that the sender needs to transmit in order to simultaneously satisfy all receivers' requests. For any directed graph, we show that if a maximum acyclic induced subgraph (MAIS) is obtained by removing two or fewer vertices from the graph, then the minimum codelength (i.e., the solution to the index-coding problem) equals the number of vertices in the MAIS, and linear codes are optimal for this index-coding problem. Our result increases the set of index-coding problems for which linear index codes are proven to be optimal.

Connected through hyperedge HE-1 (induced by source paper "optimal finite length and asymptotic index codes for five or fewer receivers"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "a rate distortion approach to index coding"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"

Connected through hyperedge HE-2 (induced by source paper "optimal index codes via a duality between index coding and network coding"):
  with members:
    - "on a duality between recoverable distributed storage and index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "optimal index codes with near extreme rates"
    - "index coding via linear programming"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-3 (induced by source paper "the single uniprior index coding problem the single sender case and the multi sender extension"):
  with members:
    - "structural properties of index coding capacity using fractional graph theory"
    - "a new index coding scheme exploiting interlinked cycles"
    - "on index coding and graph homomorphism"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"
    - "fundamental limits of distributed caching in d2d wireless networks"

Connected through hyperedge HE-4 (induced by source paper "a new index coding scheme exploiting interlinked cycles"):
  with members:
    - "topological interference management through index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "on the capacity region for index coding"
    - "local graph coloring and index coding"
    - "index coding an interference alignment perspective"
    - "dynamic index coding for wireless broadcast networks"

Connected through hyperedge HE-5 (induced by source paper "linear codes are optimal for index coding instances with five or fewer receivers"):
  with members:
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"

Question: Please tell me which class the center node 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)