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 "a characterisation of open bisimulation using an intuitionistic modal logic"):
  Abstract: Open bisimilarity is a notion of bisimilarity for the pi-calculus that is a congruence. In open bisimilarity, free names in processes are treated as variables that may be instantiated lazily; in contrast to early and late bisimilarity where free names are constants. We build on the established line of work, due to Milner, Parrow, and Walker, on classical modal logics characterising early and late bisimilarity for the pi-calculus. The important insight is, to characterise open bisimilarity, we move to the setting of intuitionistic modal logics. The intuitionistic modal logic introduced, called OM, is such that modalities are closed under (respectful) substitutions, inducing a property known as intuitionistic hereditary. Intuitionistic hereditary reflects the lazy instantiation of names in open bisimilarity. The soundness proof for open bisimilarity with respect to the modal logic is mechanised in Abella. The constructive content of the completeness proof provides an algorithm for generating distinguishing formulae, where such formulae are useful as a certificate explaining why two processes are not open bisimilar. We draw attention to the fact that open bisimilarity is not the only notion of bisimilarity that is a congruence: for name-passing calculi there is a classical/intuitionistic spectrum of equivalences.

Includes members:
  Member "modal logics for nominal transition systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scalar and vectorial mu calculus with atoms")
  Member "a bisimilarity congruence for the applied pi calculus sufficiently coarse to verify privacy properties":
    also connected through other hyperedges:
      (none)
  Member "generating witness of non bisimilarity for the pi calculus":
    also connected through other hyperedges:
      (none)
  Member "the applied pi calculus mobile values new names and secure communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discovering epassport vulnerabilities using bisimilarity")
  Member "a two level logic approach to reasoning about computations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "schematic polymorphism in the abella proof assistant")
  Member "the bedwyr system for model checking over syntactic expressions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a proof theory for model checking an extended abstract")

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)