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: "dimensions of nonbinary antiprimitive bch codes and some conjectures"
  Abstract: Bose-Chaudhuri-Hocquenghem (BCH) codes have been intensively investigated. Even so, there is only a little known about primitive BCH codes, let alone non-primitive ones. In this paper, let $q>2$ be a prime power, the dimension of a family of non-primitive BCH codes of length $n=q^{m}+1$ (also called antiprimitive) is studied. These codes are also linear codes with complementary duals (called LCD codes). Through some approaches such as iterative algorithm, partition and scaling, all coset leaders of $C_{x}$ modulo $n$ with $q^{\lceil \frac{m}{2}\rceil}<x\leq 2q^{\lceil\frac{m}{2} \rceil}+2$ are given for $m\geq 4$. And for odd $m$ the first several largest coset leaders modulo $n$ are determined. Furthermore, a new kind of sequences is introduced to determine the second largest coset leader modulo $n$ with $m$ even and $q$ odd. Also, for even $m$ some conjectures about the first several coset leaders modulo $n$ are proposed, whose complete verification would wipe out the difficult problem to determine the first several coset leaders of antiprimitive BCH codes. After deriving the cardinalities of the coset leaders, we shall calculate exact dimensions of many antiprimitive LCD BCH codes.

Connected through hyperedge HE-1 (induced by source paper "a class of narrow sense bch codes"):
  with members:
    - "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"
    - "hamming weights in irreducible cyclic codes"
    - "exponential sums cyclic codes and sequences the odd characteristic kasami case"

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)