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: "on the parameterized complexity and kernelization of the workflow satisfiability problem"
  Abstract: A workflow specification defines a set of steps and the order in which those steps must be executed. Security requirements may impose constraints on which groups of users are permitted to perform subsets of those steps. A workflow specification is said to be satisfiable if there exists an assignment of users to workflow steps that satisfies all the constraints. An algorithm for determining whether such an assignment exists is important, both as a static analysis tool for workflow specifications, and for the construction of run-time reference monitors for workflow management systems. Finding such an assignment is a hard problem in general, but work by Wang and Li in 2010 using the theory of parameterized complexity suggests that efficient algorithms exist under reasonable assumptions about workflow specifications. In this paper, we improve the complexity bounds for the workflow satisfiability problem. We also generalize and extend the types of constraints that may be defined in a workflow specification and prove that the satisfiability problem remains fixed-parameter tractable for such constraints. Finally, we consider preprocessing for the problem and prove that in an important special case, in polynomial time, we can reduce the given input into an equivalent one, where the number of users is at most the number of steps. We also show that no such reduction exists for two natural extensions of this case, which bounds the number of users by a polynomial in the number of steps, provided a widely-accepted complexity-theoretical assumption holds.

Connected through hyperedge HE-1 (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"
    - "iterative plan construction for the workflow satisfiability problem"
    - "constraint expressions and workflow satisfiability"
    - "the parameterized complexity of reasoning problems beyond np"

Connected through hyperedge HE-2 (induced by source paper "hcap a history based capability system for iot devices"):
  with members:
    - "distributed authorization in vanadium"

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"
    - "iterative plan construction for the workflow satisfiability problem"
    - "parameterized complexity results for exact bayesian network structure learning"
    - "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"
    - "iterative plan construction for the workflow satisfiability problem"
    - "constraint expressions and workflow satisfiability"

Connected through hyperedge HE-5 (induced by source paper "the authorization policy existence problem"):
  with members:
    - "iterative plan construction for 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"
    - "iterative plan construction for the workflow satisfiability problem"
    - "constraint expressions and workflow satisfiability"
    - "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"
    - "iterative plan construction for 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"
    - "iterative plan construction for the workflow satisfiability problem"
    - "constraint expressions and workflow satisfiability"
    - "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.CR(Cryptography and Security)