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: "regular combinators for string transformations"
  Abstract: We focus on (partial) functions that map input strings to a monoid such as the set of integers with addition and the set of output strings with concatenation. The notion of regularity for such functions has been defined using two-way finite-state transducers, (one-way) cost register automata, and MSO-definable graph transformations. In this paper, we give an algebraic and machine-independent characterization of this class analogous to the definition of regular languages by regular expressions. When the monoid is commutative, we prove that every regular function can be constructed from constant functions using the combinators of choice, split sum, and iterated sum, that are analogs of union, concatenation, and Kleene-*, respectively, but enforce unique (or unambiguous) parsing. Our main result is for the general case of non-commutative monoids, which is of particular interest for capturing regular string-to-string transformations for document processing. We prove that the following additional combinators suffice for constructing all regular functions: (1) the left-additive versions of split sum and iterated sum, which allow transformations such as string reversal; (2) sum of functions, which allows transformations such as copying of strings; and (3) function composition, or alternatively, a new concept of chained sum, which allows output values from adjacent blocks to mix.

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"
    - "what is decidable about string constraints with the replaceall function"
    - "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"
    - "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 "first order tree to tree functions"):
  with members:
    - "wreath products of forest algebras with applications to tree logics"
    - "streaming tree transducers"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-3 (induced by source paper "affine extensions of integer vector addition systems with states"):
  with members:
    - "the reachability problem for petri nets is not elementary"
    - "how hard is it to verify flat affine counter systems with the finite monoid property"
    - "reachability in two dimensional vector addition systems with states is pspace complete"
    - "integer vector addition systems with states"
    - "decision problems for additive regular functions"
    - "ackermannian and primitive recursive bounds with dickson s lemma"
    - "bounded parikh automata"

Connected through hyperedge HE-4 (induced by source paper "sequentiality of string to context transducers"):
  with members:
    - "quantitative languages defined by functional automata"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-5 (induced by source paper "string to string interpretations with polynomial size output"):
  with members:
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-6 (induced by source paper "typed lambda calculi and superclasses of regular functions"):
  with members:
    - "string to string interpretations with polynomial size output"

Connected through hyperedge HE-7 (induced by source paper "logics for word transductions with synthesis"):
  with members:
    - "the first reactive synthesis competition syntcomp 2014"
    - "on reversible transducers"
    - "on equivalence and uniformisation problems for finite transducers"
    - "synthesis of deterministic top down tree transducers from automatic tree relations"
    - "a short note on two variable logic with a linear order successor and a preorder successor"
    - "transducers with origin information"
    - "two variable logic with two order relations"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-8 (induced by source paper "streamable regular transductions"):
  with members:
    - "on the expressibility of copyless cost register automata"
    - "nested weighted automata"
    - "decision problems for additive regular functions"
    - "streaming tree transducers"
    - "ltl with the freeze quantifier and register automata"
    - "mso definable string transductions and two way finite state transducers"

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.FL(Formal Languages and Automata Theory)