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: "hordesat a massively parallel portfolio sat solver"
  Abstract: A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution. The SAT solvers in the portfolio can be instances of a single solver with different configuration settings. Additionally the solvers can exchange information usually in the form of clauses. In this paper we investigate whether this approach is applicable in the case of massively parallel SAT solving. Our solver is intended to run on clusters with thousands of processors, hence the name HordeSat. HordeSat is a fully distributed portfolio-based SAT solver with a modular design that allows it to use any SAT solver that implements a given interface. HordeSat has a decentralized design and features hierarchical parallelism with interleaved communication and search. We experimentally evaluated it using all the benchmark problems from the application tracks of the 2011 and 2014 International SAT Competitions. The experiments demonstrate that HordeSat is scalable up to hundreds or even thousands of processors achieving significant speedups especially for hard instances.

Connected through hyperedge HE-1 (induced by source paper "a review of literature on parallel constraint solving"):
  with members:
    - "parallel strategies selection"
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "a multicore tool for constraint solving"
    - "the shape of the search tree for the maximum clique problem and the implications for parallel branch and bound"
    - "proteus a hierarchical portfolio of solvers and transformations"
    - "asymmetric distributed constraint optimization problems"
    - "algorithm selection for combinatorial search problems a survey"
    - "distributed solving through model splitting"

Connected through hyperedge HE-2 (induced by source paper "computing storyline visualizations with few block crossings"):
  with members:
    - "crossing minimization in storyline visualization"
    - "block crossings in storyline visualizations"
    - "on minimizing crossings in storyline visualizations"

Connected through hyperedge HE-3 (induced by source paper "hordeqbf a modular and massively parallel qbf solver"):
  with members:
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

Connected through hyperedge HE-4 (induced by source paper "mplrs a scalable parallel vertex facet enumeration code"):
  with members:
    - "an analysis of budgeted parallel search on conditional galton watson trees"
    - "a parallel framework for reverse search using mts"
    - "faster geometric algorithms via dynamic determinant computation"
    - "bounds on multiple sensor fusion"
    - "the shape of the search tree for the maximum clique problem and the implications for parallel branch and bound"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

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)