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: "generalized constructions of complementary sets of sequences of lengths non power of two"
  Abstract: The construction of complementary sets (CSs) of sequences with different set size and sequence length become important due to its practical application for OFDM systems. Most of the constructions of CSs, based on generalized Boolean functions (GBFs), are of length   $2^\alpha$   (  $\alpha$   is a natural number). Recently some works have been reported on construction of CSs having lengths non-power of two, i.e., in the form of   $2^{m-1}+2^v$   (  $m$   is natural number,   $0\leq v   ),   $N+1$   and   $N+2$  , where   $N$   is a length for which   $q$  -ary complementary pairs exist. In this letter, we propose a construction of CSs of lengths   $M+N$   for set size   $4n$  , using concatenation of CSs of lengths   $M$   and   $N$  , and set size   $4n$  , where   $M$   and   $N$   are lengths for which   $q$  -ary complementary pairs exists. Also, we construct CSs of length   $M+P$   for set size   $8n$   by concatenating CSs of lengths   $M$   and   $P$  , and set size   $8n$  , where   $M$   and   $P$   are lengths for which   $q$  -ary complementary pairs and complementary sets of size 4 exists, respectively. The proposed constructions cover all the previous constructions as special cases in terms of lengths and lead to more CSs of new sequence lengths which have not been reported before.

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)