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: "iterative plan construction for the workflow satisfiability problem"
  Abstract: The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We are required to decide whether there exists a plan - an assignment of tasks to authorized users - such that all constraints are satisfied. It is natural to see the WSP as a subclass of the Constraint Satisfaction Problem (CSP) in which the variables are tasks and the domain is the set of users. What makes the WSP distinctive is that the number of tasks is usually very small compared to the number of users, so it is appropriate to ask for which constraint languages the WSP is fixed-parameter tractable (FPT), parameterized by the number of tasks.#R##N##R##N#This novel approach to the WSP, using techniques from CSP, has enabled us to design a generic algorithm which is FPT for several families of workflow constraints considered in the literature. Furthermore, we prove that the union of FPT languages remains FPT if they satisfy a simple compatibility condition. Lastly, we identify a new FPT constraint language, user-independent constraints, that includes many of the constraints of interest in business processing systems. We demonstrate that our generic algorithm has provably optimal running time O*(2k log k), for this language, where k is the number of tasks.

Connected through hyperedge HE-1 (induced by source paper "bounded and approximate strong satisfiability in workflows"):
  with members:
    - "valued 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"
    - "valued 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"
    - "valued workflow satisfiability problem"
    - "polynomial kernels and user reductions 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:
    - "valued 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 authorization policy existence problem"):
  with members:
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"

Connected through hyperedge HE-6 (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"
    - "valued workflow satisfiability problem"
    - "pattern backtracking algorithm 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-7 (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"
    - "valued workflow satisfiability problem"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-8 (induced by source paper "valued workflow satisfiability problem"):
  with members:
    - "pattern backtracking algorithm 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"

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)