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 synthesis of the procedural and declarative styles of interactive theorem proving"
  Abstract: We propose a synthesis of the two proof styles of interactive theorem proving: the procedural style (where proofs are scripts of commands, like in Coq) and the declarative style (where proofs are texts in a controlled natural language, like in Isabelle/Isar). Our approach combines the advantages of the declarative style - the possibility to write formal proofs like normal mathematical text - and the procedural style - strong automation and help with shaping the proofs, including determining the statements of intermediate steps. Our approach is new, and differs significantly from the ways in which the procedural and declarative proof styles have been combined before in the Isabelle, Ssreflect and Matita systems. Our approach is generic and can be implemented on top of any procedural interactive theorem prover, regardless of its architecture and logical foundations. To show the viability of our proposed approach, we fully implemented it as a proof interface called miz3, on top of the HOL Light interactive theorem prover. The declarative language that this interface uses is a slight variant of the language of the Mizar system, and can be used for any interactive theorem prover regardless of its logical foundations. The miz3 interface allows easy access to the full set of tactics and formal libraries of HOL Light, and as such has 'industrial strength'. Our approach gives a way to automatically convert any procedural proof to a declarative counterpart, where the converted proof is similar in size to the original. As all declarative systems have essentially the same proof language, this gives a straightforward way to port proofs between interactive theorem provers.

Connected through hyperedge HE-1 (induced by source paper "reversible computation in term rewriting"):
  with members:
    - "reachability analysis of innermost rewriting"
    - "soundness of unravelings for conditional term rewriting systems via ultra properties related to linearity"
    - "automated complexity analysis based on the dependency pair method"
    - "a structural approach to reversible computation"

Connected through hyperedge HE-2 (induced by source paper "sound structure preserving transformation for weakly left linear deterministic conditional term rewriting systems"):
  with members:
    - "soundness of unravelings for conditional term rewriting systems via ultra properties related to linearity"

Connected through hyperedge HE-3 (induced by source paper "a vernacular for coherent logic"):
  with members:
    - "a fully automatic problem solver with human style output"

Connected through hyperedge HE-4 (induced by source paper "learning assisted automated reasoning with flyspeck"):
  with members:
    - "encoding monomorphic and polymorphic types"
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "blistr the blind strategymaker"
    - "theorem proving in large formal mathematics as an emerging ai field"
    - "atp and presentation service for mizar formalizations"
    - "large formal wikis issues and solutions"
    - "automated reasoning and presentation support for formalizing mathematics in mizar"
    - "proviola a tool for proof re animation"

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)