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: "synthesizing functional reactive programs"
  Abstract: We present the first method to synthesize functional reactive programs from temporal logic specifications. Existing algorithms for the synthesis of reactive systems target finite-state implementations, such as hardware circuits, but fail when it comes to complex data transformations. Reactive programs instead provide a promising alternative to overcome this obstacle. They allow for abstraction from concrete implementations of data transformations while shifting focus to the higher order control of data. In Functional Reactive Programming (FRP), this separation of control and data is even made strict, as it makes for a fundamental building block of its well defined operational semantics. #R##N#In this paper we define the theoretical foundations and implement the first tool for the construction of data-intensive functional reactive programs from temporal logic specifications. We introduce Temporal Stream Logic (TSL) which allows for the specification of control, but abstracts from actual data. Given a specification in TSL, our synthesis procedure constructs an FRP program that is guaranteed to implement the specified control. We report on experience with our framework and tool implementation on a collection of both new and existing synthesis benchmarks.

Connected through hyperedge HE-1 (induced by source paper "practical synthesis of reactive systems from ltl specifications via parity games"):
  with members:
    - "the 5th reactive synthesis competition syntcomp 2018 benchmarks participants results"
    - "bosy an experimentation framework for bounded synthesis"
    - "bounded synthesis of reactive programs"
    - "one theorem to rule them all a unified translation of ltl into ω automata"
    - "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"
    - "ltl to deterministic emerson lei automata"
    - "from ltl and limit deterministic b uchi automata to deterministic parity automata"
    - "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"

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)