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: "the general vector addition system reachability problem by presburger inductive invariants"
  Abstract: The reachability problem for Vector Addition Systems (VASs) is a central#N#problem of net theory. The general problem is known to be decidable by#N#algorithms exclusively based on the classical#N#Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition. This decomposition is#N#used in this paper to prove that the Parikh images of languages recognized by#N#VASs are semi-pseudo-linear; a class that extends the semi-linear sets, a.k.a.#N#the sets definable in Presburger arithmetic. We provide an application of this#N#result; we prove that a final configuration is not reachable from an initial#N#one if and only if there exists a semi-linear inductive invariant that contains#N#the initial configuration but not the final one. Since we can decide if a#N#Presburger formula denotes an inductive invariant, we deduce that there exist#N#checkable certificates of non-reachability. In particular, there exists a#N#simple algorithm for deciding the general VAS reachability problem based on two#N#semi-algorithms. A first one that tries to prove the reachability by#N#enumerating finite sequences of actions and a second one that tries to prove#N#the non-reachability by enumerating Presburger formulas.

Connected through hyperedge HE-1 (induced by source paper "reachability is tower complete"):
  with members:
    - "reachability in vector addition systems is primitive recursive in fixed dimension"
    - "the reachability problem for petri nets is not elementary"
    - "complexity hierarchies beyond elementary"
    - "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"
    - "complexity bounds for ordinal based termination"

Connected through hyperedge HE-2 (induced by source paper "reachability in vector addition systems is primitive recursive in fixed dimension"):
  with members:
    - "the reachability problem for petri nets is not elementary"
    - "vass reachability in three steps"
    - "unboundedness problems for languages of vector addition systems"
    - "on the upward downward closures of petri nets"
    - "the complexity of downward closure comparisons"
    - "complexity hierarchies beyond elementary"
    - "reachability in two dimensional unary vector addition systems with states is nl complete"
    - "demystifying reachability in vector addition systems"

Connected through hyperedge HE-3 (induced by source paper "the complexity of reachability in affine vector addition systems with states"):
  with members:
    - "how hard is it to verify flat affine counter systems with the finite monoid property"
    - "demystifying reachability in vector addition systems"

Connected through hyperedge HE-4 (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-5 (induced by source paper "relational type checking for mell proof structures part 1 multiplicatives"):
  with members:
    - "non idempotent intersection types and strong normalisation"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-6 (induced by source paper "separability of reachability sets of vector addition systems"):
  with members:
    - "demystifying reachability in vector addition systems"
    - "invisible pushdown languages"

Connected through hyperedge HE-7 (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"
    - "algorithmic verification of asynchronous programs"
    - "ackermannian and primitive recursive bounds with dickson s lemma"

Connected through hyperedge HE-8 (induced by source paper "reachability in two dimensional vector addition systems with states is pspace complete"):
  with members:
    - "demystifying reachability in vector addition systems"
    - "integer vector addition systems with states"
    - "reachability in two clock timed automata is pspace complete"

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)