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: "quantum error correction beyond the bounded distance decoding limit"
  Abstract: In this paper, we consider quantum error correction over depolarizing channels with nonbinary low-density parity-check codes defined over Galois field of size 2p. The proposed quantum error correcting codes are based on the binary quasi-cyclic Calderbank, Shor, and Steane (CSS) codes. The resulting quantum codes outperform the best known quantum codes and surpass the performance limit of the bounded distance decoder. By increasing the size of the underlying Galois field, i.e., 2p, the error floors are considerably improved.

Connected through hyperedge HE-1 (induced by source paper "distance verification for classical and quantum ldpc codes"):
  with members:
    - "quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength"
    - "a construction of quantum ldpc codes from cayley graphs"
    - "weight distributions of regular low density parity check codes over finite fields"

Connected through hyperedge HE-2 (induced by source paper "non binary ldpc codes with large alphabet size"):
  with members:
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "spatially coupled binary mackay neal codes for channels with non binary inputs and affine subspace outputs"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "the effect of spatial coupling on compressive sensing"
    - "coding for network coding"

Connected through hyperedge HE-3 (induced by source paper "a decoding algorithm for css codes using the x z correlations"):
  with members:
    - "an application of khovanov homology to quantum codes"
    - "quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength"
    - "a construction of quantum ldpc codes from cayley graphs"

Connected through hyperedge HE-4 (induced by source paper "quantum synchronizable codes from quadratic residue codes and their supercodes"):
  with members:
    - "spatially coupled quasi cyclic quantum ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength"):
  with members:
    - "a construction of quantum ldpc codes from cayley graphs"

Connected through hyperedge HE-6 (induced by source paper "design of quantum stabilizer codes from quadratic residues sets"):
  with members:
    - "spatially coupled quasi cyclic quantum ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "a characterization of entanglement assisted quantum low density parity check codes"):
  with members:
    - "spatially coupled quasi cyclic quantum ldpc codes"
    - "entanglement assisted quantum low density parity check codes"
    - "a combinatorial approach to x tolerant compaction circuits"

Connected through hyperedge HE-8 (induced by source paper "improved quantum ldpc decoding strategies for the misidentified quantum depolarizing channel"):
  with members:
    - "spatially coupled quasi cyclic quantum ldpc 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)