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: "approaching the coverability problem continuously"
  Abstract: The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward-coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstrate the effectiveness of our approach on standard benchmarks from the literature, which shows that our approach decides significantly more instances than any existing tool and is in addition often much faster, in particular on large instances.

Connected through hyperedge HE-1 (induced by source paper "loop summarization with rational vector addition systems extended version"):
  with members:
    - "invariant generation for multi path loops with polynomial assignments"
    - "polynomial invariants for affine programs"
    - "integer vector addition systems with states"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "a quantifier elimination algorithm for linear real arithmetic"

Connected through hyperedge HE-2 (induced by source paper "continuous reachability for unordered data petri nets is in ptime"):
  with members:
    - "linear equations with ordered data"
    - "the reachability problem for petri nets is not elementary"
    - "linear combinations of unordered data vectors"
    - "demystifying reachability in vector addition systems"

Connected through hyperedge HE-3 (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"
    - "tight cutoffs for guarded protocols with fairness"

Connected through hyperedge HE-4 (induced by source paper "decidable inductive invariants for verification of cryptographic protocols with unbounded sessions"):
  with members:
    - "a proof theoretic analysis of intruder theories"
    - "forward analysis for wsts part i completions"

Connected through hyperedge HE-5 (induced by source paper "linear equations with ordered data"):
  with members:
    - "linear combinations of unordered data vectors"

Connected through hyperedge HE-6 (induced by source paper "linear combinations of unordered data vectors"):
  with members:
    - "model checking flat freeze ltl on one counter automata"
    - "homogeneous equations of algebraic petri nets"
    - "demystifying reachability in vector addition systems"
    - "automata theory in nominal sets"
    - "integer vector addition systems with states"
    - "the power of well structured systems"

Connected through hyperedge HE-7 (induced by source paper "occam s razor applied to the petri net coverability problem"):
  with members:
    - "automatic verification of erlang style concurrency"

Connected through hyperedge HE-8 (induced by source paper "context free commutative grammars with integer counters and resets"):
  with members:
    - "complexity of problems of commutative grammars"
    - "demystifying reachability in vector addition systems"
    - "tightening the complexity of equivalence problems for commutative grammars"
    - "unary pushdown automata and straight line programs"
    - "integer vector addition systems with states"
    - "subclasses of presburger arithmetic and the weak exp hierarchy"
    - "semilinearity and context freeness of languages accepted by valence automata"

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)