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 orientable deletion"):
  Abstract: A graph is $d$-orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most $d$. $d$-orientability is a well-studied concept with close connections to fundamental graph-theoretic notions and applications as a load balancing problem. In this paper we consider the d-ORIENTABLE DELETION problem: given a graph $G=(V,E)$, delete the minimum number of vertices to make $G$ $d$-orientable. We contribute a number of results that improve the state of the art on this problem. Specifically: #R##N#- We show that the problem is W[2]-hard and $\log n$-inapproximable with respect to $k$, the number of deleted vertices. This closes the gap in the problem's approximability. #R##N#- We completely characterize the parameterized complexity of the problem on chordal graphs: it is FPT parameterized by $d+k$, but W-hard for each of the parameters $d,k$ separately. #R##N#- We show that, under the SETH, for all $d,\epsilon$, the problem does not admit a $(d+2-\epsilon)^{tw}$, algorithm where $tw$ is the graph's treewidth, resolving as a special case an open problem on the complexity of PSEUDOFOREST DELETION. #R##N#- We show that the problem is W-hard parameterized by the input graph's clique-width. Complementing this, we provide an algorithm running in time $d^{O(d\cdot cw)}$, showing that the problem is FPT by $d+cw$, and improving the previously best known algorithm for this case.

Includes members:
  Member "not so easy problems for tree decomposable graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weighted proper orientations of trees and graphs of bounded treewidth")
  Member "on the configuration lp for scheduling on unrelated machines":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an improved approximation guarantee for the maximum budgeted allocation problem")
  Member "known algorithms on graphs of bounded treewidth are probably optimal":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of finding large odd induced subgraphs and odd colorings")
  Member "on allocating goods to maximize fairness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weighted completion time minimization for unrelated machines via iterative fair contention resolution")

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)