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: "tight cutoffs for guarded protocols with fairness"
  Abstract: Guarded protocols were introduced in a seminal paper by Emerson and Kahlon 2000, and describe systems of processes whose transitions are enabled or disabled depending on the existence of other processes in certain local states. We study parameterized model checking and synthesis of guarded protocols, both aiming at formal correctness arguments for systems with any number of processes. Cutoff results reduce reasoning about systems with an arbitrary number of processes to systems of a determined, fixed size. Our work stems from the observation that existing cutoff results for guarded protocols i are restricted to closed systems, and ii are of limited use for liveness properties because reductions do not preserve fairness. We close these gaps and obtain new cutoff results for open systems with liveness properties under fairness assumptions. Furthermore, we obtain cutoffs for the detection of global and local deadlocks, which are of paramount importance in synthesis. Finally, we prove tightness or asymptotic tightness for the new cutoffs.

Connected through hyperedge HE-1 (induced by source paper "promptness and bounded fairness in concurrent and parameterized systems"):
  with members:
    - "distributed synthesis for parameterized temporal logics"
    - "analyzing guarded protocols better cutoffs more systems more expressivity"
    - "parameterized synthesis case study amba ahb"
    - "decidability problems for actor systems"
    - "parameterized model checking of timed systems with conjunctive guards"
    - "parametric linear dynamic logic"
    - "parameterized model checking of token passing systems"
    - "parameterized verification of asynchronous shared memory systems"

Connected through hyperedge HE-2 (induced by source paper "structural invariants for the verification of systems with parameterized architectures"):
  with members:
    - "checking deadlock freedom of parametric component based systems"
    - "analyzing guarded protocols better cutoffs more systems more expressivity"
    - "approaching the coverability problem continuously"

Connected through hyperedge HE-3 (induced by source paper "analyzing guarded protocols better cutoffs more systems more expressivity"):
  with members:
    - "bounded cycle synthesis"
    - "parameterized synthesis case study amba ahb"
    - "decidability problems for actor systems"
    - "parameterized model checking of token passing systems"

Connected through hyperedge HE-4 (induced by source paper "reachability in networks of register protocols under stochastic schedulers"):
  with members:
    - "model checking parameterized asynchronous shared memory systems"
    - "an automata theoretic approach to the verification of distributed algorithms"
    - "parameterised pushdown systems with non atomic writes"

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)