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 error correcting codes over arbitrary finite fields"
  Abstract: We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as well. We also give a Gilbert–Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.

Connected through hyperedge HE-1 (induced by source paper "asymmetric entanglement assisted quantum error correcting codes and bch codes"):
  with members:
    - "on squares of cyclic codes"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "css like constructions of asymmetric quantum codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"
    - "additive asymmetric quantum codes"

Connected through hyperedge HE-2 (induced by source paper "two families of entanglement assisted quantum mds codes from constacyclic codes"):
  with members:
    - "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"
    - "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 mds codes from constacyclic codes with large minimum distance"
    - "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 "entanglement assisted quantum codes from cyclic codes"):
  with members:
    - "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance"
    - "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)