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: "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.

Connected through hyperedge HE-1 (induced by source paper "counting independent sets and colorings on random regular bipartite graphs"):
  with members:
    - "algorithms for bis hard problems on expander graphs"
    - "improved bounds for randomly sampling colorings via linear programming"
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "an fptas for counting proper four colorings on cubic graphs"
    - "the expressibility of functions on the boolean domain with applications to counting csps"
    - "ferromagnetic potts model refined bis hardness and related results"
    - "approximating the partition function of the ferromagnetic potts model"

Connected through hyperedge HE-2 (induced by source paper "markov chains for the hard core model via polymer models"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "algorithms for bis hard problems on expander graphs"
    - "algorithmic pirogov sinai theory"
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-3 (induced by source paper "counting independent sets in unbalanced bipartite graphs"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "algorithms for bis hard problems on expander graphs"
    - "algorithmic pirogov sinai theory"
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "approximating the partition function of the ferromagnetic potts model"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-4 (induced by source paper "fast algorithms at low temperatures via markov chains"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "algorithms for bis hard problems on expander graphs"
    - "algorithmic pirogov sinai theory"
    - "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model"

Connected through hyperedge HE-5 (induced by source paper "improved strong spatial mixing for colorings on trees"):
  with members:
    - "uniqueness for the 3 state antiferromagnetic potts model on the tree"
    - "spatial mixing and non local markov chains"
    - "correlation decay up to uniqueness in spin systems"

Connected through hyperedge HE-6 (induced by source paper "algorithms for bis hard problems on expander graphs"):
  with members:
    - "markov chains for the hard core model via polymer models"
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "sampling in uniqueness from the potts and random cluster models on random regular graphs"
    - "algorithmic pirogov sinai theory"
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "random cluster dynamics for the ising model is rapidly mixing"

Connected through hyperedge HE-7 (induced by source paper "algorithmic pirogov sinai theory"):
  with members:
    - "algorithms for bis hard problems on expander graphs"
    - "the ising partition function zeros and deterministic approximation"
    - "inapproximability of the independent set polynomial in the complex plane"
    - "computing the number of induced copies of a fixed graph in a bounded degree graph"
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "random cluster dynamics for the ising model is rapidly mixing"
    - "computing the independence polynomial from the tree threshold down to the roots"

Connected through hyperedge HE-8 (induced by source paper "a fixed parameter perspective on bis"):
  with members:
    - "homomorphisms are a good basis for counting small subgraphs"
    - "computing the number of induced copies of a fixed graph in a bounded degree graph"
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "complexity of counting subgraphs only the boundedness of the vertex cover number counts"
    - "ferromagnetic potts model refined bis hardness and related results"

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)