human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "formal verification of cyber physical systems using theorem proving invited paper"):
  Abstract: Due to major breakthroughs in software and engineering technologies, embedded systems are increasingly being utilized in areas ranging from aerospace and next-generation transportation systems, to smart grid and smart cities, to health care systems, and broadly speaking to what is known as Cyber-Physical Systems (CPS). A CPS is primarily composed of several electronic, communication and controller modules and some actuators and sensors. The mix of heterogeneous underlying smart technologies poses a number of technical challenges to the design and more severely to the verification of such complex infrastructure. In fact, a CPS shall adhere to strict safety, reliability, performance and security requirements, where one needs to capture both physical and random aspects of the various CPS modules and then analyze their interrelationship across interlinked continuous and discrete dynamics. Often times however, system bugs remain uncaught during the analysis and in turn cause unwanted scenarios that may have serious consequences in safety-critical applications. In this paper, we introduce some of the challenges surrounding the design and verification of contemporary CPS with the advent of smart technologies. In particular, we survey recent developments in the use of theorem proving, a formal method, for the modeling, analysis and verification of CPS, and overview some real world CPS case studies from the automotive, avionics and healthtech domains from system level to physical components.

Includes members:
  Member "formal analysis of robotic cell injection systems using theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "formal modeling of robotic cell injection systems in higher order logic")
  Member "qwire practice formal verification of quantum circuits in coq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "toward certified quantum programming")
  Member "formal analysis of linear control systems using theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "formal analysis of the biological circuits using higher order logic theorem proving")
  Member "formal analysis of continuous time systems using fourier transform":
    also connected through other hyperedges:
      (none)
  Member "formalization of transform methods using hol light":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "formal analysis of the biological circuits using higher order logic theorem proving")
  Member "towards formal fault tree analysis using theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the formalization of importance measures using hol theorem proving")
  Member "a verified compiler for probability density functions":
    also connected through other hyperedges:
      (none)
  Member "towards the formal reliability analysis of oil and gas pipelines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the formalization of importance measures using hol theorem proving")

Question: Please tell me which class the source paper 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)