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: "distributed verification of rare properties with lightweight importance splitting observers"
  Abstract: Rare properties remain a challenge for statistical model checking due to the quadratic scaling of variance with rarity. Importance splitting can addresses this challenge, but makes demands on the encoding of the model-property product automaton. To maximise the performance of importance splitting, the user must be able to define arbitrary functions of the states of the product automaton. To distribute simulations efficiently, the product automaton must be compact and the length of its state must be small compared to the length of a simulation trace. #R##N#In this work we describe an implementation of importance splitting for statistical model checking, using "lightweight" observers that meet the above demands. Specifically, we define an expressive bounded time logic and show how it may be compiled into compactly-described automata, whose memory requirement is only dependent on the length of the formula. We also present fixed and adaptive level importance splitting algorithms, optimised for distribution.

Connected through hyperedge HE-1 (induced by source paper "rare event simulation for non markovian repairable fault trees"):
  with members:
    - "input output stochastic automata with urgency confluence and weak determinism"

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)