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: "on the structure of generalized toric codes"
  Abstract: Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an arbitrary polynomial algebra at the algebraic torus instead of a linear combination of monomials whose exponents are rational points of a convex polytope. We study their multicyclic and metric structure, and we use them to express their dual and to estimate their minimum distance.

Connected through hyperedge HE-1 (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"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "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"

Connected through hyperedge HE-2 (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"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "new quantum codes from evaluation and matrix product codes"

Connected through hyperedge HE-3 (induced by source paper "toric codes multiplicative structure and decoding"):
  with members:
    - "lattice polytopes in coding theory"

Connected through hyperedge HE-4 (induced by source paper "asymmetric quantum codes on toric surfaces"):
  with members:
    - "nonbinary quantum cyclic and subsystem codes over asymmetrically decohered quantum channels"

Connected through hyperedge HE-5 (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"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "lattice polytopes in coding theory"):
  with members:
    - "on classification of toric surface codes of low dimension"
    - "remarks on generalized toric codes"

Connected through hyperedge HE-7 (induced by source paper "toric codes and finite geometries"):
  with members:
    - "remarks on generalized toric codes"

Connected through hyperedge HE-8 (induced by source paper "quantum codes from affine variety codes and their subfield subcodes"):
  with members:
    - "css like constructions of asymmetric quantum codes"
    - "an improvement of the feng rao bound for primary codes"
    - "the dimension of subcode subfields of shortened generalized reed solomon codes"
    - "subfield subcodes of generalized toric 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)