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: "what is decidable about string constraints with the replaceall function"
  Abstract: Recently, it was shown that any theory of strings containing the string-replace function (even the most restricted version where pattern/replacement strings are both constant strings) becomes undecidable if we do not impose some kind of straight-line (aka acyclicity) restriction on the formulas. Despite this, the straight-line restriction is still practically sensible since this condition is typically met by string constraints that are generated by symbolic execution. In this paper, we provide the first systematic study of straight-line string constraints with the string-replace function and the regular constraints as the basic operations. We show that a large class of such constraints (i.e. when only a constant string or a regular expression is permitted in the pattern) is decidable. We note that the string-replace function, even under this restriction, is sufficiently powerful for expressing the concatenation operator and much more (e.g. extensions of regular expressions with string variables). This gives us the most expressive decidable logic containing concatenation, replace, and regular constraints under the same umbrella. Our decision procedure for the straight-line fragment follows an automata-theoretic approach, and is modular in the sense that the string-replace terms are removed one by one to generate more and more regular constraints, which can then be discharged by the state-of-the-art string constraint solvers. We also show that this fragment is, in a way, a maximal decidable subclass of the straight-line fragment with string-replace and regular constraints. To this end, we show undecidability results for the following two extensions: (1) variables are permitted in the pattern parameter of the replace function, (2) length constraints are permitted.

Connected through hyperedge HE-1 (induced by source paper "a survey on string constraint solving"):
  with members:
    - "sound regular expression semantics for dynamic symbolic execution of javascript"
    - "undecidability of a theory of strings linear arithmetic over length and string number conversion"
    - "a solver for a theory of strings and bit vectors"
    - "minizinc with strings"
    - "regular combinators for string transformations"
    - "approximation of grammar based compression via recompression"
    - "recompression a simple and powerful technique for word equations"
    - "algorithm selection for combinatorial search problems a survey"

Connected through hyperedge HE-2 (induced by source paper "the theory of concatenation over finite models"):
  with members:
    - "dynamic complexity of document spanners"
    - "matching patterns with variables"
    - "weight annotation in information extraction"
    - "constant delay enumeration for nondeterministic document spanners"
    - "split correctness in information extraction"
    - "deterministic regular expressions with back references"
    - "constant delay algorithms for regular document spanners"
    - "the hardness of solving simple word equations"

Connected through hyperedge HE-3 (induced by source paper "safestrings representing strings as structured data"):
  with members:
    - "refinement types for typescript"
    - "dependent types for javascript"

Connected through hyperedge HE-4 (induced by source paper "towards constraint logic programming over strings for test data generation"):
  with members:
    - "minizinc with strings"

Connected through hyperedge HE-5 (induced by source paper "decision procedures for path feasibility of string manipulating programs with complex operations"):
  with members:
    - "graph logics with rational relations"
    - "recompression a simple and powerful technique for word equations"
    - "the complexity of games on higher order pushdown automata"

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.LO(Logic in Computer Science)