human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "proof search specifications of bisimulation and modal logics for the pi calculus"):
  Abstract: We specify the operational semantics and bisimulation relations for the finite pi-calculus within a logic that contains the nabla quantifier for encoding generic judgments and definitions for encoding fixed points. Since we restrict to the finite case, the ability of the logic to unfold fixed points allows this logic to be complete for both the inductive nature of operational semantics and the coinductive nature of bisimulation. The nabla quantifier helps with the delicate issues surrounding the scope of variables within pi-calculus expressions and their executions (proofs). We illustrate several merits of the logical specifications permitted by this logic: they are natural and declarative; they contain no side-conditions concerning names of variables while maintaining a completely formal treatment of such variables; differences between late and open bisimulation relations arise from familar logic distinctions; the interplay between the three quantifiers (for all, exists, and nabla) and their scopes can explain the differences between early and late bisimulation and between various modal operators based on bound input and output actions; and proof search involving the application of inference rules, unification, and backtracking can provide complete proof systems for one-step transitions, bisimulation, and satisfaction in modal logic. We also illustrate how one can encode the pi-calculus with replications, in an extended logic with induction and co-induction.

Includes members:
  Member "formalising the pi calculus using nominal logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rule formats for nominal process calculi")
  Member "induction and co induction in sequent calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "combining deduction modulo and logics of fixed point definitions")
  Member "the bedwyr system for model checking over syntactic expressions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a characterisation of open bisimulation using an intuitionistic modal logic")
  Member "focusing and polarization in intuitionistic logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a sequent calculus proof search procedure and counter model generation based on natural deduction bounds")
  Member "natural deduction as higher order resolution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generating correctness proofs with neural networks")
  Member "reasoning with higher order abstract syntax in a logical framework":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "formalization of metatheory of the quipper quantum programming language in a linear logic")
  Member "isabelle the next 700 theorem provers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "from lcf to isabelle hol")

Question: Please tell me which class the source paper 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)