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: "cyclotomic constructions of cyclic codes with length being the product of two primes"
  Abstract: Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made. In this paper, three types of generalized cyclotomy of order two and three classes of cyclic codes of length $n_1n_2$ and dimension $(n_1n_2+1)/2$ are presented and analysed, where $n_1$ and $n_2$ are two distinct primes. Bounds on their minimum odd-like weight are also proved. The three constructions produce the best cyclic codes in certain cases.

Connected through hyperedge HE-1 (induced by source paper "a lower bound on the 2 adic complexity of modified jacobi sequence"):
  with members:
    - "a new method to compute the 2 adic complexity of binary sequences"

Connected through hyperedge HE-2 (induced by source paper "cyclic codes from two prime generalized cyclotomic sequences of order 6"):
  with members:
    - "the weight enumerator of three families of cyclic codes"
    - "a class of three weight cyclic codes"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "cyclic code from the first class whiteman s generalized cyclotomic sequence with order 4"
    - "cyclic codes from dickson polynomials"
    - "cyclic codes from apn and planar functions"
    - "cyclic codes from cyclotomic sequences of order four"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-3 (induced by source paper "cyclic codes from the second class two prime whiteman s generalized cyclotomic sequence with order 6"):
  with members:
    - "cyclic code from the first class whiteman s generalized cyclotomic sequence with order 4"
    - "cyclic codes from cyclotomic sequences of order four"

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)