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 "fptas for bis with degree bounds on one side"):
  Abstract: Counting the number of independent sets for a bipartite graph (#BIS) plays a crucial role in the study of approximate counting. It has been conjectured that there is no fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for #BIS, and it was proved that the problem for instances with a maximum degree of 6 is already as hard as the general problem. In this paper, we obtain a surprising tractability result for a family of #BIS instances. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for #BIS when the maximum degree for one side is no larger than 5. There is no restriction for the degrees on the other side, which do not even have to be bounded by a constant. Previously, FPTAS was only known for instances with a maximum degree of 5 for both sides.

Includes members:
  Member "a simple fptas for counting edge covers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "the complexity of ferromagnetic two spin systems with external fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "boolean approximate counting csps with weak conservativity and implications for ferromagnetic two spin")
  Member "spatial mixing and the connective constant optimal bounds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "the expressibility of functions on the boolean domain with applications to counting csps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "fptas for counting monotone cnf":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing the independence polynomial in shearer s region for the lll")
  Member "spatial mixing and approximation algorithms for graphs with bounded connective constant":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "the complexity of approximately counting stable roommate assignments":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stable marriage with groups of similar agents")
  Member "approximating the partition function of the ferromagnetic potts model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")

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)