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: "a temporal logic for hyperproperties"
  Abstract: Hyperproperties, as introduced by Clarkson and Schneider, characterize the correctness of a computer program as a condition on its set of computation paths. Standard temporal logics can only refer to a single path at a time, and therefore cannot express many hyperproperties of interest, including noninterference and other important properties in security and coding theory. In this paper, we investigate an extension of temporal logic with explicit path variables. We show that the quantification over paths naturally subsumes other extensions of temporal logic with operators for information flow and knowledge. The model checking problem for temporal logic with path quantification is decidable. For alternation depth 1, the complexity is PSPACE in the length of the formula and NLOGSPACE in the size of the system, as for linear-time temporal logic.

Connected through hyperedge HE-1 (induced by source paper "a roadmap toward the resilient internet of things for cyber physical systems"):
  with members:
    - "model based verification and validation of an autonomous vehicle system"
    - "deepmarks a digital fingerprinting framework for deep neural networks"
    - "mlcapsule guarded offline deployment of machine learning as a service"
    - "reachability analysis and safety verification for neural network control systems"
    - "introduction of a hybrid monitor to cyber physical systems"
    - "verification for machine learning autonomy and neural networks survey"
    - "re purposing compact neuronal circuit policies to govern reinforcement learning tasks"
    - "efficient deep learning on multi source private data"

Connected through hyperedge HE-2 (induced by source paper "model checking quantitative hyperproperties"):
  with members:
    - "the density of linear time properties"
    - "datalair efficient block storage with plausible deniability against multi snapshot adversaries"
    - "plausible deniability for privacy preserving data synthesis"
    - "the complexity of counting models of linear time temporal logic"
    - "quantitative information flow as safety and liveness hyperproperties"
    - "on bounding problems of quantitative information flow"

Connected through hyperedge HE-3 (induced by source paper "specification and inference of trace refinement relations"):
  with members:
    - "datalog based scalable semantic diffing of concurrent programs"
    - "verifying equivalence of database driven applications"
    - "kleene algebra modulo theories"
    - "automating induction for solving horn clauses"
    - "symbolic algorithms for language equivalence and kleene algebra with tests"
    - "kleene algebra with domain"

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

Connected through hyperedge HE-5 (induced by source paper "putting strong linearizability in context preserving hyperproperties in programs that use concurrent objects"):
  with members:
    - "strongly linearizable implementations of snapshots and other types"
    - "proving linearizability using forward simulations"
    - "linearizable implementations do not suffice for randomized distributed computation"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-6 (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"
    - "monitoring hyperproperties"

Connected through hyperedge HE-7 (induced by source paper "whither programs as specifications"):
  with members:
    - "hypercollecting semantics and its application to static analysis of information flow"
    - "towards patterns for heaps and imperative lambdas"
    - "on the expressive power of kleene algebra with domain"
    - "epistemic temporal logic for information flow security"

Connected through hyperedge HE-8 (induced by source paper "doping tests for cyber physical systems"):
  with members:
    - "is your software on dope formal analysis of surreptitiously enhanced programs"
    - "leveraging applications of formal methods verification and validation discussion dissemination applications"

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)