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 mds self dual codes from generalized reed solomon codes"
  Abstract: Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of $q$-ary MDS self-dual codes for various lengths has been investigated extensively. The problem is completely solved for the case where $q$ is even. The current paper focuses on the case where $q$ is odd. We construct a few classes of new MDS self-dual code through generalized Reed-Solomon codes. More precisely, we show that for any given even length $n$ we have a $q$-ary MDS code as long as $q\equiv1\bmod{4}$ and $q$ is sufficiently large (say $q\ge 2^n\times n^2)$. Furthermore, we prove that there exists a $q$-ary MDS self-dual code of length $n$ if $q=r^2$ and $n$ satisfies one of the three conditions: (i) $n\le r$ and $n$ is even; (ii) $q$ is odd and $n-1$ is an odd divisor of $q-1$; (iii) $r\equiv3\mod{4}$ and $n=2tr$ for any $t\le (r-1)/2$.

Connected through hyperedge HE-1 (induced by source paper "constructions of quantum mds codes"):
  with members:
    - "coding theory the unit derived methodology"
    - "some new constructions of quantum mds codes"
    - "mds codes with arbitrary dimensional hull and their applications"
    - "galois lcd codes over finite fields"
    - "a construction of new quantum mds codes"

Connected through hyperedge HE-2 (induced by source paper "a new method for constructing eaqec mds codes"):
  with members:
    - "new entanglement assisted mds quantum codes from constacyclic codes"
    - "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance"
    - "coding theory the unit derived methodology"
    - "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 "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"
    - "two new classes of quantum mds codes"
    - "euclidean and hermitian lcd mds codes"
    - "new constructions of mds codes with complementary duals"
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-4 (induced by source paper "construction of optimal hermitian self dual codes from unitary matrices"):
  with members:
    - "new constructions of mds codes with complementary duals"
    - "new mds euclidean and hermitian self dual codes over finite fields"
    - "matrix product codes over finite commutative frobenius rings"

Connected through hyperedge HE-5 (induced by source paper "constructions of mds self dual codes from short length"):
  with members:
    - "an unified approach on constructing of mds self dual codes via reed solomon codes"
    - "new mds euclidean self orthogonal codes"

Connected through hyperedge HE-6 (induced by source paper "two classes of new mds self dual codes over finite fields"):
  with members:
    - "new mds self dual codes over finite fields of odd characteristic"
    - "construction of mds self dual codes over finite fields"

Connected through hyperedge HE-7 (induced by source paper "an unified approach on constructing of mds self dual codes via reed solomon codes"):
  with members:
    - "construction of mds self dual codes over finite fields"

Connected through hyperedge HE-8 (induced by source paper "on the constructions of mds self dual codes via cyclotomy"):
  with members:
    - "construction of mds self dual codes over finite fields"

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)