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: "read eval print in parallel and asynchronous proof checking"
  Abstract: The LCF tradition of interactive theorem proving, which was started by Milner in the 1970-ies, appears to be tied to the classic READ-EVAL-PRINT-LOOP of sequential and synchronous evaluation of prover commands. We break up this loop and retrofit the read-eval-print phases into a model of parallel and asynchronous proof processing. Thus we explain some key concepts of the Isabelle/Scala approach to prover interaction and integration, and the Isabelle/jEdit Prover IDE as front-end technology. We hope to open up the scientific discussion about non-trivial interaction models for ITP systems again, and help getting other old-school proof assistants on a similar track.

Connected through hyperedge HE-1 (induced by source paper "from lcf to isabelle hol"):
  with members:
    - "deciding univariate polynomial problems using untrusted certificates in isabelle hol"
    - "interaction with formal mathematical documents in isabelle pide"
    - "computational logic its origins and applications"
    - "verifying strong eventual consistency in distributed systems"
    - "integrating testing and interactive theorem proving"
    - "a formally verified compiler back end"
    - "natural deduction as higher order resolution"
    - "the foundation of a generic theorem prover"

Connected through hyperedge HE-2 (induced by source paper "interaction with formal mathematical documents in isabelle pide"):
  with members:
    - "isabelle jedit as ide for domain specific formal languages and informal text documents"
    - "system description isabelle jedit in 2014"
    - "pide for asynchronous interaction with coq"
    - "pervasive parallelism in highly trustable interactive theorem proving systems"
    - "pide as front end technology for coq"
    - "isabelle jedit a prover ide within the pide framework"

Connected through hyperedge HE-3 (induced by source paper "isabelle jedit as ide for domain specific formal languages and informal text documents"):
  with members:
    - "system description isabelle jedit in 2014"
    - "pide for asynchronous interaction with coq"

Connected through hyperedge HE-4 (induced by source paper "system description isabelle jedit in 2014"):
  with members:
    - "interactive simplifier tracing and debugging in isabelle"
    - "isabelle jedit a prover ide within the pide framework"

Connected through hyperedge HE-5 (induced by source paper "pervasive parallelism in highly trustable interactive theorem proving systems"):
  with members:
    - "pide as front end technology for coq"
    - "isabelle jedit a prover ide within the pide framework"

Connected through hyperedge HE-6 (induced by source paper "pide as front end technology for coq"):
  with members:
    - "isabelle jedit a prover ide within the pide framework"

Connected through hyperedge HE-7 (induced by source paper "proof in context web editing with rich modeless contextual feedback"):
  with members:
    - "point and write documenting formal mathematics by reference"
    - "a web interface for matita"
    - "understanding the learners actions when using mathematics learning tools"
    - "atp and presentation service for mizar formalizations"
    - "large formal wikis issues and solutions"
    - "proviola a tool for proof re animation"

Connected through hyperedge HE-8 (induced by source paper "getting started with isabelle jedit"):
  with members:
    - "isabelle jedit a prover ide within the pide framework"
    - "isabelle pide as platform for educational tools"

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)