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: "monitoring hyperproperties"
  Abstract: Hyperproperties, such as non-interference and observational determinism, relate multiple system executions to each other. They are not expressible in standard temporal logics, like LTL, CTL, and CTL*, and thus cannot be monitored with standard runtime verification techniques. HyperLTL extends linear-time temporal logic (LTL) with explicit quantification over traces in order to express Hyperproperties. We investigate the runtime verification problem of HyperLTL formulas for three different input models: (1) The parallel model, where a fixed number of system executions is processed in parallel. (2) The unbounded sequential model, where system executions are processed sequentially, one execution at a time. In this model, the number of incoming executions may grow forever. (3) The bounded sequential model where the traces are processed sequentially and the number of incoming executions is bounded. We show that deciding monitorability of HyperLTL formulas is PSPACE-complete for input models (1) and (3). Deciding monitorability is PSPACE-complete for alternation-free HyperLTL formulas in input model (2). For every input model, we provide practical monitoring algorithms. We also present various optimization techniques. By recognizing properties of specifications such as reflexivity, symmetry, and transitivity, we reduce the number of comparisons between traces. For the sequential models, we present a technique that minimized the number of traces that need to be stored. Finally, we provide an optimization that succinctly represents the stored traces by sharing common prefixes. We evaluate our optimizations, showing that this leads to much more scalable monitoring, in particular, significantly lower memory consumption.

Connected through hyperedge HE-1 (induced by source paper "synthesizing reactive systems from hyperproperties"):
  with members:
    - "bosy an experimentation framework for bounded synthesis"
    - "encodings of bounded synthesis"
    - "the first order logic of hyperproperties"
    - "detecting unrealizability of distributed fault tolerant systems"
    - "a temporal logic for hyperproperties"

Connected through hyperedge HE-2 (induced by source paper "constraint based monitoring of hyperproperties"):
  with members:
    - "rvhyper a runtime verification tool for temporal hyperproperties"
    - "model checking quantitative hyperproperties"
    - "synthesizing reactive systems from hyperproperties"
    - "a temporal logic for hyperproperties"

Connected through hyperedge HE-3 (induced by source paper "gray box monitoring of hyperproperties"):
  with members:
    - "monitoring data minimisation"
    - "data minimisation a language based approach long version"

Connected through hyperedge HE-4 (induced by source paper "rvhyper a runtime verification tool for temporal hyperproperties"):
  with members:
    - "a temporal logic for hyperproperties"

Connected through hyperedge HE-5 (induced by source paper "mghyper checking satisfiability of hyperltl formulas beyond the exists forall fragment"):
  with members:
    - "rvhyper a runtime verification tool for temporal hyperproperties"

Connected through hyperedge HE-6 (induced by source paper "on verifying timed hyperproperties"):
  with members:
    - "model checking quantitative hyperproperties"
    - "hyperpctl a temporal logic for probabilistic hyperproperties"
    - "spectre attacks exploiting speculative execution"
    - "real time synthesis is hard"
    - "bounded determinization of timed automata with silent transitions"

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)