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: "linear codes are optimal for index coding instances with five or fewer receivers"
  Abstract: We study zero-error unicast index-coding instances, where each receiver must perfectly decode its requested message set, and the message sets requested by any two receivers do not overlap. We show that for all these instances with up to five receivers, linear index codes are optimal. Although this class contains 9847 non-isomorphic instances, by using our recent results and by properly categorizing the instances based on their graphical representations, we need to consider only 13 non-trivial instances to solve the entire class. This work complements the result by Arbabjolfaei et al. (ISIT 2013), who derived the capacity region of all unicast index-coding problems with up to five receivers in the diminishing-error setup. They employed random-coding arguments, which require infinitely-long messages. We consider the zero-error setup; our approach uses graph theory and combinatorics, and does not require long messages.

Connected through hyperedge HE-1 (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"
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through 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"

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"
    - "a new index coding scheme exploiting interlinked cycles"
    - "on index coding and graph homomorphism"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "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 "graph theoretic approaches to two sender index coding"):
  with members:
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "distributed index coding"
    - "structural properties of index coding capacity using fractional graph theory"
    - "generalized interlinked cycle cover for index coding"
    - "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-4 (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"
    - "graph theory versus minimum rank for index coding"
    - "a rate distortion approach to index coding"
    - "on the capacity region for index coding"
    - "the multi sender multicast index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-5 (induced by source paper "blind index coding"):
  with members:
    - "index coding with coded side information"
    - "capacity results for binary fading interference channels with delayed csit"
    - "topological interference management through index coding"
    - "on the capacity region for index coding"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "index coding an interference alignment perspective"
    - "on linear index coding for random graphs"

Connected through hyperedge HE-6 (induced by source paper "generalized interlinked cycle cover for index coding"):
  with members:
    - "a new index coding scheme exploiting interlinked cycles"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "a new index coding scheme exploiting interlinked cycles"):
  with members:
    - "topological interference management through index coding"
    - "a new class of index coding instances where linear coding is optimal"
    - "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"

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)