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: "polynomial time approximation schemes for knapsack and related counting problems using branching programs"
  Abstract: We give a deterministic, polynomial-time algorithm for approximately counting the number of {0,1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter eps, our algorithm produces a (1 + eps)-multiplicative approximation in time poly(n,log W,1/eps). We also give algorithms with identical guarantees for general integer knapsack, the multidimensional knapsack problem (with a constant number of constraints) and for contingency tables (with a constant number of rows). Previously, only randomized approximation schemes were known for these problems due to work by Morris and Sinclair and work by Dyer. #R##N#Our algorithms work by constructing small-width, read-once branching programs for approximating the underlying solution space under a carefully chosen distribution. As a byproduct of this approach, we obtain new query algorithms for learning functions of k halfspaces with respect to the uniform distribution on {0,1}^n. The running time of our algorithm is polynomial in the accuracy parameter eps. Previously even for the case of k=2, only algorithms with an exponential dependence on eps were known.

Connected through hyperedge HE-1 (induced by source paper "the distribution function of the longest path length in constant treewidth dags with random edge length"):
  with members:
    - "a fully polynomial time approximation scheme for approximating a sum of random variables"

Connected through hyperedge HE-2 (induced by source paper "an fptas for the volume of a cal v polytope it is hard to compute the volume of the intersection of two cross polytopes"):
  with members:
    - "a fully polynomial time approximation scheme for approximating a sum of random variables"
    - "a simple fptas for counting edge covers"
    - "near optimal deterministic algorithms for volume computation via m ellipsoids"
    - "correlation decay up to uniqueness in spin systems"
    - "approximate counting via correlation decay in spin systems"
    - "a deterministic polynomial time approximation scheme for counting knapsack solutions"

Connected through hyperedge HE-3 (induced by source paper "fully polynomial time approximation schemes fptas for some counting problems"):
  with members:
    - "a deterministic polynomial time approximation scheme for counting knapsack solutions"

Connected through hyperedge HE-4 (induced by source paper "total variation discrepancy of deterministic random walks for ergodic markov chains"):
  with members:
    - "lock in problem for parallel rotor router walks"
    - "improved analysis of deterministic load balancing schemes"
    - "deterministic random walks for rapidly mixing chains"
    - "quasirandom load balancing"
    - "a deterministic polynomial time approximation scheme for counting knapsack solutions"

Connected through hyperedge HE-5 (induced by source paper "combinatorial decomposition approaches for efficient counting and random generation fptases"):
  with members:
    - "counting approximately shortest paths in directed acyclic graphs"
    - "a deterministic polynomial time approximation scheme for counting knapsack solutions"
    - "generating connected acyclic digraphs uniformly at random"

Connected through hyperedge HE-6 (induced by source paper "an invariance principle for polytopes"):
  with members:
    - "fooling functions of halfspaces under product distributions"
    - "agnostic learning of monomials by halfspaces is hard"
    - "pseudorandom generators for polynomial threshold functions"
    - "bounded independence fools degree 2 threshold functions"
    - "conditional hardness for approximate coloring"

Connected through hyperedge HE-7 (induced by source paper "approximate counting via correlation decay in spin systems"):
  with members:
    - "a polynomial time algorithm for estimating the partition function of the ferromagnetic ising model on a regular matroid"
    - "inapproximability of the tutte polynomial of a planar graph"
    - "approximating the partition function of the ferromagnetic potts model"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"
    - "improved inapproximability results for counting independent sets in the hard core model"
    - "a deterministic polynomial time approximation scheme for counting knapsack solutions"
    - "non negative weighted csps an effective complexity dichotomy"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-8 (induced by source paper "pseudorandom generators for polynomial threshold functions"):
  with members:
    - "an invariance principle for polytopes"
    - "fooling functions of halfspaces under product distributions"
    - "bounded independence fools halfspaces"
    - "polynomial threshold functions structure approximation and pseudorandomness"
    - "bounding the sensitivity of polynomial threshold functions"
    - "a regularity lemma and low weight approximators for low degree polynomial threshold functions"

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)