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: "counting and generating lambda terms"
  Abstract: Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation. This paper tries to answer questions like: How many terms of a given size are there? What is a "typical" structure of a simply typable term? Despite their ostensible simplicity, these questions still remain unanswered, whereas solutions to such problems are essential for testing compilers and optimizing programs whose expected efficiency depends on the size of terms. Our approach toward the afore-mentioned problems may be later extended to any language with bound variables, i.e., with scopes and declarations. This paper presents two complementary approaches: one, theoretical, uses complex analysis and generating functions, the other, experimental, is based on a generator of lambda-terms. Thanks to de Bruijn indices, we provide three families of formulas for the number of closed lambda terms of a given size and we give four relations between these numbers which have interesting combinatorial interpretations. As a by-product of the counting formulas, we design an algorithm for generating lambda terms. Performed tests provide us with experimental data, like the average depth of bound variables and the average number of head lambdas. We also create random generators for various sorts of terms. Thereafter, we conduct experiments that answer questions like: What is the ratio of simply typable terms among all terms? (Very small!) How are simply typable lambda terms distributed among all lambda terms? (A typable term almost always starts with an abstraction.) In this paper, abstractions and applications have size 1 and variables have size 0.

Connected through hyperedge HE-1 (induced by source paper "formula transformers and combinatorial test generators for propositional intuitionistic theorem provers"):
  with members:
    - "modality definition synthesis for epistemic intuitionistic logic via a theorem prover"
    - "on uniquely closable and uniquely typable skeletons of lambda terms"
    - "a hiking trip through the orders of magnitude deriving efficient generators for closed simply typed lambda terms and normal forms"
    - "random generation of closed simply typed lambda terms a synergy between logic programming and boltzmann samplers"
    - "a natural counting of lambda terms"
    - "counting and generating terms in the binary lambda calculus extended version"
    - "a logic programming playground for lambda terms combinators types and tree based arithmetic computations"

Connected through hyperedge HE-2 (induced by source paper "combinatorics of explicit substitutions"):
  with members:
    - "counting environments and closures"
    - "normal order reduction grammars"
    - "combinatorics of lambda terms a natural approach"
    - "leftmost outermost beta reduction is invariant indeed"
    - "a natural counting of lambda terms"
    - "counting and generating terms in the binary lambda calculus extended version"
    - "modular complexity analysis for term rewriting"
    - "on constructor rewrite systems and the lambda calculus"

Connected through hyperedge HE-3 (induced by source paper "quantitative aspects of linear and affine closed lambda terms"):
  with members:
    - "linear lambda terms as invariants of rooted trivalent maps"
    - "a natural counting of lambda terms"
    - "counting and generating terms in the binary lambda calculus extended version"
    - "counting isomorphism classes of β normal linear lambda terms"
    - "a correspondence between rooted planar maps and normal planar lambda terms"
    - "boltzmann samplers for random generation of lambda terms"
    - "on counting untyped lambda terms"
    - "how big is bci fragment of bck logic"

Connected through hyperedge HE-4 (induced by source paper "on uniquely closable and uniquely typable skeletons of lambda terms"):
  with members:
    - "counting and generating terms in the binary lambda calculus extended version"
    - "on counting untyped lambda terms"

Connected through hyperedge HE-5 (induced by source paper "a hiking trip through the orders of magnitude deriving efficient generators for closed simply typed lambda terms and normal forms"):
  with members:
    - "a natural counting of lambda terms"
    - "counting and generating terms in the binary lambda calculus extended version"
    - "a logic programming playground for lambda terms combinators types and tree based arithmetic computations"
    - "boltzmann samplers for random generation of lambda terms"

Connected through hyperedge HE-6 (induced by source paper "skeletal program enumeration for rigorous compiler testing"):
  with members:
    - "counting and generating terms in the binary lambda calculus extended version"
    - "on counting untyped lambda terms"

Connected through hyperedge HE-7 (induced by source paper "normal order reduction grammars"):
  with members:
    - "boltzmann samplers for random generation of lambda terms"
    - "generalizing determinization from automata to coalgebras"

Connected through hyperedge HE-8 (induced by source paper "combinatorics of lambda terms a natural approach"):
  with members:
    - "counting and generating terms in the binary lambda calculus extended version"
    - "unifying buchi complementation constructions"

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.LO(Logic in Computer Science)