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: "efficient random sampling of binary and unary binary trees via holonomic equations"
  Abstract: We present a new uniform random sampler for binary trees with $n$ internal nodes consuming $2n + \Theta(\log(n)^2)$ random bits on average. This makes it quasi-optimal and out-performs the classical Remy algorithm. We also present a sampler for unary-binary trees with $n$ nodes taking $\Theta(n)$ random bits on average. Both are the first linear-time algorithms to be optimal up to a constant.

Connected through hyperedge HE-1 (induced by source paper "parallel galton watson process"):
  with members:
    - "analytic samplers and the combinatorial rejection method"

Connected through hyperedge HE-2 (induced by source paper "counting and generating terms in the binary lambda calculus extended version"):
  with members:
    - "counting terms in the binary lambda calculus"
    - "generalizing determinization from automata to coalgebras"
    - "counting and generating lambda terms"
    - "on counting untyped lambda terms"

Connected through hyperedge HE-3 (induced by source paper "mergeshuffle a very fast parallel random permutation algorithm"):
  with members:
    - "sampling with arbitrary precision"
    - "optimal discrete uniform generation from coin flips and applications"

Connected through hyperedge HE-4 (induced by source paper "boltzmann samplers for random generation of lambda terms"):
  with members:
    - "counting terms in the binary lambda calculus"
    - "an exercise on streams convergence acceleration"
    - "counting and generating lambda terms"
    - "on counting untyped 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)