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: "algorithmic verification of asynchronous programs"
  Abstract: Asynchronous programming is a ubiquitous systems programming idiom for managing concurrent interactions with the environment. In this style, instead of waiting for time-consuming operations to complete, the programmer makes a non-blocking call to the operation and posts a callback task to a task buffer that is executed later when the time-consuming operation completes. A cooperative scheduler mediates the interaction by picking and executing callback tasks from the task buffer to completion (and these callbacks can post further callbacks to be executed later). Writing correct asynchronous programs is hard because the use of callbacks, while efficient, obscures program control flow.   We provide a formal model underlying asynchronous programs and study verification problems for this model. We show that the safety verification problem for finite-data asynchronous programs is expspace-complete. We show that liveness verification for finite-data asynchronous programs is decidable and polynomial-time equivalent to Petri net reachability. Decidability is not obvious, since even if the data is finite-state, asynchronous programs constitute infinite-state transition systems: both the program stack for an executing task and the task buffer of pending calls to tasks can be potentially unbounded.   Our main technical constructions are polynomial-time, semantics-preserving reductions from asynchronous programs to Petri nets and back. The first reduction allows the use of algorithmic techniques on Petri nets for the verification of asynchronous programs, and the second allows lower bounds on Petri nets to apply also to asynchronous programs.   We also study several extensions to the basic models of asynchronous programs that are inspired by additional capabilities provided by implementations of asynchronous libraries and classify the decidability and undecidability of verification questions on these extensions.

Connected through hyperedge HE-1 (induced by source paper "reachability in fixed dimension vector addition systems with states"):
  with members:
    - "reachability in vector addition systems is primitive recursive in fixed dimension"
    - "linear equations with ordered data"
    - "the reachability problem for petri nets is not elementary"
    - "reasoning about data repetitions with counter systems"
    - "reachability in two dimensional unary vector addition systems with states is nl complete"
    - "reachability in two dimensional vector addition systems with states is pspace complete"
    - "ordered navigation on multi attributed data words"

Connected through hyperedge HE-2 (induced by source paper "re pairing brackets"):
  with members:
    - "complexity of problems of commutative grammars"
    - "decision problems for additive regular functions"
    - "pebble games proof complexity and time space trade offs"
    - "parikh s theorem a simple and direct automaton construction"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-3 (induced by source paper "the reachability problem for petri nets is not elementary"):
  with members:
    - "reachability in vector addition systems is primitive recursive in fixed dimension"
    - "linear equations with ordered data"
    - "verifas a practical verifier for artifact systems"
    - "reasoning about data repetitions with counter systems"
    - "complexity hierarchies beyond elementary"
    - "reachability in two dimensional unary vector addition systems with states is nl complete"
    - "demystifying reachability in vector addition systems"
    - "nonelementary complexities for branching vass mell and extensions"

Connected through hyperedge HE-4 (induced by source paper "the parikh property for weighted context free grammars"):
  with members:
    - "parikh s theorem a simple and direct automaton construction"

Connected through hyperedge HE-5 (induced by source paper "static analysis of deterministic negotiations"):
  with members:
    - "soundness in negotiations"
    - "polynomial analysis algorithms for free choice probabilistic workflow nets"
    - "reduction rules for colored workflow nets"
    - "on negotiation as concurrency primitive ii deterministic cyclic negotiations"
    - "on negotiation as concurrency primitive"

Connected through hyperedge HE-6 (induced by source paper "a polynomial time algorithm for reachability in branching vass in dimension one"):
  with members:
    - "reachability in two dimensional unary vector addition systems with states is nl complete"
    - "demystifying reachability in vector addition systems"
    - "nonelementary complexities for branching vass mell and extensions"

Connected through hyperedge HE-7 (induced by source paper "hitting families of schedules for asynchronous programs"):
  with members:
    - "graph products revisited tight approximation hardness of induced matching poset dimension and more"

Connected through hyperedge HE-8 (induced by source paper "demystifying reachability in vector addition systems"):
  with members:
    - "reasoning about data repetitions with counter systems"
    - "complexity hierarchies beyond elementary"
    - "reachability in two dimensional vector addition systems with states is pspace complete"
    - "an approach to computing downward closures"
    - "complexity bounds for ordinal based termination"
    - "the reachability problem for vector addition systems with a stack is not elementary"
    - "ackermannian and primitive recursive bounds with dickson s lemma"
    - "on selective unboundedness of vass"

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)