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: "fixed parameter tractability of workflow satisfiability in the presence of seniority constraints"
  Abstract: The workflow satisfiability problem is concerned with determining whether it is possible to find an allocation of authorized users to the steps in a workflow in such a way that all constraints are satisfied. The problem is NP-hard in general, but is known to be fixed-parameter tractable for certain classes of constraints. The known results on fixed-parameter tractability rely on the symmetry (in some sense) of the constraints. In this paper, we provide the first results that establish fixed-parameter tractability of the satisfiability problem when the constraints are asymmetric. In particular, we introduce the notion of seniority constraints, in which the execution of steps is determined, in part, by the relative seniority of the users that perform them. Our results require new techniques, which make use of tree decompositions of the graph of the binary relation defining the constraint. Finally, we establish a lower bound for the hardness of the workflow satisfiability problem.

Connected through hyperedge HE-1 (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"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"

Connected through hyperedge HE-2 (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"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"

Connected through hyperedge HE-3 (induced by source paper "iterative plan construction for the workflow satisfiability problem"):
  with members:
    - "slightly superexponential parameterized problems"
    - "constraint expressions and workflow satisfiability"
    - "efficient computation of representative sets with applications in parameterized and exact algorithms"
    - "solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time"
    - "on the parameterized complexity and kernelization of the workflow satisfiability problem"
    - "arbac policy for a large multi national bank"

Connected through hyperedge HE-4 (induced by source paper "polynomial kernels and user reductions for the workflow satisfiability problem"):
  with members:
    - "iterative plan construction for the workflow satisfiability problem"
    - "on the parameterized complexity and kernelization of the workflow satisfiability 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)