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: "parameters of two prover one round game and the hardness of connectivity problems"
  Abstract: Optimizing parameters of Two-Prover-One-Round Game (2P1R) is an important task in PCPs literature as it would imply a smaller PCP with the same or stronger soundness. While this is a basic question in PCPs community, the connection between the parameters of PCPs and hardness of approximations is sometime obscure to approximation algorithm community. In this paper, we investigate the connection between the parameters of 2P1R and the hardness of approximating the class of so-called connectivity problems, which includes as subclasses the survivable network design and (multi)cut problems. Based on recent development on 2P1R by Chan (ECCC 2011) and several techniques in PCPs literature, we improve hardness results of some connectivity problems that are in the form $k^\sigma$, for some (very) small constant $\sigma>0$, to hardness results of the form $k^c$ for some explicit constant $c$, where $k$ is a connectivity parameter. In addition, we show how to convert these hardness into hardness results of the form $D^{c'}$, where $D$ is the number of demand pairs (or the number of terminals). #R##N#Thus, we give improved hardness results of k^{1/2-\epsilon} and k^{1/10-\epsilon} for the root $k$-connectivity problem on directed and undirected graphs, k^{1/6-\epsilon} for the vertex-connectivity survivable network design problem on undirected graphs, and k^{1/6-\epsilon} for the vertex-connectivity $k$-route cut problem on undirected graphs.

Connected through hyperedge HE-1 (induced by source paper "network design for s t effective resistance"):
  with members:
    - "proportional volume sampling and approximation algorithms for a optimal design"
    - "an almost linear time algorithm for uniform random spanning tree generation"
    - "fast generation of random spanning trees and the effective resistance metric"
    - "effective resistance reducing flows spectrally thin trees and asymmetric tsp"
    - "iterative rounding approximation algorithms for degree bounded node connectivity network design"
    - "approximating minimum cost k node connected subgraphs via independence free graphs"
    - "reductions between expansion problems"
    - "electrical flows laplacian systems and faster approximation of maximum flow in undirected graphs"

Connected through hyperedge HE-2 (induced by source paper "polylogarithmic approximation algorithm for k connected directed steiner tree on quasi bipartite graphs"):
  with members:
    - "a quasi polynomial algorithm for submodular tree orienteering in directed graphs"
    - "a logarithmic integrality gap bound for directed steiner tree in quasi bipartite graphs"
    - "approximating directed steiner problems via tree embedding"
    - "analytical approach to parallel repetition"
    - "an improved approximation algorithm for the minimum cost subset k connected subgraph problem"
    - "approximating subset k connectivity problems"
    - "directed steiner tree and the lasserre hierarchy"
    - "an o k 3 log n approximation algorithm for vertex connectivity survivable network design"

Connected through hyperedge HE-3 (induced by source paper "survivable network design for group connectivity in low treewidth graphs"):
  with members:
    - "a polynomial time approximation scheme for euclidean steiner forest"
    - "sparsest cut on bounded treewidth graphs algorithms and hardness results"
    - "an improved approximation algorithm for the minimum cost subset k connected subgraph problem"
    - "solving connectivity problems parameterized by treewidth in single exponential time"
    - "polynomial time approximation schemes for subset connectivity problems in bounded genus graphs"
    - "approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth"
    - "an o k 3 log n approximation algorithm for vertex connectivity survivable network design"

Connected through hyperedge HE-4 (induced by source paper "a note on degree vs gap of min rep label cover and improved inapproximability for connectivity problems"):
  with members:
    - "eth hardness of approximating 2 csps and directed steiner network"
    - "approximation of non boolean 2csp"
    - "approximation algorithms and hardness of the k route cut problem"
    - "an o k 3 log n approximation algorithm for vertex connectivity survivable network design"

Connected through hyperedge HE-5 (induced by source paper "improved approximation algorithms for k connected m dominating set problems"):
  with members:
    - "approximation algorithm for minimum weight fault tolerant virtual backbone in unit disk graphs"
    - "constant approximation algorithms for highly connected multi dominating sets in unit disk graphs"
    - "spider covers for prize collecting network activation problem"
    - "an improved approximation algorithm for the minimum cost subset k connected subgraph problem"
    - "approximating subset k connectivity problems"

Connected through hyperedge HE-6 (induced by source paper "surviving in directed graphs a polylogarithmic approximation for two connected directed steiner tree"):
  with members:
    - "iterative rounding approximation algorithms for degree bounded node connectivity network design"
    - "approximating minimum cost k node connected subgraphs via independence free graphs"
    - "an improved approximation algorithm for the minimum cost subset k connected subgraph problem"
    - "approximating subset k connectivity problems"
    - "directed steiner tree and the lasserre hierarchy"

Connected through hyperedge HE-7 (induced by source paper "approximating directed steiner problems via tree embedding"):
  with members:
    - "directed steiner tree and the lasserre hierarchy"

Connected through hyperedge HE-8 (induced by source paper "improved region growing and combinatorial algorithms for k route cut problems"):
  with members:
    - "label cover instances with large girth and the hardness of approximating basic k spanner"
    - "approximation algorithms and hardness of the k route cut problem"
    - "hitting diamonds and growing cacti"
    - "region growing for multi route cuts"

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)