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: "a polynomial time algorithm for estimating the partition function of the ferromagnetic ising model on a regular matroid"
  Abstract: We investigate the computational difficulty of approximating the partition function of the ferromagnetic Ising model on a regular matroid. Jerrum and Sinclair have shown that there is a fully polynomial randomized approximation scheme (FPRAS) for the class of graphic matroids. On the other hand, the authors have previously shown, subject to a complexity-theoretic assumption, that there is no FPRAS for the class of binary matroids, which is a proper superset of the class of graphic matroids. In order to map out the region where approximation is feasible, we focus on the class of regular matroids, an important class of matroids which properly includes the class of graphic matroids and is properly included in the class of binary matroids. Using Seymour's decomposition theorem, we give an FPRAS for the class of regular matroids.

Connected through hyperedge HE-1 (induced by source paper "on the number of circuits in regular matroids with connections to lattices and codes"):
  with members:
    - "on the weight distribution of random binary linear codes"
    - "isolating a vertex via lattices polytopes with totally unimodular faces"
    - "extended formulations for independence polytopes of regular matroids"
    - "matroid secretary for regular and decomposable matroids"
    - "a decomposition theory for binary linear codes"

Connected through hyperedge HE-2 (induced by source paper "covering vectors by spaces regular matroids"):
  with members:
    - "spanning circuits in regular matroids"
    - "matroid secretary for regular and decomposable matroids"

Connected through hyperedge HE-3 (induced by source paper "canonical paths for mcmc from art to science"):
  with members:
    - "a simple fptas for counting edge covers"
    - "approximating holant problems by winding"

Connected through hyperedge HE-4 (induced by source paper "fptas for weighted fibonacci gates and its applications"):
  with members:
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "a simple fptas for counting edge covers"
    - "approximating holant problems by winding"
    - "approximate counting via correlation decay on planar graphs"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"
    - "correlation decay up to uniqueness in spin systems"
    - "approximate counting via correlation decay in spin systems"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-5 (induced by source paper "fptas for counting monotone cnf"):
  with members:
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "fptas for weighted fibonacci gates and its applications"
    - "a simple fptas for counting edge covers"
    - "approximate counting via correlation decay on planar graphs"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"
    - "correlation decay up to uniqueness in spin systems"
    - "approximate counting via correlation decay in spin systems"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-6 (induced by source paper "approximate counting via correlation decay in spin systems"):
  with members:
    - "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"
    - "polynomial time approximation schemes for knapsack and related counting problems using branching programs"
    - "non negative weighted csps an effective complexity dichotomy"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-7 (induced by source paper "correlation decay up to uniqueness in spin systems"):
  with members:
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"
    - "approximate counting via correlation decay in spin systems"
    - "improved inapproximability results for counting independent sets in the hard core model"
    - "computational transition at the uniqueness threshold"

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