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: "sequence pairs with lowest combined autocorrelation and crosscorrelation"
  Abstract: For a pair $(f,g)$ of sequences of length $\ell$ whose terms are in $\{-1,1\}$, Pursley and Sarwate established a lower bound on a combined measure of crosscorrelation and autocorrelation for $f$ and $g$. They showed that the sum of the mean square crosscorrelation between $f$ and $g$ and the geometric mean of $f$'s mean square autocorrelation and $g$'s mean square autocorrelation must be at least $1$. For randomly selected binary sequences, this quantity is typically about $2$. In this paper, we show that Pursley and Sarwate's bound is met precisely when $(f,g)$ is a Golay complementary pair. This result generalizes to sequences whose terms are arbitrary complex numbers.

Connected through hyperedge HE-1 (induced by source paper "sequences with low correlation"):
  with members:
    - "rudin shapiro like polynomials with maximum asymptotic merit factor"
    - "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 "sequence pairs with asymptotically optimal aperiodic correlation"):
  with members:
    - "aperiodic crosscorrelation of sequences derived from characters"
    - "sequences with small correlation"

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)