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: "isabelle jedit a prover ide within the pide framework"
  Abstract: PIDE is a general framework for document-oriented prover interaction and integration, based on a bilingual architecture that combines ML and Scala. The overall aim is to connect LCF-style provers like Isabelle (or Coq or HOL) with sophisticated front-end technology on the JVM platform, overcoming command-line interaction at last. #R##N#The present system description specifically covers Isabelle/jEdit as part of the official release of Isabelle2011-1 (October 2011). It is a concrete Prover IDE implementation based on Isabelle/PIDE library modules (implemented in Scala) on the one hand, and the well-known text editor framework of jEdit (implemented in Java) on the other hand. #R##N#The interaction model of our Prover IDE follows the idea of continuous proof checking: the theory source text is annotated by semantic information by the prover as it becomes available incrementally. This works via an asynchronous protocol that neither blocks the editor nor stops the prover from exploiting parallelism on multi-core hardware. The jEdit GUI provides standard metaphors for augmented text editing (highlighting, squiggles, tooltips, hyperlinks etc.) that we have instrumented to render the formal content from the prover context. Further refinement of the jEdit display engine via suitable plugins and fonts approximates mathematical rendering in the text buffer, including symbols from the TeX repertoire, and sub-/superscripts. #R##N#Isabelle/jEdit is presented here both as a usable interface for current Isabelle, and as a reference application to inspire further projects based on PIDE.

Connected through hyperedge HE-1 (induced by source paper "lifter language to encode induction heuristics for isabelle hol"):
  with members:
    - "pamper proof method recommendation system for isabelle hol"
    - "goal oriented conjecturing for isabelle hol"
    - "proof mining with dependent types"
    - "tactictoe learning to reason with hol4 tactics"
    - "a proof strategy language and proof script generation for isabelle hol"
    - "proof pattern recognition and lemma discovery in acl2"

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"
    - "read eval print in parallel and asynchronous proof checking"

Connected through hyperedge HE-3 (induced by source paper "an integrated development environment for the prototype verification system"):
  with members:
    - "a logic independent ide"

Connected through hyperedge HE-4 (induced by source paper "prototyping systems that explain themselves for education"):
  with members:
    - "teaching the formalization of mathematical theories and algorithms via the automatic checking of finite models"
    - "isabelle pide as platform for educational tools"
    - "automated generation of user guidance by combining computation and deduction"
    - "a wiki for mizar motivation considerations and initial prototype"

Connected through hyperedge HE-5 (induced by source paper "the keymaera x proof ide concepts on usability in hybrid systems theorem proving"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "autoproof auto active functional verification of object oriented programs"
    - "a uniform substitution calculus for differential dynamic logic"
    - "the dafny integrated development environment"
    - "understanding the learners actions when using mathematics learning tools"

Connected through hyperedge HE-6 (induced by source paper "translating scala programs to isabelle hol"):
  with members:
    - "certified hlints with isabelle holcf prelude"

Connected through hyperedge HE-7 (induced by source paper "documentation generator focusing on symbols for the html ized mizar library"):
  with members:
    - "pide for asynchronous interaction with coq"
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "pide as front end technology for coq"
    - "atp and presentation service for mizar formalizations"
    - "large formal wikis issues and solutions"
    - "licensing the mizar mathematical library"
    - "a wiki for mizar motivation considerations and initial prototype"

Connected through hyperedge HE-8 (induced by source paper "mechanizing a process algebra for network protocols"):
  with members:
    - "a process algebra for wireless mesh networks"
    - "showing invariance compositionally for a process algebra for network protocols"
    - "a mechanized proof of loop freedom of the untimed aodv routing protocol"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "verifying safety properties with the tla proof system"

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)