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: "bounded synthesis of register transducers"
  Abstract: Reactive synthesis aims at automatic construction of systems from their behavioural specifications. The research mostly focuses on synthesis of systems dealing with Boolean signals. But real-life systems are often described using bit-vectors, integers, etc. Bit-blasting would make such systems unreadable, hit synthesis scalability, and is not possible for infinite data-domains. One step closer to real-life systems are register transducers: they can store data-input into registers and later output the content of a register, but they do not directly depend on the data-input, only on its comparison with the registers. Previously it was proven that synthesis of register transducers from register automata is undecidable, but there the authors considered transducers equipped with the unbounded queue of registers. First, we prove the problem becomes decidable if bound the number of registers in transducers, by reducing the problem to standard synthesis of Boolean systems. Second, we show how to use quantified temporal logic, instead of automata, for specifications.

Connected through hyperedge HE-1 (induced by source paper "on computability of data word functions defined by transducers"):
  with members:
    - "synthesis of data word transducers"
    - "deciding the computability of regular functions over infinite words"
    - "on equivalence and uniformisation problems for finite transducers"
    - "degrees of lookahead in regular infinite games"
    - "ltl with the freeze quantifier and register automata"

Connected through hyperedge HE-2 (induced by source paper "parameterized synthesis for fragments of first order logic over data words"):
  with members:
    - "synthesis of data word transducers"
    - "playing with repetitions in data words using energy games"
    - "distributed synthesis for parameterized temporal logics"
    - "playing games in the baire space"
    - "automated synthesis of distributed controllers"
    - "optimal strategy synthesis for request response games"
    - "petri games synthesis of distributed systems with causal memory"
    - "solving parity games on integer vectors"

Connected through hyperedge HE-3 (induced by source paper "decidable synthesis of programs with uninterpreted functions"):
  with members:
    - "proving unrealizability for syntax guided synthesis"
    - "a decidable fragment of second order logic with applications to synthesis"
    - "decidable verification of uninterpreted programs"
    - "program synthesis using abstraction refinement"
    - "abstract learning frameworks for synthesis"
    - "a theory of formal synthesis via inductive learning"
    - "what s decidable about syntax guided synthesis"
    - "distributed synthesis for acyclic architectures"

Connected through hyperedge HE-4 (induced by source paper "synthesis of data word transducers"):
  with members:
    - "playing with repetitions in data words using energy games"
    - "logics for word transductions with synthesis"
    - "on equivalence and uniformisation problems for finite transducers"
    - "two variable logic with two order relations"
    - "ltl with the freeze quantifier and register 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.FL(Formal Languages and Automata Theory)