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: "on computing fixpoints in well structured regular model checking with applications to lossy channel systems"
  Abstract: We prove a general finite convergence theorem for “upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of fixpoint computations. In particular, we are able to directly obtain several new decidability results on lossy channel systems.

Connected through hyperedge HE-1 (induced by source paper "forward analysis for wsts part iii karp miller trees"):
  with members:
    - "forward analysis for wsts part ii complete wsts"
    - "forward analysis and model checking for trace bounded wsts"

Connected through hyperedge HE-2 (induced by source paper "the complexity of synchronizing markov decision processes"):
  with members:
    - "improving the upper bound on the length of the shortest reset word"
    - "controlling a population"
    - "synchronizing data words for register automata"
    - "computation tree logic for synchronization properties"
    - "trace refinement in labelled markov decision processes"
    - "synchronizing weighted automata"
    - "probabilistic bisimulation naturally on distributions"
    - "fast synchronization of random automata"

Connected through hyperedge HE-3 (induced by source paper "robust synchronization in markov decision processes"):
  with members:
    - "infinite synchronizing words for probabilistic automata erratum"
    - "synchronizing objectives for markov decision processes"

Connected through hyperedge HE-4 (induced by source paper "solving stochastic b uchi games on infinite arenas with a finite attractor"):
  with members:
    - "the parametric ordinal recursive complexity of post embedding problems"
    - "determinacy in stochastic games with unbounded payoff functions"
    - "approximating the termination value of one counter mdps and stochastic games"
    - "qualitative reachability in stochastic bpa games"
    - "multiply recursive upper bounds with higman s lemma"
    - "one counter stochastic games"
    - "recursive concurrent stochastic games"
    - "on termination for faulty channel machines"

Connected through hyperedge HE-5 (induced by source paper "determinacy in stochastic games with unbounded payoff functions"):
  with members:
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "approximating the termination value of one counter mdps and stochastic games"
    - "qualitative reachability in stochastic bpa games"
    - "reachability games on extended vector addition systems with states"
    - "generalized mean payoff and energy games"
    - "one counter stochastic games"
    - "one counter markov decision processes"
    - "recursive concurrent stochastic games"

Connected through hyperedge HE-6 (induced by source paper "forward analysis and model checking for trace bounded wsts"):
  with members:
    - "complexity hierarchies beyond elementary"
    - "reachability in two dimensional vector addition systems with states is pspace complete"
    - "interprocedural reachability for flat integer programs"
    - "algorithmic verification of asynchronous programs"
    - "taming past ltl and flat counter systems"
    - "forward analysis for wsts part ii complete wsts"
    - "ackermannian and primitive recursive bounds with dickson s lemma"
    - "multiply recursive upper bounds with higman s lemma"

Connected through hyperedge HE-7 (induced by source paper "algorithmic metatheorems for decidable ltl model checking over infinite systems"):
  with members:
    - "a framework to handle linear temporal properties in omega regular model checking"
    - "symbolic backwards reachability analysis for higher order pushdown 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.SC(Symbolic Computation)