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: "xing ling codes duals of their subcodes and good asymmetric quantum codes"
  Abstract: A class of powerful $$q$$ q -ary linear polynomial codes originally proposed by Xing and Ling is deployed to construct good asymmetric quantum codes via the standard CSS construction. Our quantum codes are $$q$$ q -ary block codes that encode $$k$$ k qudits of quantum information into $$n$$ n qudits and correct up to $$\left\lfloor (d_{x}-1)/2 \right\rfloor $$ ( d x - 1 ) / 2 bit-flip errors and up to $$\left\lfloor (d_{z}-1)/2 \right\rfloor $$ ( d z - 1 ) / 2 phase-flip errors. In many cases where the length $$(q^{2}-q)/2 \le n \le (q^{2}+q)/2$$ ( q 2 - q ) / 2 ≤ n ≤ ( q 2 + q ) / 2 and the field size $$q$$ q are fixed and for chosen values of $$d_{x} \in \{2,3,4,5\}$$ d x ? { 2 , 3 , 4 , 5 } and $$d_{z} \ge \delta $$ d z ? ? , where $$\delta $$ ? is the designed distance of the Xing---Ling (XL) codes, the derived pure $$q$$ q -ary asymmetric quantum CSS codes possess the best possible size given the current state of the art knowledge on the best classical linear block codes.

Connected through hyperedge HE-1 (induced by source paper "improved constructions of nested code pairs"):
  with members:
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "new quantum codes from evaluation and matrix product codes"
    - "feng rao decoding of primary codes"
    - "css like constructions of asymmetric quantum codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"

Connected through hyperedge HE-2 (induced by source paper "constructions of pure asymmetric quantum alternant codes based on subclasses of alternant codes"):
  with members:
    - "css like constructions of asymmetric quantum codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"
    - "additive asymmetric quantum 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)