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 scalar linear index codes for one sided neighboring side information problems"
  Abstract: The capacity of symmetric instance of the multiple unicast index coding problem with neighboring antidotes (side-information) with number of messages equal to the number of receivers was given by Maleki \textit{et al.} In this paper, we construct matrices of size $ m \times n (m \geq n)$ over $F_q$ such that any $n$ adjacent rows of the matrix are linearly independent. By using such matrices, we give an optimal scalar linear index codes over $F_q$ for the symmetric one-sided antidote problems considered by Maleki \textit{et al.} for any given number of messages and one-sided antidotes. The constructed codes are independent of field size and hence works over every field.

Connected through hyperedge HE-1 (induced by source paper "rate memory trade off for multi access coded caching with uncoded placement"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "fundamental limits of caching in heterogeneous networks with uncoded prefetching"
    - "novel decentralized coded caching through coded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "uncoded placement optimization for coded delivery"
    - "a novel index coding scheme and its application to coded caching"

Connected through hyperedge HE-2 (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"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"
    - "optimal index codes for a class of multicast networks with receiver side information"

Connected through hyperedge HE-3 (induced by source paper "a generalisation of interlinked cycle structures and their index coding capacity"):
  with members:
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-4 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "coded caching with distributed storage"

Connected through hyperedge HE-5 (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"
    - "error correction for index coding with coded side information"
    - "optimal vector linear index codes for some symmetric side information problems"
    - "blind index coding"
    - "local graph coloring and index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-6 (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"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"
    - "optimal index codes for a class of multicast networks with receiver 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"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"
    - "optimal index codes for a class of multicast networks with receiver side information"

Connected through hyperedge HE-8 (induced by source paper "a new upperbound on the broadcast rate of index coding problems with symmetric neighboring interference"):
  with members:
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "capacity of some index coding problems with symmetric neighboring interference"
    - "topological interference management through 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)