human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "pattern based approach to the workflow satisfiability problem with user independent constraints"):
  Abstract: The fixed parameter tractable (FPT) approach is a powerful tool in tackling computationally hard problems. In this paper we link FPT results to classic artificial intelligence techniques to show how they complement each other. Specifically, we consider the workflow satisfiability problem (WSP) which asks whether there exists an assignment of authorised users to the steps in a workflow specification, subject to certain constraints on the assignment. It was shown that WSP restricted to the class of user-independent constraints (UI), covering many practical cases, admits FPT algorithms. #R##N#We show that the FPT nature of WSP with UI constraints decomposes the problem into two levels, and exploit this in a new FPT algorithm that is by many orders of magnitude faster then the previous state-of-the-art WSP algorithm. #R##N#The WSP with UI constraints can also be viewed as an extension of the hypergraph list colouring problem. Inspired by a classic graph colouring method called Zykov's Contraction, we designed a new pseudo-boolean (PB) formulation of WSP with UI constraints that also exploits the two-level split of the problem. Our experiments showed that, in many cases, this formulation being solved with a general purpose PB solver demonstrated performance comparable to that of our bespoke FPT algorithm. This raises the potential of using general purpose solvers to tackle FPT problems efficiently. #R##N#We also study the practical, average-case, performance of various algorithms. To support this we extend studies of phase transition phenomena in the understanding of the average computational effort needed to solve decision problems. We investigate, for the first time, the phase transition properties of the WSP, under a model for generation of random instances, and note that the methods of the phase transition study need to be adjusted to FPT problems.

Includes members:
  Member "algorithms for the workflow satisfiability problem engineered for counting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "results in workflow resiliency complexity new formulation and asp encoding")
  Member "the bi objective workflow satisfiability problem and workflow resiliency":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "results in workflow resiliency complexity new formulation and asp encoding")
  Member "tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the bi objective workflow satisfiability problem and workflow resiliency")
  Member "valued workflow satisfiability problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounded and approximate strong satisfiability in workflows")
  Member "polynomial kernels and user reductions for the workflow satisfiability problem":
    also connected through other hyperedges:
      (none)
  Member "iterative plan construction for the workflow satisfiability problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bounded and approximate strong satisfiability in workflows")
  Member "parameterized complexity results for exact bayesian network structure learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "te eth lower bounds for qbfs of bounded treewidth")
  Member "on the parameterized complexity and kernelization of the workflow satisfiability problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "results in workflow resiliency complexity new formulation and asp encoding")

Question: Please tell me which class the source paper 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.AI(Artificial Intelligence)