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: "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance"
  Abstract: The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this work, we propose a decomposition of the defining set of constacyclic codes. Using this method, we construct four classes of $q$-ary entanglement-assisted quantum MDS (EAQMDS) codes based on classical constacyclic MDS codes by exploiting less pre-shared maximally entangled states. We show that a class of $q$-ary EAQMDS have minimum distance upper limit greater than $3q-1$. Some of them have much larger minimum distance than the known quantum MDS (QMDS) codes of the same length. Most of these $q$-ary EAQMDS codes are new in the sense that their parameters are not covered by the codes available in the literature.

Connected through hyperedge HE-1 (induced by source paper "a new method for constructing eaqec mds codes"):
  with members:
    - "new entanglement assisted mds quantum codes from constacyclic codes"
    - "coding theory the unit derived methodology"
    - "new mds self dual codes from generalized reed solomon codes"
    - "application of constacyclic codes to quantum mds codes"
    - "entanglement assisted quantum low density parity check 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 constructed from constacyclic codes"
    - "new quantum mds codes derived 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 "entanglement assisted quantum codes from algebraic geometry codes"):
  with members:
    - "entanglement assisted quantum error correcting codes over arbitrary finite fields"
    - "entanglement assisted quantum codes from galois lcd codes"
    - "constructions of good entanglement assisted quantum error correcting codes"

Connected through hyperedge HE-4 (induced by source paper "new entanglement assisted mds quantum codes from constacyclic codes"):
  with members:
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "application of constacyclic codes to quantum mds codes"
    - "entanglement assisted quantum low density parity check codes"

Connected through hyperedge HE-5 (induced by source paper "new entanglement assisted quantum mds codes with length n q 2 1 5"):
  with members:
    - "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 "entanglement assisted quantum codes from cyclic codes"):
  with members:
    - "entanglement assisted quantum error correcting codes over arbitrary finite fields"
    - "constructions of good entanglement assisted quantum error correcting codes"

Connected through hyperedge HE-7 (induced by source paper "linear ell intersection pairs of codes and their applications"):
  with members:
    - "mds codes with arbitrary dimensional hull and their applications"
    - "euclidean and hermitian lcd mds codes"
    - "constructions of good entanglement assisted quantum error correcting 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)