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: "towards parallel boolean functional synthesis"
  Abstract: Given a relational specification R(X, Y), where X and Y are sequences of input and output variables, we wish to synthesize each output as a function of the inputs such that the specification holds. This is called the Boolean functional synthesis problem and has applications in several areas. In this paper, we present the first parallel approach for solving this problem, using compositional and CEGAR-style reasoning as key building blocks. We show by means of extensive experiments that our approach outperforms existing tools on a large class of benchmarks.

Connected through hyperedge HE-1 (induced by source paper "knowledge compilation for boolean functional synthesis"):
  with members:
    - "understanding and extending incremental determinization for 2qbf"
    - "what s hard about boolean functional synthesis"
    - "functional synthesis via input output separation"
    - "skolem functions for factored formulas"
    - "propositional independence formula variable independence and forgetting"
    - "a knowledge compilation map"

Connected through hyperedge HE-2 (induced by source paper "functional synthesis via input output separation"):
  with members:
    - "sequential relational decomposition"
    - "what s hard about boolean functional synthesis"
    - "symbolic ltlf synthesis"
    - "the second reactive synthesis competition syntcomp 2015"
    - "skolem functions for factored formulas"

Connected through hyperedge HE-3 (induced by source paper "what s hard about boolean functional synthesis"):
  with members:
    - "symbolic ltlf synthesis"
    - "the second reactive synthesis competition syntcomp 2015"
    - "skolem functions for factored formulas"
    - "abssynthe abstract synthesis from succinct safety specifications"

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)