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 low density parity check codes"
  Abstract: This article develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error-correction performance, high rates, and low decoding complexity. The proposed method produces several infinite families of codes with a wide variety of parameters and entanglement requirements. Our framework encompasses the previously known entanglement-assisted quantum LDPC codes having the best error-correction performance and many other codes with better block error rates in simulations over the depolarizing channel. We also determine important parameters of several well-known classes of quantum and classical LDPC codes for previously unsettled cases.

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"
    - "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance"
    - "coding theory the unit derived methodology"
    - "new mds self dual codes from generalized reed solomon 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"
    - "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 "new entanglement assisted mds quantum codes from constacyclic codes"):
  with members:
    - "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance"
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "application of constacyclic codes to quantum mds codes"

Connected through hyperedge HE-4 (induced by source paper "two new classes of entanglement assisted quantum mds codes"):
  with members:
    - "new entanglement assisted mds quantum codes from constacyclic codes"
    - "constructions of good entanglement assisted quantum error correcting codes"

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

Connected through hyperedge HE-6 (induced by source paper "linear programming bounds for entanglement assisted quantum error correcting codes by split weight enumerators"):
  with members:
    - "correction of data and syndrome errors by stabilizer codes"
    - "on the macwilliams identity for classical and quantum convolutional codes"

Connected through hyperedge HE-7 (induced by source paper "entanglement assisted quantum codes from galois lcd codes"):
  with members:
    - "application of constacyclic codes to quantum mds codes"
    - "a construction of new quantum mds codes"

Connected through hyperedge HE-8 (induced by source paper "constructions of good entanglement assisted quantum error correcting codes"):
  with members:
    - "quantum codes from generalized reed solomon codes and matrix product codes"
    - "the weights in 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)