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: "boltzmann samplers for random generation of lambda terms"
  Abstract: Randomly generating structured objects is important in testing and optimizing functional programs, whereas generating random $'l$-terms is more specifically needed for testing and optimizing compilers. For that a tool called QuickCheck has been proposed, but in this tool the control of the random generation is left to the programmer. Ten years ago, a method called Boltzmann samplers has been proposed to generate combinatorial structures. In this paper, we show how Boltzmann samplers can be developed to generate lambda-terms, but also other data structures like trees. These samplers rely on a critical value which parameters the main random selector and which is exhibited here with explanations on how it is computed. Haskell programs are proposed to show how samplers are actually implemented.

Connected through hyperedge HE-1 (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"
    - "counting and generating lambda terms"
    - "on counting untyped lambda terms"
    - "how big is bci fragment of bck logic"

Connected through hyperedge HE-2 (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"
    - "counting and generating lambda terms"

Connected through hyperedge HE-3 (induced by source paper "normal order reduction grammars"):
  with members:
    - "generalizing determinization from automata to coalgebras"
    - "counting and generating lambda terms"

Connected through hyperedge HE-4 (induced by source paper "a natural counting of lambda terms"):
  with members:
    - "counting terms in the binary lambda calculus"
    - "counting and generating lambda terms"

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.DS(Data Structures and Algorithms)