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: "on critical index coding problems"
  Abstract: The question of under what condition some side information for index coding can be removed without affecting the capacity region is studied, which was originally posed by Tahmasbi, Shahrasbi, and Gohari. To answer this question, the notion of unicycle for the side information graph is introduced and it is shown that any edge that belongs to a unicycle is critical, namely, it cannot be removed without reducing the capacity region. Although this sufficient condition for criticality is not necessary in general, a partial converse is established, which elucidates the connection between the notion of unicycle and the maximal acylic induced subgraph outer bound on the capacity region by Bar-Yossef, Birk, Jayram, and Kol.

Connected through hyperedge HE-1 (induced by source paper "linear index coding with multiple senders and extension to a cellular network"):
  with members:
    - "cooperative multi sender index coding"
    - "index coding with erroneous side information"
    - "structural characteristics of two sender index coding"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "graph theoretic approaches to two sender index coding"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"

Connected through hyperedge HE-2 (induced by source paper "unicast uniprior index coding problems minrank and criticality"):
  with members:
    - "on the number of optimal index codes"
    - "topological interference management through index coding"
    - "critical graphs in index coding"
    - "index coding an interference alignment perspective"
    - "optimal index codes for a class of multicast networks with receiver side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-3 (induced by source paper "structural characteristics of two sender index coding"):
  with members:
    - "cooperative multi sender index coding"
    - "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "fundamental limits of decentralized data shuffling"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "optimal finite length and asymptotic index codes for five or fewer receivers"
    - "on the capacity for distributed index coding"

Connected through hyperedge HE-4 (induced by source paper "topological interference management with decoded message passing"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "when does an ensemble of matrices with randomly scaled rows lose rank"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "cognitive wyner networks with clustered decoding"
    - "cellular interference alignment"

Connected through hyperedge HE-5 (induced by source paper "interlinked cycles for index coding generalizing cycles and cliques"):
  with members:
    - "structural properties of index coding capacity using fractional graph theory"
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "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"

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)