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 dense hierarchy of sublinear time approximation schemes for bin packing"):
  Abstract: The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes $a_1,..., a_n$ in $(0,1]$. Using uniform sampling, which selects a random element from the input list each time, we develop a randomized $O({n(\log n)(\log\log n)\over \sum_{i=1}^n a_i}+({1\over \epsilon})^{O({1\over\epsilon})})$ time $(1+\epsilon)$-approximation scheme for the bin packing problem. We show that every randomized algorithm with uniform random sampling needs $\Omega({n\over \sum_{i=1}^n a_i})$ time to give an $(1+\epsilon)$-approximation. For each function $s(n): N\rightarrow N$, define $\sum(s(n))$ to be the set of all bin packing problems with the sum of item sizes equal to $s(n)$. For a constant $b\in (0,1)$, every problem in $\sum(n^{b})$ has an $O(n^{1-b}(\log n)(\log\log n)+({1\over \epsilon})^{O({1\over\epsilon})})$ time $(1+\epsilon)$-approximation for an arbitrary constant $\epsilon$. On the other hand, there is no $o(n^{1-b})$ time $(1+\epsilon)$-approximation scheme for the bin packing problems in $\sum(n^{b})$ for some constant $\epsilon>0$.

Includes members:
  Member "on the sum of squares algorithm for bin packing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "orl reinforcement learning benchmarks for online stochastic optimization problems")
  Member "on the closest string and substring problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on clustering incomplete data")

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.CC(Computational Complexity)