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 the minimum shared edges problem"
  Abstract: We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and sharing at most k edges. Herein, an edge is shared if it appears in at least two paths. We show that MSE is W[1]-hard when parameterized by the treewidth of the input graph and the number k of shared edges combined. We show that MSE is fixed-parameter tractable with respect to p, but does not admit a polynomial-size kernel (unless NP is contained in coNP/poly). In the proof of the fixed-parameter tractability of MSE parameterized by p, we employ the treewidth reduction technique due to Marx, O'Sullivan, and Razgon [ACM TALG 2013].

Connected through hyperedge HE-1 (induced by source paper "parameterized shifted combinatorial optimization"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity"
    - "extension complexity mso logic and treewidth"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "parameterized algorithms for modular width"
    - "the matching polytope has exponential extension complexity"
    - "algorithmic meta theorems"

Connected through hyperedge HE-2 (induced by source paper "the minimum shared edges problem on grid like graphs"):
  with members:
    - "the complexity of routing with few collisions"
    - "the minimum shared edges problem on planar graphs"
    - "kernelization lower bounds by cross composition"

Connected through hyperedge HE-3 (induced by source paper "the complexity of routing with few collisions"):
  with members:
    - "an introduction to temporal graphs an algorithmic perspective"
    - "temporal network optimization subject to connectivity constraints"

Connected through hyperedge HE-4 (induced by source paper "fractals for kernelization lower bounds"):
  with members:
    - "two page book embeddings of 4 planar graphs"
    - "interdiction problems on planar graphs"
    - "kernelization lower bounds by cross composition"
    - "clique cover and graph separation new incompressibility 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.CC(Computational Complexity)