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: "constructions of optimal lcd codes over large finite fields"
  Abstract: In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.

Connected through hyperedge HE-1 (induced by source paper "binary lcd codes from mathbb z _2 mathbb z _2 u"):
  with members:
    - "some new bounds on lcd codes over finite fields"
    - "self dual cyclic and quantum codes over z2 alpha x z2 uz2 beta"
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "new binary and ternary lcd codes"
    - "galois lcd codes over finite fields"
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

Connected through hyperedge HE-2 (induced by source paper "some new bounds on lcd codes over finite fields"):
  with members:
    - "on mds negacyclic lcd codes"
    - "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound"
    - "on sigma lcd codes"
    - "some bounds on binary lcd codes"
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "new characterization and parametrization of lcd codes"
    - "galois lcd codes over finite fields"

Connected through hyperedge HE-3 (induced by source paper "galois hulls of linear codes over finite fields"):
  with members:
    - "on sigma lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "galois lcd codes over finite fields"
    - "new constructions of mds codes with complementary duals"
    - "complementary dual subfield linear codes over finite fields"
    - "matrix product codes over finite commutative frobenius rings"
    - "decoding of matrix product codes"
    - "linearity and complements in projective space"

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)