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 weight distributions of several classes of cyclic codes from apn monomials"
  Abstract: Let $m\geq 3$ be an odd integer and $p$ be an odd prime. % with $p-1=2^rh$, where $h$ is an odd integer. #R##N#In this paper, many classes of three-weight cyclic codes over $\mathbb{F}_{p}$ are presented via an examination of the condition for the cyclic codes $\mathcal{C}_{(1,d)}$ and $\mathcal{C}_{(1,e)}$, which have parity-check polynomials $m_1(x)m_d(x)$ and $m_1(x)m_e(x)$ respectively, to have the same weight distribution, where $m_i(x)$ is the minimal polynomial of $\pi^{-i}$ over $\mathbb{F}_{p}$ for a primitive element $\pi$ of $\mathbb{F}_{p^m}$. %For $p=3$, the duals of five classes of the proposed cyclic codes are optimal in the sense that they meet certain bounds on linear codes. Furthermore, for $p\equiv 3 \pmod{4}$ and positive integers $e$ such that there exist integers $k$ with $\gcd(m,k)=1$ and $\tau\in\{0,1,\cdots, m-1\}$ satisfying $(p^k+1)\cdot e\equiv 2 p^{\tau}\pmod{p^m-1}$, the value distributions of the two exponential sums $T(a,b)=\sum\limits_{x\in \mathbb{F}_{p^m}}\omega^{\Tr(ax+bx^e)}$ and $ S(a,b,c)=\sum\limits_{x\in \mathbb{F}_{p^m}}\omega^{\Tr(ax+bx^e+cx^s)}, $ where $s=(p^m-1)/2$, are settled. As an application, the value distribution of $S(a,b,c)$ is utilized to investigate the weight distribution of the cyclic codes $\mathcal{C}_{(1,e,s)}$ with parity-check polynomial $m_1(x)m_e(x)m_s(x)$. In the case of $p=3$ and even $e$ satisfying the above condition, the duals of the cyclic codes $\mathcal{C}_{(1,e,s)}$ have the optimal minimum distance.

Connected through hyperedge HE-1 (induced by source paper "several classes of cyclic codes with either optimal three weights or a few weights"):
  with members:
    - "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field"
    - "linear codes from some 2 designs"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "a characterization of two weight projective cyclic codes"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field"):
  with members:
    - "several classes of cyclic codes with either optimal three weights or a few weights"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "a characterization of two weight projective cyclic codes"

Connected through hyperedge HE-3 (induced by source paper "the weight distribution of a family of p ary cyclic codes"):
  with members:
    - "a class of three weight 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)