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 ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength"
  Abstract: The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with a fixed non-zero rate is logarithmic in the blocklength. We propose a construction of quantum LDPC codes with fixed non-zero rate and prove that the minimum distance grows proportionally to the square root of the blocklength.

Connected through hyperedge HE-1 (induced by source paper "pseudocodeword based decoding of quantum stabilizer codes"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"

Connected through hyperedge HE-2 (induced by source paper "construction and performance of quantum burst error correction codes for correlated errors"):
  with members:
    - "on the macwilliams identity for classical and quantum convolutional codes"

Connected through hyperedge HE-3 (induced by source paper "distance verification for classical and quantum ldpc codes"):
  with members:
    - "quantum error correction beyond the bounded distance decoding limit"
    - "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-4 (induced by source paper "on tensor products of css codes"):
  with members:
    - "an application of khovanov homology to quantum codes"

Connected through hyperedge HE-5 (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 error correction beyond the bounded distance decoding limit"
    - "a construction of quantum ldpc codes from cayley graphs"

Connected through hyperedge HE-6 (induced by source paper "an application of khovanov homology to quantum codes"):
  with members:
    - "a construction of quantum ldpc codes from cayley graphs"

Connected through hyperedge HE-7 (induced by source paper "quantum error correction beyond the bounded distance decoding limit"):
  with members:
    - "density evolution thresholds and the stability condition for non binary 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)