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: "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
  Abstract: New stabilizer codes with parameters better than the ones available in the literature are provided in this work, in particular quantum codes with parameters $[[127,63, \geq 12]]_2$ and $[[63,45, \geq 6]]_4$ that are records. These codes are constructed with a new generalization of the Steane's enlargement procedure and by considering orthogonal subfield-subcodes --with respect to the Euclidean and Hermitian inner product-- of a new family of linear codes, the $J$-affine variety codes.

Connected through hyperedge HE-1 (induced by source paper "locally recoverable j affine variety codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "how long can optimal locally repairable codes be"
    - "new binary and ternary lcd codes"
    - "classical and quantum evaluation codes at the trace roots"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "cooperative local repair in distributed storage"
    - "cyclic lrc codes and their subfield subcodes"

Connected through hyperedge HE-2 (induced by source paper "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes"):
  with members:
    - "locally recoverable codes with local error detection"
    - "affine cartesian codes with complementary duals"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "lattice polytopes in coding theory"
    - "a family of optimal locally recoverable codes"
    - "on the second hamming weight of some reed muller type codes"
    - "weighted reed muller codes revisited"
    - "on the structure of generalized toric codes"

Connected through hyperedge HE-3 (induced by source paper "high dimensional affine codes whose square has a designed minimum distance"):
  with members:
    - "squares of matrix product codes"
    - "on squares of cyclic codes"
    - "squares of random linear codes"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"

Connected through hyperedge HE-4 (induced by source paper "on steane enlargement of quantum codes from cartesian product point sets"):
  with members:
    - "steane enlargement of quantum codes from the hermitian curve"
    - "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes"
    - "improved constructions of nested code pairs"
    - "quantum error correcting codes from algebraic geometry codes of castle type"
    - "on cyclotomic cosets and code constructions"

Connected through hyperedge HE-5 (induced by source paper "entanglement assisted quantum error correcting codes over arbitrary finite fields"):
  with members:
    - "new binary and ternary lcd codes"
    - "constructions of good entanglement assisted quantum error correcting codes"

Connected through hyperedge HE-6 (induced by source paper "new binary and ternary lcd codes"):
  with members:
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "improved constructions of nested code pairs"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "lcd cyclic codes over finite fields"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "new quantum codes from evaluation and matrix product codes"
    - "linearity and complements in projective space"

Connected through hyperedge HE-7 (induced by source paper "classical and quantum evaluation codes at the trace roots"):
  with members:
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "new quantum codes from evaluation and matrix product codes"

Connected through hyperedge HE-8 (induced by source paper "improved constructions of nested code pairs"):
  with members:
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "xing ling codes duals of their subcodes and good asymmetric quantum codes"
    - "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"

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)