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: "formalization of lerch s theorem using hol light"
  Abstract: The Laplace transform is an algebraic method that is widely used for analyzing physical systems by either solving the differential equations modeling their dynamics or by evaluating their transfer function. The dynamics of the given system are firstly modeled using differential equations and then Laplace transform is applied to convert these differential equations to their equivalent algebraic equations. These equations can further be simplified to either obtain the transfer function of the system or to find out the solution of the differential equations in frequency domain. Next, the uniqueness of the Laplace transform provides the solution of these differential equations in the time domain. The traditional Laplace transform based analysis techniques, i.e., paper-and-pencil proofs and computer simulation methods are error-prone due to their inherent limitations and thus are not suitable for the analysis of the systems. Higher-order-logic theorem proving can overcome these limitations of these techniques and can ascertain accurate analysis of the systems. In this paper, we extend our higher-order logic formalization of the Laplace transform, which includes the formal definition of the Laplace transform and verification of its various classical properties. One of the main contributions of the paper is the formalization of Lerch's theorem, which describes the uniqueness of the Laplace transform and thus plays a vital role in solving linear differential equations in the frequency domain. For illustration, we present the formal analysis of a $4$-$\pi$ soft error crosstalk model, which is widely used in nanometer technologies, such as, Integrated Circuits (ICs).

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)