human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "linear complexity of a family of binary pq 2 periodic sequences from euler quotients"):
  Abstract: We first introduce a family of binary $pq^2$-periodic sequences based on the Euler quotients modulo $pq$, where $p$ and $q$ are two distinct odd primes and $p$ divides $q-1$. The minimal polynomials and linear complexities are determined for the proposed sequences provided that $2^{q-1} \not\equiv 1 \mod{q^2}.$ The results show that the proposed sequences have high linear complexities.

Includes members:
  Member "on k error linear complexity of pseudorandom binary sequences derived from euler quotients":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on k error linear complexity of binary sequences derived from euler quotients modulo 2p")
  Member "new quaternary sequences of even length with optimal auto correlation":
    also connected through other hyperedges:
      (none)
  Member "on the k error linear complexity of binary sequences derived from polynomial quotients":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on k error linear complexity of pseudorandom binary sequences derived from euler quotients")
  Member "trace representation of pseudorandom binary sequences derived from euler quotients":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on k error linear complexity of binary sequences derived from euler quotients modulo 2p")

Question: Please tell me which class the source paper 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)