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: "optimal index codes for a class of multicast networks with receiver side information"
  Abstract: This paper studies a special class of multicast index coding problems where a sender transmits messages to multiple receivers, each with some side information. Here, each receiver knows a unique message a priori, and there is no restriction on how many messages each receiver requests from the sender. For this class of multicast index coding problems, we obtain the optimal index code, which has the shortest codelength for which the sender needs to send in order for all receivers to obtain their (respective) requested messages. This is the first class of index coding problems where the optimal index codes are found. In addition, linear index codes are shown to be optimal for this class of index coding problems.

Connected through hyperedge HE-1 (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-2 (induced by source paper "unicast uniprior index coding problems minrank and criticality"):
  with members:
    - "on the number of optimal index codes"
    - "on critical index coding problems"
    - "topological interference management through index coding"
    - "critical graphs in index coding"
    - "index coding an interference alignment perspective"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-3 (induced by source paper "reduced complexity index codes and improved upperbound on broadcast rate for neighboring interference problems"):
  with members:
    - "near optimal vector linear index codes for single unicast index coding problems with symmetric neighboring interference"
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "capacity of some index coding problems with symmetric neighboring interference"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-4 (induced by source paper "a field size independent code construction for groupcast index coding problems"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "a matrix completion approach to linear index coding problem"
    - "critical graphs in index coding"
    - "error correction for index coding with side information"

Connected through hyperedge HE-5 (induced by source paper "on the broadcast rate of index coding problems with symmetric and consecutive interference"):
  with members:
    - "near optimal vector linear index codes for single unicast index coding problems with symmetric neighboring interference"
    - "a new upperbound on the broadcast rate of index coding problems with symmetric neighboring interference"
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-6 (induced by source paper "optimal scalar linear index codes for symmetric and neighboring side information problems"):
  with members:
    - "reduced dimensional optimal vector linear index codes for index coding problems with symmetric neighboring and consecutive side information"
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"
    - "error correction for index coding with side information"

Connected through hyperedge HE-7 (induced by source paper "reduced dimensional optimal vector linear index codes for index coding problems with symmetric neighboring and consecutive side information"):
  with members:
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-8 (induced by source paper "on the structure of interlinked cycle structures with interlocked outer cycles"):
  with members:
    - "on optimal index codes for interlinked cycle structures with outer cycles"
    - "index codes for interlinked cycle structures with outer cycles"
    - "interlinked cycles for index coding generalizing cycles and cliques"

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)