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: "rudin shapiro like polynomials with maximum asymptotic merit factor"
  Abstract: Borwein and Mossinghoff investigated the Rudin-Shapiro-like polynomials, which are infinite families of Littlewood polynomials, that is, polynomials whose coefficients are all in $\{-1,1\}$. Each family of Rudin-Shapiro-like polynomials is obtained from a starting polynomial (which we call the seed) by a recursive construction. These polynomials can be regarded as binary sequences. Borwein and Mossinghoff show that the asymptotic autocorrelation merit factor for any such family is at most $3$, and found the seeds of length $40$ or less that produce the maximum asymptotic merit factor of $3$. The definition of Rudin-Shapiro-like polynomials was generalized by Katz, Lee, and Trunov to include polynomials with arbitrary complex coefficients, with the sole condition that the seed polynomial must have a nonzero constant coefficient. They proved that the maximum asymptotic merit factor is $3$ for this larger class. Here we show that a family of such Rudin-Shapiro-like polynomials achieves asymptotic merit factor $3$ if and only if the seed is the interleaving of a pair of Golay complementary sequences.

Connected through hyperedge HE-1 (induced by source paper "sequences with low correlation"):
  with members:
    - "sequence pairs with lowest combined autocorrelation and crosscorrelation"
    - "crosscorrelation of rudin shapiro like polynomials"
    - "aperiodic crosscorrelation of sequences derived from characters"
    - "low correlation sequences from linear combinations of characters"

Connected through hyperedge HE-2 (induced by source paper "crosscorrelation of rudin shapiro like polynomials"):
  with members:
    - "aperiodic crosscorrelation of sequences derived from characters"

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)