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: "plucker embedding of cyclic orbit codes"
  Abstract: Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Pl\"ucker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.

Connected through hyperedge HE-1 (induced by source paper "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes"):
  with members:
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "cyclic orbit codes"
    - "bounds on list decoding of rank metric codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "bounds on list decoding gabidulin codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"

Connected through hyperedge HE-2 (induced by source paper "list decoding of lifted gabidulin codes via the plucker embedding"):
  with members:
    - "cyclic orbit codes"
    - "bounds on list decoding gabidulin codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "new improvements on the echelon ferrers construction"
    - "codes and designs related to lifted mrd codes"
    - "recursive code construction for random 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)