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: "attracting tangles to solve parity games"
  Abstract: Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, because they are widely believed to admit a polynomial solution, but so far no such algorithm is known.

Connected through hyperedge HE-1 (induced by source paper "simple fixpoint iteration to solve parity games"):
  with members:
    - "solving parity games using an automata based algorithm"
    - "a comparison of bdd based parity game solvers"
    - "oink an implementation and evaluation of modern parity game solvers"
    - "a parity game tale of two counters"
    - "succinct progress measures for solving parity games"
    - "benchmarks for parity games"
    - "the fixpoint iteration algorithm for parity games"

Connected through hyperedge HE-2 (induced by source paper "a parity game tale of two counters"):
  with members:
    - "simple fixpoint iteration to solve parity games"
    - "solving parity games using an automata based algorithm"
    - "parity games zielonka s algorithm in quasi polynomial time"
    - "oink an implementation and evaluation of modern parity game solvers"
    - "robust exponential worst cases for divide et impera algorithms for parity games"
    - "efficient parallel strategy improvement for parity games"
    - "succinct progress measures for solving parity games"
    - "a delayed promotion policy for parity games"

Connected through hyperedge HE-3 (induced by source paper "a delayed promotion policy for parity games"):
  with members:
    - "oink an implementation and evaluation of modern parity game solvers"
    - "robust exponential worst cases for divide et impera algorithms for parity games"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "reasoning about strategies on the satisfiability problem"
    - "symmetric strategy improvement"
    - "optimal strategy synthesis for request response games"
    - "reasoning about strategies on the model checking problem"

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)