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: "weighted reed muller codes revisited"
  Abstract: We consider weighted Reed-Muller codes over point ensemble $S_1 \times...\times S_m$ where $S_i$ needs not be of the same size as $S_j$. For $m = 2$ we determine optimal weights and analyze in detail what is the impact of the ratio $|S_1|/|S_2|$ on the minimum distance. In conclusion the weighted Reed-Muller code construction is much better than its reputation. For a class of affine variety codes that contains the weighted Reed-Muller codes we then present two list decoding algorithms. With a small modification one of these algorithms is able to correct up to 31 errors of the [49, 11, 28] Joyner 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"
    - "on the second hamming weight of some reed muller type codes"
    - "list decoding of 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"
    - "on the second hamming weight of some reed muller type codes"
    - "on the structure of generalized toric codes"

Connected through hyperedge HE-3 (induced by source paper "weighted lifted codes local correctabilities and application to robust private information retrieval"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"
    - "private information retrieval from coded databases with colluding servers"
    - "a storage efficient and robust private information retrieval scheme allowing few servers"
    - "high rate locally correctable codes via lifting"
    - "new affine invariant codes from lifting"

Connected through hyperedge HE-4 (induced by source paper "relative generalized hamming weights of affine cartesian codes"):
  with members:
    - "relative generalized hamming weights of q ary reed muller codes"
    - "on the second hamming weight of some reed muller type codes"

Connected through hyperedge HE-5 (induced by source paper "explicit optimal length locally repairable codes of distance 5"):
  with members:
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "affine cartesian codes with complementary duals"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "construction of optimal locally repairable codes via automorphism groups of rational function fields"
    - "locally recoverable codes from algebraic curves and surfaces"
    - "optimal locally repairable codes via elliptic curves"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-6 (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"
    - "on the second hamming weight of some reed muller type codes"

Connected through hyperedge HE-7 (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-8 (induced by source paper "on the distance of stabilizer quantum codes from j affine variety codes"):
  with members:
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "application of constacyclic codes to quantum mds codes"
    - "new quantum codes from evaluation and matrix product codes"
    - "feng rao decoding of primary 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)