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: "index coding with erroneous side information"
  Abstract: In this paper, new index coding problems are studied, where each receiver has erroneous side information. Although side information is a crucial part of index coding, the existence of erroneous side information has not been considered yet. We study an index code with receivers that have erroneous side information symbols in the error-free broadcast channel, which is called an index code with side information errors (ICSIE). The encoding and decoding procedures of the ICSIE are proposed, based on the syndrome decoding. Then, we derive the bounds on the optimal codelength of the proposed index code with erroneous side information. Furthermore, we introduce a special graph for the proposed index coding problem, called a    $\delta _{s}$   -cycle whose properties are similar to those of the cycle in the conventional index coding problem. Properties of the ICSIE are also discussed in the    $\delta _{s}$   -cycle and clique. Finally, the proposed ICSIE is generalized to an index code for the scenario having both additive channel errors and side information errors, called a generalized error correcting index code.

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"
    - "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"
    - "on critical index coding problems"

Connected through hyperedge HE-2 (induced by source paper "code equivalences between network codes with link errors and index codes with side information errors"):
  with members:
    - "an equivalence between secure network and index coding"
    - "a relation between network computation and functional index coding problems"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "index coding with coded side information"
    - "blind index coding"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "on the capacity region for index coding"

Connected through hyperedge HE-3 (induced by source paper "linear codes for broadcasting with noisy side information"):
  with members:
    - "uniprior index coding"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "error correction for index coding with coded side information"
    - "optimal vector linear index codes for some symmetric side information problems"
    - "blind index coding"
    - "local graph coloring and index coding"
    - "index coding an interference alignment perspective"

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)