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: "valued workflow satisfiability problem"
  Abstract: A workflow is a collection of steps that must be executed in some specific order to achieve an objective. A computerised workflow management system may enforce authorisation policies and constraints, thereby restricting which users can perform particular steps in a workflow. The existence of policies and constraints may mean that a workflow is unsatisfiable, in the sense that it is impossible to find an authorised user for each step in the workflow and satisfy all constraints. In this paper, we consider the problem of finding the "least bad" assignment of users to workflow steps by assigning a weight to each policy and constraint violation. To this end, we introduce a framework for associating costs with the violation of workflow policies and constraints and define the \emph{valued workflow satisfiability problem} (Valued WSP), whose solution is an assignment of steps to users of minimum cost. We establish the computational complexity of Valued WSP with user-independent constraints and show that it is fixed-parameter tractable. We then describe an algorithm for solving Valued WSP with user-independent constraints and evaluate its performance, comparing it to that of an off-the-shelf mixed integer programming package.

Connected through hyperedge HE-1 (induced by source paper "bounded and approximate strong satisfiability in workflows"):
  with members:
    - "iterative plan construction for the workflow satisfiability problem"
    - "constraint expressions and workflow satisfiability"

Connected through hyperedge HE-2 (induced by source paper "results in workflow resiliency complexity new formulation and asp encoding"):
  with members:
    - "solving advanced argumentation problems with answer set programming"
    - "parameterized resiliency problems via integer linear programming"
    - "algorithms for the workflow satisfiability problem engineered for counting constraints"
    - "the bi objective workflow satisfiability problem and workflow resiliency"
    - "iterative plan construction for the workflow satisfiability problem"
    - "constraint expressions and workflow satisfiability"
    - "the parameterized complexity of reasoning problems beyond np"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"

Connected through hyperedge HE-3 (induced by source paper "pattern based approach to the workflow satisfiability problem with user independent constraints"):
  with members:
    - "algorithms for the workflow satisfiability problem engineered for counting constraints"
    - "the bi objective workflow satisfiability problem and workflow resiliency"
    - "tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis"
    - "polynomial kernels and user reductions for the workflow satisfiability problem"
    - "iterative plan construction for the workflow satisfiability problem"
    - "parameterized complexity results for exact bayesian network structure learning"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"
    - "empirical evaluation of construction heuristics for the multidimensional assignment problem"

Connected through hyperedge HE-4 (induced by source paper "algorithms for the workflow satisfiability problem engineered for counting constraints"):
  with members:
    - "iterative plan construction for the workflow satisfiability problem"
    - "constraint expressions and workflow satisfiability"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"

Connected through hyperedge HE-5 (induced by source paper "the bi objective workflow satisfiability problem and workflow resiliency"):
  with members:
    - "tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis"
    - "pattern backtracking algorithm for the workflow satisfiability problem"
    - "iterative plan construction for the workflow satisfiability problem"
    - "constraint expressions and workflow satisfiability"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"
    - "fixed parameter tractability of workflow satisfiability in the presence of seniority constraints"

Connected through hyperedge HE-6 (induced by source paper "tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis"):
  with members:
    - "algorithms for the workflow satisfiability problem engineered for counting constraints"
    - "on problems as hard as cnf sat"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "iterative plan construction for the workflow satisfiability problem"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

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)