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: "new quantum mds codes derived from constacyclic codes"
  Abstract: Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. It is very hard to construct quantum MDS codes with relatively large minimum distance. In this paper, based on classical constacyclic codes, we construct two classes of quantum MDS codes with parameters $$[[\lambda(q-1),\lambda(q-1)-2d+2,d]]_q$$ where $2\leq d\leq (q+1)/2+\lambda-1$, and $q+1=\lambda r$ with $r$ even, and $$[[\lambda(q-1),\lambda(q-1)-2d+2,d]]_q$$ where $2\leq d\leq (q+1)/2+\lambda/2-1$, and $q+1=\lambda r$ with $r$ odd. The quantum MDS codes exhibited here have parameters better than the ones available in the literature.

Connected through hyperedge HE-1 (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"
    - "two new classes of quantum mds codes"
    - "application of constacyclic codes to quantum mds codes"

Connected through hyperedge HE-2 (induced by source paper "two families of entanglement assisted quantum mds codes from constacyclic codes"):
  with members:
    - "entanglement assisted quantum error correcting codes over arbitrary finite fields"
    - "new entanglement assisted mds quantum codes from constacyclic codes"
    - "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance"
    - "entanglement assisted quantum mds codes constructed from constacyclic codes"
    - "application of constacyclic codes to quantum mds codes"
    - "entanglement assisted quantum low density parity check codes"

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

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

Connected through hyperedge HE-5 (induced by source paper "some new constructions of quantum mds codes"):
  with members:
    - "two new classes of quantum mds 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"

Connected through hyperedge HE-6 (induced by source paper "two new classes of quantum mds codes"):
  with members:
    - "new constructions of mds codes with complementary duals"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance"):
  with members:
    - "application of constacyclic codes to quantum mds codes"
    - "construction of n n 4 3 q quantum codes for odd prime power q"
    - "entanglement assisted quantum low density parity check codes"

Connected through hyperedge HE-8 (induced by source paper "new quantum mds codes constructed from constacyclic codes"):
  with members:
    - "application of constacyclic codes to 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)