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: "hamming weights in irreducible cyclic codes"
  Abstract: Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem and develop bounds on the weights in irreducible cyclic codes.

Connected through hyperedge HE-1 (induced by source paper "a class of narrow sense bch codes"):
  with members:
    - "dimensions of nonbinary antiprimitive bch codes and some conjectures"
    - "dimension of nonbinary antiprimitive bch codes"
    - "the minimum distance of some narrow sense primitive bch codes"
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "dimensions of three types of bch codes over gf q"
    - "lcd cyclic codes over finite fields"
    - "a class of three weight cyclic codes"
    - "exponential sums cyclic codes and sequences the odd characteristic kasami case"

Connected through hyperedge HE-2 (induced by source paper "a class of functions with low valued walsh spectrum"):
  with members:
    - "several classes of cyclic codes with either optimal three weights or a few weights"
    - "binary sequences with three valued cross correlations of different lengths"
    - "the weight enumerator of three families of cyclic codes"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "some new results on the cross correlation of m sequences"

Connected through hyperedge HE-3 (induced by source paper "how many weights can a cyclic code have"):
  with members:
    - "how many weights can a linear code have"
    - "maximum weight spectrum codes with reduced length"
    - "a note on full weight spectrum codes"
    - "maximum weight spectrum codes"
    - "two weight codes and second order recurrences"
    - "the weights in mds codes"
    - "weight distributions of hamming codes ii"

Connected through hyperedge HE-4 (induced by source paper "complete weight enumerators of a family of three weight linear codes"):
  with members:
    - "complete weight enumerators of some linear codes"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "five families of three weight ternary cyclic codes and their duals"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-5 (induced by source paper "a class of three weight linear codes and their complete weight enumerators"):
  with members:
    - "complete weight enumerators of a family of three weight linear codes"
    - "complete weight enumerators of two classes of linear codes"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-6 (induced by source paper "the weight distributions of two classes of p ary cyclic codes with few weights"):
  with members:
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "cyclic codes from cyclotomic sequences of order four"

Connected through hyperedge HE-7 (induced by source paper "two new families of two weight codes"):
  with members:
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-8 (induced by source paper "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"):
  with members:
    - "cyclic lrc codes and their subfield subcodes"
    - "bounds on the parameters of locally recoverable codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "optimal locally repairable codes via rank metric codes"
    - "optimal locally repairable codes and connections to matroid theory"

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)