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 "formula transformers and combinatorial test generators for propositional intuitionistic theorem provers"):
  Abstract: We develop combinatorial test generation algorithms for progressively more powerful theorem provers, covering formula languages ranging from the implicational fragment of intuitionistic logic to full intuitionistic propositional logic. Our algorithms support exhaustive and random generators for formulas of these logics. #R##N#To provide known-to-be-provable formulas, via the Curry-Howard formulas-as-types correspondence, we use generators for typable lambda terms and combinator expressions. Besides generators for several classes of formulas, we design algorithms that restrict formula generation to canonical representatives among equiprovable formulas and introduce program transformations that reduce formulas to equivalent formulas of a simpler structure. The same transformations, when applied in reverse, create harder formulas that can catch soundness or incompleteness bugs. #R##N#To test the effectiveness of the testing framework itself, we describe use cases for deriving lightweight theorem provers for several of these logics and for finding bugs in known theorem provers. Our Prolog implementation available at: this https URL and a subset of formula generators and theorem provers, implemented in Python is available at: this https URL. #R##N#Keywords: term and formula generation algorithms, Prolog-based theorem provers, formulas-as-types, type inference and type inhabitation, combinatorial testing, finding bugs in theorem provers.

Includes members:
  Member "modality definition synthesis for epistemic intuitionistic logic via a theorem prover":
    also connected through other hyperedges:
      (none)
  Member "on uniquely closable and uniquely typable skeletons of lambda terms":
    also connected through other hyperedges:
      (none)
  Member "a hiking trip through the orders of magnitude deriving efficient generators for closed simply typed lambda terms and normal forms":
    also connected through other hyperedges:
      (none)
  Member "random generation of closed simply typed lambda terms a synergy between logic programming and boltzmann samplers":
    also connected through other hyperedges:
      (none)
  Member "a natural counting of lambda terms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "combinatorics of explicit substitutions")
  Member "counting and generating terms in the binary lambda calculus extended version":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "position paper towards transparent machine learning")
  Member "a logic programming playground for lambda terms combinators types and tree based arithmetic computations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a hiking trip through the orders of magnitude deriving efficient generators for closed simply typed lambda terms and normal forms")
  Member "counting and generating lambda terms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "combinatorics of explicit substitutions")

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)