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: "the bi objective workflow satisfiability problem and workflow resiliency"
  Abstract: A computerized workflow management system may enforce a security policy, specified in terms of authorized actions and constraints, thereby restricting which users can perform particular steps in a workflow. The existence of a security policy may mean it is impossible to find a valid plan (an assignment of steps to authorized users such that all constraints are satisfied). Work in the literature focuses on the workflow satisfiability problem, a \emph{decision} problem that outputs a valid plan if the instance is satisfiable (and a negative result otherwise). #R##N#In this paper, we introduce the \textsc{Bi-Objective Workflow Satisfiability Problem} (\BOWSP), which enables us to solve \emph{optimization} problems related to workflows and security policies. In particular, we are able to compute a "least bad" plan when some components of the security policy may be violated. In general, \BOWSP is intractable from both the classical and parameterized complexity point of view. We prove there exists an fixed-parameter tractable (FPT) algorithm to compute a Pareto front for \BOWSP if we restrict our attention to user-independent constraints. #R##N#We also present a second algorithm to compute a Pareto front which uses mixed integer programming (MIP). We compare the performance of both our algorithms on synthetic instances, and show that the FPT algorithm outperforms the MIP-based one by several orders of magnitude on most of the instances. #R##N#Finally, we study the important question of workflow resiliency and prove new results establishing that known decision problems are fixed-parameter tractable when restricted to user-independent constraints. We then propose a new way of modeling the availability of users and demonstrate that many questions related to resiliency in the context of this new model may be reduced to instances of \BOWSP.

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"
    - "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"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"

Connected through hyperedge HE-2 (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"
    - "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"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"
    - "empirical evaluation of construction heuristics for the multidimensional assignment problem"

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)