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: "on line construction of position heaps"
  Abstract: We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it considers the suffixes ordered from left to right. Our construction is based on classic suffix pointers and resembles the Ukkonen's algorithm for suffix trees [Ukkonen, 1995]. Using suffix pointers, the position heap can be extended into the augmented position heap that allows for a linear-time string matching algorithm [Ehrenfeucht et al, 2011].

Connected through hyperedge HE-1 (induced by source paper "online algorithms for constructing linear size suffix trie"):
  with members:
    - "linear size cdawg new repetition aware indexing and grammar compression"
    - "fast label extraction in the cdawg"
    - "optimal dynamic strings"
    - "alphabet dependent string searching with wexponential search trees"

Connected through hyperedge HE-2 (induced by source paper "the parameterized position heap of a trie"):
  with members:
    - "right to left online construction of parameterized position heaps"
    - "position heaps for parameterized strings"

Connected through hyperedge HE-3 (induced by source paper "right to left online construction of parameterized position heaps"):
  with members:
    - "position heaps for parameterized strings"

Connected through hyperedge HE-4 (induced by source paper "position heaps for parameterized strings"):
  with members:
    - "new algorithms for position heaps"

Connected through hyperedge HE-5 (induced by source paper "new algorithms for position heaps"):
  with members:
    - "better space bounds for parameterized range majority and minority"
    - "efficient lz78 factorization of grammar compressed text"
    - "efficient fully compressed sequence representations"

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.DS(Data Structures and Algorithms)