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 second hamming weight of some reed muller type codes"
  Abstract: We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C. Renteria-Marquez and R. Villareal and, in a generalized form, in a work by O. Geil and C. Thomsen. Using methods from Gr\"obner basis theory we determine the second Hamming weight (also called next-to-minimal weight) for particular cases of affine cartesian codes and also some higher Hamming weights of this type of code.

Connected through hyperedge HE-1 (induced by source paper "polar decreasing monomial cartesian codes"):
  with members:
    - "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes"
    - "design of polar codes in 5g new radio"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "fast list decoders for polar codes"
    - "multi kernel construction of polar codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"

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"
    - "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"
    - "weighted reed muller codes revisited"
    - "on the structure of generalized toric codes"

Connected through hyperedge HE-3 (induced by source paper "relative generalized hamming weights of affine cartesian codes"):
  with members:
    - "relative generalized hamming weights of q ary reed muller codes"
    - "weighted reed muller codes revisited"

Connected through hyperedge HE-4 (induced by source paper "affine cartesian codes with complementary duals"):
  with members:
    - "new constructions of mds codes with complementary duals"
    - "complementary dual algebraic geometry codes"
    - "lcd cyclic codes over finite fields"
    - "weighted reed muller codes revisited"

Connected through hyperedge HE-5 (induced by source paper "the second generalized hamming weight of some evaluation codes arising from a projective torus"):
  with members:
    - "new lower bounds on the generalized hamming weights of ag codes"
    - "generalized hamming weights for almost affine codes"
    - "generalized hamming weights of irreducible cyclic 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)