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: "bounds for projective codes from semidefinite programming"
  Abstract: We apply the semidefinite programming method to derive bounds for projective codes over a finite field.

Connected through hyperedge HE-1 (induced by source paper "semidefinite programming bounds for error correcting codes"):
  with members:
    - "bounds for binary codes relative to pseudo distances of k points"
    - "on bounded weight codes"
    - "semidefinite programming harmonic analysis and coding theory"

Connected through hyperedge HE-2 (induced by source paper "efficient interpolation based decoding of interleaved subspace and gabidulin codes"):
  with members:
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds on list decoding of rank metric codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "general linearized polynomial interpolation and its applications"
    - "recursive code construction for random networks"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-3 (induced by source paper "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"):
  with members:
    - "bounds on list decoding of rank metric codes"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "general linearized polynomial interpolation and its applications"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "recursive code construction for random networks"
    - "fast encoding and decoding of gabidulin codes"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-4 (induced by source paper "generalized sphere packing bound"):
  with members:
    - "upper bounds on the size of grain correcting codes"
    - "correcting grain errors in magnetic media"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "on the non existence of lattice tilings by quasi crosses"
    - "linearity and complements in projective space"
    - "write channel model for bit patterned media recording"
    - "coding for high density recording on a 1 d granular magnetic medium"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-5 (induced by source paper "problems on q analogs in coding theory"):
  with members:
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "new lower bounds for constant dimension codes"
    - "cyclic orbit codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "isometry and automorphisms of constant dimension codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"
    - "algebraic list decoding of subspace codes"

Connected through hyperedge HE-6 (induced by source paper "bounds on list decoding of rank metric codes"):
  with members:
    - "bounds on list decoding gabidulin codes"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "general linearized polynomial interpolation and its applications"
    - "recursive code construction for random networks"
    - "fast encoding and decoding of gabidulin codes"
    - "enumerative coding for grassmannian space"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"

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)