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: "two new classes of quantum mds codes"
  Abstract: Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters \[ [[tq, tq-2d+2, d]]_{q} \] for any $1 \leq t \leq q, 2 \leq d \leq \lfloor \frac{tq+q-1}{q+1}\rfloor+1$, and \[ [[t(q+1)+2, t(q+1)-2d+4, d]]_{q} \] for any $1 \leq t \leq q-1, 2 \leq d \leq t+2$ with $(p,t,d) \neq (2, q-1, q)$. Our quantum codes have flexible parameters, and have minimum distances larger than $\frac{q}{2}+1$ when $t > \frac{q}{2}$. Furthermore, it turns out that our constructions generalize and improve some previous results.

Connected through hyperedge HE-1 (induced by source paper "galois hulls of mds codes and their quantum error correction"):
  with members:
    - "euclidean and hermitian hulls of mds codes and their applications to eaqeccs"
    - "euclidean and hermitian lcd mds codes"
    - "new binary and ternary lcd codes"
    - "new characterization and parametrization of lcd codes"
    - "new constructions of mds codes with complementary duals"
    - "a construction of new quantum mds codes"

Connected through hyperedge HE-2 (induced by source paper "two new classes of quantum mds codes from generalized reed solomon codes"):
  with members:
    - "new quantum generalized reed solomn codes over finite fields"
    - "some new constructions of quantum mds codes"
    - "new quantum mds codes derived from constacyclic codes"
    - "application of constacyclic codes to quantum mds codes"

Connected through hyperedge HE-3 (induced by source paper "on euclidean hulls of mds codes"):
  with members:
    - "euclidean and hermitian hulls of mds codes and their applications to eaqeccs"
    - "new mds self dual codes over finite fields of odd characteristic"
    - "some new constructions of quantum mds codes"
    - "euclidean and hermitian lcd mds codes"
    - "new constructions of mds codes with complementary duals"
    - "new mds self dual codes from generalized reed solomon codes"
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-4 (induced by source paper "euclidean and hermitian hulls of mds codes and their applications to eaqeccs"):
  with members:
    - "new entanglement assisted mds quantum codes from constacyclic codes"
    - "linear programming bounds for entanglement assisted quantum error correcting codes by split weight enumerators"
    - "new constructions of mds codes with complementary duals"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-5 (induced by source paper "new quantum mds codes over finite fields"):
  with members:
    - "some new constructions of quantum mds codes"
    - "new quantum mds codes derived from constacyclic codes"
    - "application of constacyclic codes to quantum mds codes"
    - "a construction of new quantum mds codes"

Connected through hyperedge HE-6 (induced by source paper "new quantum generalized reed solomn codes over finite fields"):
  with members:
    - "some new constructions of quantum mds codes"
    - "new quantum mds codes derived from constacyclic codes"

Connected through hyperedge HE-7 (induced by source paper "some new constructions of quantum mds codes"):
  with members:
    - "new quantum mds codes derived from constacyclic codes"
    - "application of constacyclic codes to quantum mds codes"
    - "euclidean and hermitian self orthogonal algebraic geometry codes and their application to quantum codes"
    - "a construction of new quantum mds codes"

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)