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 "inferring an indeterminate string from a prefix graph"):
  Abstract: An indeterminate string (or, more simply, just a string) x = x 1 . . n ] on an alphabet Σ is a sequence of nonempty subsets of Σ. We say that x i 1 ] and x i 2 ] match (written x i 1 ] ? x i 2 ] ) if and only if x i 1 ] ? x i 2 ] ? ? . A feasible array is an array y = y 1 . . n ] of integers such that y 1 ] = n and for every i ? 2 . . n , y i ] ? 0 . . n - i + 1 . A prefix table of a string x is an array π = π 1 . . n ] of integers such that, for every i ? 1 . . n , π i ] = j if and only if x i . . i + j - 1 ] is the longest substring at position i of x that matches a prefix of x. It is known from 6] that every feasible array is a prefix table of some indeterminate string. A prefix graph P = P y is a labelled simple graph whose structure is determined by a feasible array y. In this paper we show, given a feasible array y, how to use P y to construct a lexicographically least indeterminate string on a minimum alphabet whose prefix table π = y .

Includes members:
  Member "indeterminate strings prefix arrays undirected graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing covers using prefix tables")
  Member "linear time inference of strings from cover arrays using a binary alphabet":
    also connected through other hyperedges:
      (none)

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