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: "graph theory versus minimum rank for index coding"
  Abstract: We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negative result: all known graph theoretic bounds are within a logarithmic factor from the chromatic number. This is in striking contrast to minrank since prior work has shown that it can outperform the chromatic number by a polynomial factor in some cases. The conclusion is that all known graph theoretic bounds are not much stronger than the chromatic number.

Connected through hyperedge HE-1 (induced by source paper "embedded index coding"):
  with members:
    - "task based solutions to embedded index coding"
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on locally decodable index codes"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-2 (induced by source paper "cooperative multi sender index coding"):
  with members:
    - "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"
    - "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"
    - "structural properties of index coding capacity using fractional graph theory"

Connected through hyperedge HE-3 (induced by source paper "on locally decodable index codes"):
  with members:
    - "reduced complexity index codes and improved upperbound on broadcast rate for neighboring interference problems"
    - "privacy in index coding k limited access schemes"
    - "speeding up distributed machine learning using codes"
    - "preserving privacy while broadcasting k limited access schemes"
    - "local partial clique covers for index coding"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"

Connected through hyperedge HE-4 (induced by source paper "linear programming approximations for index coding"):
  with members:
    - "the optimality of partial clique covering for index coding"
    - "approximate capacity of index coding for some classes of graphs"
    - "storage capacity of repairable networks"
    - "generalized interlinked cycle cover for index coding"
    - "a new index coding scheme exploiting interlinked cycles"
    - "local graph coloring and index coding"
    - "lexicographic products and the power of non linear network coding"
    - "linear index coding via semidefinite programming"

Connected through hyperedge HE-5 (induced by source paper "interlinked cycles for index coding generalizing cycles and cliques"):
  with members:
    - "on critical index coding problems"
    - "structural properties of index coding capacity using fractional graph theory"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "on the equivalency of reliability and security metrics for wireline networks"):
  with members:
    - "perfectly secure index coding"
    - "using feedback for secrecy over graphs"
    - "on the capacity region for index coding"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "on secure network coding with uniform wiretap sets"
    - "achievability proof via output statistics of random binning"
    - "performance bounds on a wiretap network with arbitrary wiretap sets"
    - "dynamic index coding for wireless broadcast networks"

Connected through hyperedge HE-7 (induced by source paper "bounding the optimal rate of the icsi and iccsi problem"):
  with members:
    - "error correction for index coding with coded side information"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"
    - "optimal index codes with near extreme rates"
    - "error correction for index coding with side information"
    - "on the security of index coding with side information"
    - "index coding via linear programming"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-8 (induced by source paper "approximate capacity of index coding for some classes of graphs"):
  with members:
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "a rate distortion approach to index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "on the capacity region for index coding"
    - "the multi sender multicast 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)