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 "general criteria for successor rules to efficiently generate binary de bruijn sequences"):
  Abstract: We put forward new general criteria to design successor rules that generate binary de Bruijn sequences. Prior fast algorithms based on successor rules in the literature are then shown to be special instances. We implement the criteria to join the cycles generated by a number of simple feedback shift registers (FSRs). These include the pure cycling register (PCR) and the pure summing register (PSR). For PCR, we define a preorder on its cycles, based on their weights. For PSR, we define two orders, namely a necklace order on its cycles and a mixed order on the cycles based on both the weight and the necklace orders. Using the new orders, we propose numerous classes of successor rules that can efficiently generate binary de Bruijn sequences. Producing the next bit takes no more than $O(n)$ memory and between $O(n)$ and $O(n \, \log n)$ time. We implemented computational routines to confirm the claims.

Includes members:
  Member "on binary de bruijn sequences from lfsrs with arbitrary characteristic polynomials":
    also connected through other hyperedges:
      (none)
  Member "strategies for stable merge sorting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nn sort neural network based data distribution aware sorting")

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)