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 lifting construction for scalar linear index codes"
  Abstract: This paper deals with scalar linear index codes for canonical 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) antidotes (side information). Optimal scalar linear index codes for several such instances of this class of problems have been reported in \cite{MRRarXiv}. These codes can be viewed as special cases of the symmetric unicast index coding problems discussed in \cite{MCJ}. In this paper a lifting construction is given which constructs a sequence of multiple unicast index problems starting from a given multiple unicast index coding problem. Also, it is shown that if an optimal scalar linear index code is known for the problem given starting problem then optimal scalar linear index codes can be obtained from the known code for all the problems arising from the proposed lifting construction. For several of the known classes of multiple unicast problems our construction is used to obtain several sequences of multiple unicast problem with optimal scalar linear index codes.

Connected through hyperedge HE-1 (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"
    - "optimal vector linear index codes for some symmetric side information problems"

Connected through hyperedge HE-2 (induced by source paper "optimal vector linear index codes for some symmetric side information problems"):
  with members:
    - "noisy index coding with psk and qam"
    - "optimal scalar linear index codes for some symmetric multiple unicast problems"
    - "index coded psk modulation"
    - "critical graphs in index coding"
    - "index coding an interference alignment perspective"
    - "optimal index codes for a class of multicast networks with receiver side information"

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)