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: "genetic algorithms for finding the weight enumerator of binary linear block codes"
  Abstract: In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight enumerator of the code and its dual and to create from the famous MacWilliams identity a linear system (S) of integer variables for which we add all known information obtained from the structure of the code. The knowledge of some subgroups of the automorphism group, under which the code remains invariant, permits to give powerful restrictions on the solutions of (S) and to approximate the weight enumerator. By applying this method and by using the stability of the Extended Quadratic Residue codes (ERQ) by the Projective Special Linear group PSL2, we find a list of all possible values of the weight enumerators for the two ERQ codes of lengths 192 and 200. We also made a good approximation of the true value for these two enumerators.

Connected through hyperedge HE-1 (induced by source paper "genetic algorithms with permutation based representation for computing the distance of linear codes"):
  with members:
    - "minimum distance computation of linear codes via genetic algorithms with permutation encoding"
    - "on the computing of the minimum distance of linear block codes by heuristic methods"

Connected through hyperedge HE-2 (induced by source paper "a method to determine partial weight enumerator for linear block codes"):
  with members:
    - "on the weight distribution of the extended quadratic residue code of prime 137"

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)