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: "linear equations with ordered data"
  Abstract: Following a recently considered generalization of linear equations to unordered data vectors, we perform a further generalization to ordered data vectors. These generalized equations naturally appear in the analysis of vector addition systems (or Petri nets) extended with ordered data. We show that nonnegative-integer solvability of linear equations is computationally equivalent (up to an exponential blowup) with the reachability problem for (plain) vector addition systems. This high complexity is surprising, and contrasts with NP-completeness for unordered data vectors. Also surprisingly, we achieve polynomial time complexity of the solvability problem when the nonnegative-integer restriction on solutions is dropped.

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"
    - "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"
    - "algorithmic verification of asynchronous programs"

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

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"
    - "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"
    - "reachability in two dimensional vector addition systems with states 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)