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: "the linear complexity of a class of binary sequences with optimal autocorrelation"
  Abstract: Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period $4p$ with optimal autocorrelation was proposed via interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where $p$ is an odd prime with $p\equiv 1(\bmod~4)$. The objective of this paper is to determine the minimal polynomial and the linear complexity of this class of binary optimal sequences via sequence polynomial approach. It turns out that this class of sequences has quite good linear complexity.

Connected through hyperedge HE-1 (induced by source paper "the 2 adic complexity of yu gong sequences with interleaved structure and optimal autocorrelation magnitude"):
  with members:
    - "on the 2 adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude"
    - "new optimal binary sequences with period 4p via interleaving ding helleseth lam sequences"
    - "comments on a new method to compute the 2 adic complexity of binary sequences"
    - "a new method to compute the 2 adic complexity of binary sequences"

Connected through hyperedge HE-2 (induced by source paper "on the 2 adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude"):
  with members:
    - "new optimal binary sequences with period 4p via interleaving ding helleseth lam sequences"
    - "comments on a new method to compute the 2 adic complexity of binary sequences"

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)