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 vector linear index codes for some symmetric side information problems"
  Abstract: This paper deals with vector linear index codes for multiple unicast index coding problems where there is a source with K messages and there are K receivers each wanting a unique message and having symmetric (with respect to the receiver index) two-sided antidotes (side information). Optimal scalar linear index codes for several such instances of this class of problems for one-sided antidotes(not necessarily adjacent) have already been reported. These codes can be viewed as special cases of the symmetric unicast index coding problems discussed by Maleki, Cadambe and Jafar with one sided adjacent antidotes. In this paper, starting from a given multiple unicast index coding problem with with K messages and one-sided adjacent antidotes for which a scalar linear index code $\mathfrak{C}$ is known, we give a construction procedure which constructs a sequence (indexed by m) of multiple unicast index problems with two-sided adjacent antidotes (for the same source) for all of which a vector linear code $\mathfrak{C}^{(m)}$ is obtained from $\mathfrak{C}.$ Also, it is shown that if $\mathfrak{C}$ is optimal then $\mathfrak{C}^{(m)}$ is also optimal for all $m.$ We illustrate our construction for some of the known optimal scalar linear codes.

Connected through hyperedge HE-1 (induced by source paper "linear codes for broadcasting with noisy side information"):
  with members:
    - "uniprior index coding"
    - "index coding with erroneous side information"
    - "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"
    - "blind index coding"
    - "local graph coloring and index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-2 (induced by source paper "groupcast index coding problem joint extensions"):
  with members:
    - "linear codes for broadcasting with noisy side information"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "index coding rank invariant extensions"
    - "structural properties of index coding capacity"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "generalized lexicographic products and the index coding capacity"
    - "a lifting construction for scalar linear index codes"

Connected through hyperedge HE-3 (induced by source paper "index coding rank invariant extensions"):
  with members:
    - "uniprior index coding"
    - "structural properties of index coding capacity"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "structural properties of index coding capacity using fractional graph theory"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "on index coding and graph homomorphism"
    - "optimal index codes with near extreme rates"

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)