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: "binary jumbled string matching for highly run length compressible texts"
  Abstract: The Binary Jumbled String Matching Problem is defined as follows: Given a string s over {a,b} of length n and a query (x,y), with x,y non-negative integers, decide whether s has a substring t with exactly x [email protected]?s and y [email protected]?s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time O(n^2/logn) (Burcsi et al., 2010 [1]; Moosa and Rahman, 2010 [7]), or O(n^2/log^2n) in the word-RAM model (Moosa and Rahman, 2012 [8]). We propose an index constructed directly from the run-length encoding of s. The construction time of our index is O([email protected]^[email protected]), where O(n) is the time for computing the run-length encoding of s and @r is the length of this encoding-this is no worse than previous solutions if @r=O(n/logn) and better if @r=o(n/logn). Our index L can be queried in O([email protected]) time. While |L|=O(min(n,@r^2)) in the worst case, preliminary investigations have indicated that |L| may often be close to @r. Furthermore, the algorithm for constructing the index is conceptually simple and easy to implement. In an attempt to shed light on the structure and size of our index, we characterize it in terms of the prefix normal forms of s introduced in Fici and Liptak (2011) [6].

Connected through hyperedge HE-1 (induced by source paper "on abelian longest common factor with and without rle"):
  with members:
    - "computing abelian regularities on rle strings"
    - "clustered integer 3sum via additive combinatorics"
    - "algorithms for longest common abelian factors"
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "new algorithms for binary jumbled pattern matching"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-2 (induced by source paper "on prefix normal words and prefix normal forms"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "new algorithms for binary jumbled pattern matching"
    - "indexes for jumbled pattern matching in strings trees and graphs"
    - "binary jumbled pattern matching on trees and tree like structures"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-3 (induced by source paper "on the parikh de bruijn grid"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "algorithms for longest common abelian factors"
    - "string reconstruction from substring compositions"
    - "algorithms for computing abelian periods of words"
    - "on hardness of jumbled indexing"
    - "new algorithms for binary jumbled pattern matching"
    - "binary jumbled pattern matching on trees and tree like structures"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-4 (induced by source paper "searching for a superlinear lower bounds for the maximum consecutive subsums problem and the min convolution"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "on hardness of jumbled indexing"
    - "faster all pairs shortest paths via circuit complexity"

Connected through hyperedge HE-5 (induced by source paper "normal abby normal prefix normal"):
  with members:
    - "on combinatorial generation of prefix normal words"
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "new algorithms for binary jumbled pattern matching"
    - "indexes for jumbled pattern matching in strings trees and graphs"
    - "binary jumbled pattern matching on trees and tree like structures"
    - "on prefix normal words"

Connected through hyperedge HE-6 (induced by source paper "binary jumbled pattern matching via all pairs shortest paths"):
  with members:
    - "new algorithms and lower bounds for circuits with linear threshold gates"
    - "faster all pairs shortest paths via circuit complexity"
    - "new algorithms for binary jumbled pattern matching"
    - "binary jumbled pattern matching on trees and tree like structures"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-7 (induced by source paper "on combinatorial generation of prefix normal words"):
  with members:
    - "new algorithms for binary jumbled pattern matching"
    - "indexes for jumbled pattern matching in strings trees and graphs"
    - "binary jumbled pattern matching on trees and tree like structures"
    - "on prefix normal words"

Connected through hyperedge HE-8 (induced by source paper "on hardness of jumbled indexing"):
  with members:
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "faster all pairs shortest paths via circuit complexity"
    - "new algorithms for binary jumbled pattern matching"
    - "binary jumbled pattern matching on trees and tree like structures"

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)