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 "advances in property based testing for alpha prolog"):
  Abstract: $\alpha$Check is a light-weight property-based testing tool built on top of $\alpha$Prolog, a logic programming language based on nominal logic. $\alpha$Prolog is particularly suited to the validation of the meta-theory of formal systems, for example correctness of compiler translations involving name-binding, alpha-equivalence and capture-avoiding substitution. In this paper we describe an alternative to the negation elimination algorithm underlying $\alpha$Check that substantially improves its effectiveness. To substantiate this claim we compare the checker performances w.r.t. two of its main competitors in the logical framework niche, namely the QuickCheck/Nitpick combination offered by Isabelle/HOL and the random testing facility in PLT-Redex.

Includes members:
  Member "a framework for proof certificates in finite state exploration":
    also connected through other hyperedges:
      (none)
  Member "a bi directional refinement algorithm for the calculus of co inductive constructions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a type checker for a logical framework with union and intersection types")
  Member "general bindings and alpha equivalence in nominal isabelle":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "modal logics for nominal transition systems")
  Member "coinductive big step operational semantics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "program sketching with live bidirectional evaluation")
  Member "the bedwyr system for model checking over syntactic expressions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a characterisation of open bisimulation using an intuitionistic modal logic")
  Member "nominal logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beyond sets with atoms definability in first order logic")
  Member "higher order pattern complement and the strict λ calculus":
    also connected through other hyperedges:
      (none)

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)