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 index coding scheme exploiting interlinked cycles"
  Abstract: We study the index coding problem in the unicast message setting, i.e., where each message is requested by one unique receiver. This problem can be modeled by a directed graph. We propose a new scheme called interlinked cycle cover, which exploits interlinked cycles in the directed graph, for designing index codes. This new scheme generalizes the existing clique cover and cycle cover schemes. We prove that for a class of infinitely many digraphs with messages of any length, interlinked cycle cover provides an optimal index code. Furthermore, the index code is linear with linear time encoding complexity.

Connected through hyperedge HE-1 (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"
    - "graph theory versus minimum rank for index coding"
    - "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-2 (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"
    - "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"
    - "a new class of index coding instances where linear coding is optimal"
    - "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-3 (induced by source paper "generalized interlinked cycle cover for index coding"):
  with members:
    - "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"
    - "dynamic index coding for wireless broadcast networks"
    - "linear index coding via semidefinite programming"
    - "index coding via linear programming"

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)