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: "the parameterized complexity of domination type problems and application to linear codes"
  Abstract: We study the parameterized complexity of domination-type problems. (σ,ρ)-domination is a general and unifying framework introduced by Telle: given σ, ρ ⊆ ℕ, a set D of vertices of a graph G is (σ,ρ)-dominating if for any v ∈ D, |N(v) ∩ D| ∈ σ and for any v ∉ D, |N(v) ∩ D| ∈ ρ. Our main result is that for any σ and ρ recursive sets, deciding whether there exists a (σ,ρ)-dominating set of size k, or of size at most k, are both in W[2]. This general statement is optimal in the sense that several particular instances of (σ,ρ)-domination are W[2]-complete (e.g. Dominating Set). We prove the W[2]-membership for the dual parameterization too, i.e. deciding whether there exists a (σ,ρ)-dominating set of size n − k (or at least n − k) is in W[2], where n is the order of the input graph. We extend this result to a class of domination-type problems which do not fall into the (σ,ρ)-domination framework, including Connected Dominating Set. We also consider problems of coding theory which are related to domination-type problems with parity constraints. In particular, we prove that the problem of the minimal distance of a linear code over \({\mathbb{F}}_{q}\) is in W[2] when q is a power of prime, for both standard and dual parameterizations, and W[1]-hard for the dual parameterization.

Connected through hyperedge HE-1 (induced by source paper "new algorithms for weighted k domination and total k domination problems in proper interval graphs"):
  with members:
    - "complexity results for k domination and α domination problems and their variants"
    - "a width parameter useful for chordal and co comparability graphs"
    - "latency bounded target set selection in social networks"
    - "total vector domination for graphs with bounded branchwidth"
    - "on the approximability and exact algorithms for vector domination and related problems in graphs"

Connected through hyperedge HE-2 (induced by source paper "not all equal and 1 in degree decompositions algorithmic complexity and applications"):
  with members:
    - "polynomial time algorithms for weighted efficient domination problems in at free graphs and dually chordal graphs"
    - "algorithmic complexity of proper labeling problems"
    - "efficient dominating and edge dominating sets for graphs and hypergraphs"
    - "minimum weight triangulation is np hard"

Connected through hyperedge HE-3 (induced by source paper "seth based lower bounds for subset sum and bicriteria path"):
  with members:
    - "on the fine grained complexity of empirical risk minimization kernel methods and neural networks"
    - "a short note on merlin arthur protocols for subset sum"
    - "parameterizing pwm and profile matching and knapsack by the feasible weight solutions count"
    - "subquadratic algorithms for algebraic generalizations of 3sum"
    - "a near linear pseudopolynomial time algorithm for subset sum"
    - "a dichotomy for regular expression membership testing"
    - "improved bounds for 3sum k sum and linear degeneracy"
    - "clustered integer 3sum via additive combinatorics"

Connected through hyperedge HE-4 (induced by source paper "minimum degree up to local complementation bounds parameterized complexity and exact algorithms"):
  with members:
    - "on weak odd domination and graph based quantum secret sharing"
    - "parameterized complexity of weak odd domination problems"
    - "on the minimum degree up to local complementation bounds and complexity"

Connected through hyperedge HE-5 (induced by source paper "losing weight by gaining edges"):
  with members:
    - "threesomes degenerates and love triangles"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "3sum 3xor triangles"
    - "exact weight subgraphs and the k sum conjecture"
    - "reducing a target interval to a few exact queries"

Connected through hyperedge HE-6 (induced by source paper "linear kernels for k tuple and liar s domination in bounded genus graphs"):
  with members:
    - "bidimensionality and kernels"
    - "a linear kernel for planar red blue dominating set"
    - "polynomial time data reduction for dominating set"

Connected through hyperedge HE-7 (induced by source paper "on the parameterized complexity of k sum"):
  with members:
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "exact weight subgraphs and the k sum conjecture"

Connected through hyperedge HE-8 (induced by source paper "parameterized complexity of weak odd domination problems"):
  with members:
    - "on weak odd domination and graph based quantum secret sharing"
    - "on the minimum degree up to local complementation bounds and complexity"

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)