human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "parameterized shifted combinatorial optimization"):
  Abstract: Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. This framework captures well studied and diverse problems ranging from so-called vulnerability problems to sharing and partitioning problems. In particular, every standard combinatorial optimization problem has its shifted counterpart, which is typically much harder. Already with explicitly given input set the shifted problem may be NP-hard. In this article we initiate a study of the parameterized complexity of this framework. First we show that shifting over an explicitly given set with its cardinality as the parameter may be in XP, FPT or P, depending on the objective function. Second, we study the shifted problem over sets definable in MSO logic (which includes, e.g., the well known MSO partitioning problems). Our main results here are that shifted combinatorial optimization over MSO definable sets is in XP with respect to the MSO formula and the treewidth (or more generally clique-width) of the input graph, and is W[1]-hard even under further severe restrictions.

Includes members:
  Member "a parameterized strongly polynomial algorithm for block structured integer programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "n fold integer programming via lp rounding")
  Member "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on adaptive algorithms for maximum matching")
  Member "the parameterized complexity of the minimum shared edges problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the minimum shared edges problem on grid like graphs")
  Member "extension complexity mso logic and treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity")
  Member "finding a collective set of items from proportional multirepresentation to group recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")
  Member "parameterized algorithms for modular width":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "iterated type partitions")
  Member "the matching polytope has exponential extension complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "extended formulation lower bounds for refuting random csps")
  Member "algorithmic meta theorems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "nowhere dense graph classes and algorithmic applications a tutorial at highlights of logic games and automata 2019")

Question: Please tell me which class the source paper 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)