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: "the weight distribution of a class of cyclic codes related to hermitian forms graphs"
  Abstract: The determination of weight distribution of cyclic codes involves the evaluation of Gauss sums and exponential sums. Despite some cases where a neat expression is available, the computation is generally rather complicated. In this note, we determine the weight distribution of a class of reducible cyclic codes whose dual codes may have arbitrarily many zeros. This goal is achieved by building an unexpected connection between the corresponding exponential sums and the spectra of Hermitian forms graphs.

Connected through hyperedge HE-1 (induced by source paper "relative generalized hamming weights of cyclic codes"):
  with members:
    - "on asymptotically good ramp secret sharing schemes"
    - "the weight hierarchy of some reducible cyclic codes"
    - "relative generalized hamming weights of q ary reed muller codes"
    - "generalized hamming weights of irreducible cyclic codes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "optimal cyclic codes with generalized niho type zeroes and the weight distribution"):
  with members:
    - "on the weight distribution of cyclic codes with niho exponents"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"
    - "weight distribution of a p ary cyclic code"

Connected through hyperedge HE-3 (induced by source paper "kasami type codes of higher relative dimension"):
  with members:
    - "gold type codes of higher relative dimension"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-4 (induced by source paper "gold type codes of higher relative dimension"):
  with members:
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-5 (induced by source paper "weight distributions of cyclic codes with respect to pairwise coprime order elements"):
  with members:
    - "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"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-6 (induced by source paper "the weight distributions of a class of cyclic codes with three nonzeros over f3"):
  with members:
    - "the weight distributions of some cyclic codes with three or four nonzeros over f3"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "hamming weights in irreducible cyclic codes"
    - "weight distribution of a p ary cyclic code"

Connected through hyperedge HE-7 (induced by source paper "the weight enumerator of three families of cyclic codes"):
  with members:
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"
    - "weight distribution of a p ary cyclic code"

Connected through hyperedge HE-8 (induced by source paper "weight distribution of two classes of cyclic codes with respect to two distinct order elements"):
  with members:
    - "cyclic codes from cyclotomic sequences of order four"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

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)