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: "parameterized approximability of maximizing the spread of influence in networks"
  Abstract: In this paper, we consider the problem of maximizing the spread of influence through a social network. Given a graph with a threshold value thr(v) attached to each vertex v, the spread of influence is modeled as follows: A vertex v becomes ''active'' (influenced) if at least thr(v) of its neighbors are active. In the corresponding optimization problem the objective is then to find a fixed number k of vertices to activate such that the number of activated vertices at the end of the propagation process is maximum. We show that this problem is strongly inapproximable in time f(k)@?n^O^(^1^), for some function f, even for very restrictive thresholds. In the case that the threshold of each vertex equals its degree, we prove that the problem is inapproximable in polynomial time and it becomes r(n)-approximable in time f(k)@?n^O^(^1^), for some function f, for any strictly increasing function r. Moreover, we show that the decision version parameterized by k is W[1]-hard but becomes fixed-parameter tractable on bounded degree graphs.

Connected through hyperedge HE-1 (induced by source paper "parameterized approximation schemes for independent set of rectangles and geometric knapsack"):
  with members:
    - "approximating geometric knapsack via l packings"
    - "on approximating maximum independent set of rectangles"
    - "fixed parameter approximations for k center problems in low highway dimension graphs"
    - "lower bounds for approximation schemes for closest string"
    - "a fixed parameter tractable approximation scheme for the optimal cut graph of a surface"
    - "the constant inapproximability of the parameterized dominating set problem"
    - "parameterized approximation schemes using graph widths"
    - "approximation schemes for maximum weight independent set of rectangles"

Connected through hyperedge HE-2 (induced by source paper "a survey on influence maximization in a social network"):
  with members:
    - "modeling information diffusion in social networks"
    - "information diffusion in social networks in two phases"
    - "stop and stare optimal sampling algorithms for viral marketing in billion scale networks"
    - "latency bounded target set selection in social networks"
    - "on budgeted influence maximization in social networks"
    - "slpa uncovering overlapping communities in social networks via a speaker listener interaction dynamic process"

Connected through hyperedge HE-3 (induced by source paper "a more fine grained complexity analysis of finding the most vital edges for undirected shortest paths"):
  with members:
    - "fractals for kernelization lower bounds"
    - "parameterized complexity of edge interdiction problems"
    - "interdiction problems on planar graphs"

Connected through hyperedge HE-4 (induced by source paper "whom to befriend to influence people"):
  with members:
    - "selecting nodes and buying links to maximize the information diffusion in a network"
    - "recommending links through influence maximization"
    - "discovering small target sets in social networks a fast and effective algorithm"
    - "spread of influence in weighted networks under time and budget constraints"
    - "contagious sets in dense graphs"
    - "latency bounded target set selection in social networks"
    - "how to influence people with partial incentives"
    - "analytical approach to parallel repetition"

Connected through hyperedge HE-5 (induced by source paper "parameterized and approximation complexity of partial vc dimension"):
  with members:
    - "inapproximability of vc dimension and littlestone s dimension"
    - "identification location domination and metric dimension on interval and permutation graphs i bounds"
    - "identification location domination and metric dimension on interval and permutation graphs ii algorithms and complexity"
    - "on the approximability of partial vc dimension"
    - "identifying codes in hereditary classes of graphs and vc dimension"
    - "hitting set for hypergraphs of low vc dimension"
    - "parameterizations of test cover with bounded test sizes"
    - "parameterized study of the test cover problem"

Connected through hyperedge HE-6 (induced by source paper "evangelism in social networks algorithms and complexity"):
  with members:
    - "target set selection in dense graph classes"
    - "on finding small sets that influence large networks"
    - "spread of influence in weighted networks under time and budget constraints"
    - "contagious sets in dense graphs"
    - "distance constrained labeling on graphs with bounded neighborhood diversity"
    - "latency bounded target set selection in social networks"
    - "using neighborhood diversity to solve hard problems"
    - "algorithmic meta theorems"

Connected through hyperedge HE-7 (induced by source paper "discovering small target sets in social networks a fast and effective algorithm"):
  with members:
    - "on finding small sets that influence large networks"
    - "spread of influence in weighted networks under time and budget constraints"
    - "latency bounded target set selection in social networks"
    - "a scalable heuristic for viral marketing under the tipping model"
    - "influence diffusion in social networks under time window constraints"
    - "contagious sets in expanders"
    - "target set selection problem for honeycomb networks"

Connected through hyperedge HE-8 (induced by source paper "on finding small sets that influence large networks"):
  with members:
    - "spread of influence in weighted networks under time and budget constraints"
    - "contagious sets in dense graphs"
    - "latency bounded target set selection in social networks"
    - "a scalable heuristic for viral marketing under the tipping model"
    - "influence diffusion in social networks under time window constraints"
    - "contagious sets in expanders"
    - "target set selection problem for honeycomb networks"

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)