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: "a construction of quantum ldpc codes from cayley graphs"
  Abstract: We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We give a general lower bound on the minimum distance of the Quantum code in $\mathcal{O}(dn^2)$ where d is the minimum distance of the classical code. When the classical code is the $[n, 1, n]$ repetition code, we are able to compute the exact parameters of the associated Quantum code which are $[[2^n, 2^{\frac{n+1}{2}}, 2^{\frac{n-1}{2}}]]$.

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"
    - "quantum error correction beyond the bounded distance decoding limit"
    - "weight distributions of regular low density parity check codes over finite fields"

Connected through hyperedge HE-2 (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"
    - "quantum error correction beyond the bounded distance decoding limit"

Connected through hyperedge HE-3 (induced by source paper "an application of khovanov homology to quantum codes"):
  with members:
    - "quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength"

Connected through hyperedge HE-4 (induced by source paper "quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength"):
  with members:
    - "quantum error correction beyond the bounded distance decoding limit"

Connected through hyperedge HE-5 (induced by source paper "hypermap homology quantum codes ph d thesis"):
  with members:
    - "tree width of hypergraphs and surface duality"

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)