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: "pide as front end technology for coq"
  Abstract: Isabelle/PIDE is the current Prover IDE technology for Isabelle. It has been developed in ML and Scala in the past 4-5 years for this particular proof assistant, but with an open mind towards other systems. PIDE is based on an asynchronous document model, where the prover receives edits continuously and updates its internal state accordingly. The interpretation of edits and the policies for proof document processing are determined by the prover. The editor front-end merely takes care of visual rendering of formal document content. #R##N#Here we report on an experiment to connect Coq to the PIDE infrastructure of Isabelle. This requires to re-implement the core PIDE protocol layer of Isabelle/ML in OCaml. The payload for semantic processing of proof document content is restricted to lexical analysis in the sense of existing CoqIde functionality. This is sufficient as proof-of-concept for PIDE connectivity. Actual proof processing is then a matter of improving Coq towards timeless and stateless proof processing, independently of PIDE technicalities. The implementation worked out smoothly and required minimal changes to the refined PIDE architecture of Isabelle2013. #R##N#This experiment substantiates PIDE as general approach to prover interaction. It illustrates how other provers of the greater ITP family can participate by following similar reforms of the classic TTY loop as was done for Isabelle in the past few years.

Connected through hyperedge HE-1 (induced by source paper "qed at large a survey of engineering of formally verified software"):
  with members:
    - "bridging the gap between programming languages and hardware weak memory models"
    - "automatic software repair a bibliography"
    - "the redprl proof assistant invited paper"
    - "verifying strong eventual consistency in distributed systems"
    - "algebraic foundations of proof refinement"
    - "deep network guided proof search"
    - "understanding and maintaining tactics graphically or how we are learning that a diagram can be worth more than 10k loc"
    - "gradual certified programming in coq"

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"
    - "read eval print in parallel and asynchronous proof checking"
    - "isabelle jedit a prover ide within the pide framework"

Connected through hyperedge HE-3 (induced by source paper "jscoq towards hybrid theorem proving interfaces"):
  with members:
    - "asynchronous processing of coq documents from the kernel up to the user interface"
    - "proviola a tool for proof re animation"

Connected through hyperedge HE-4 (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"
    - "isabelle jedit a prover ide within the pide framework"
    - "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-5 (induced by source paper "pervasive parallelism in highly trustable interactive theorem proving systems"):
  with members:
    - "read eval print in parallel and asynchronous proof checking"
    - "isabelle jedit a prover ide within the pide framework"

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.HC(Human-Computer Interaction)