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 "a fully polynomial time approximation scheme for approximating a sum of random variables"):
  Abstract: Abstract   Given    n    independent integer-valued random variables      X    1    ,    X    2    ,  …  ,    X    n      and an integer    C   , we study the fundamental problem of computing the probability that the sum     X   =    X    1    +    X    2    +  ⋯  +    X    n      is at most    C   . We assume that each random variable      X    i      is implicitly given by an oracle      O    i     , which given two input integers      n    1    ,    n    2      returns the probability of      n    1    ≤    X    i    ≤    n    2     . We give the first deterministic fully polynomial-time approximation scheme (FPTAS) to estimate the probability up to a relative error of    1  ±  ϵ   . Our algorithm is based on the technique for approximately counting knapsack solutions, developed in Gopalan et al. (2011).

Includes members:
  Member "stochastic combinatorial optimization via poisson approximation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the markovian price of information")
  Member "maximizing expected utility for stochastic combinatorial optimization problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stochastic load balancing on unrelated machines")
  Member "a deterministic polynomial time approximation scheme for counting knapsack solutions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate knapsack computations to count semi fair allocations")

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