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 "results in workflow resiliency complexity new formulation and asp encoding"):
  Abstract: First proposed by Wang and Li in 2007, workflow resiliency is a policy analysis for ensuring that, even when an adversarial environment removes a subset of workers from service, a workflow can still be instantiated to satisfy all the security constraints. Wang and Li proposed three notions of workflow resiliency: static, decremental, and dynamic resiliency. While decremental and dynamic resiliency are both PSPACE-complete, Wang and Li did not provide a matching lower and upper bound for the complexity of static resiliency. #R##N#The present work begins with proving that static resiliency is $\Pi_2^p$-complete, thereby bridging a long-standing complexity gap in the literature. In addition, a fourth notion of workflow resiliency, one-shot resiliency, is proposed and shown to remain in the third level of the polynomial hierarchy. This shows that sophisticated notions of workflow resiliency need not be PSPACE-complete. Lastly, we demonstrate how to reduce static and one-shot resiliency to Answer Set Programming (ASP), a modern constraint-solving technology that can be used for solving reasoning tasks in the lower levels of the polynomial hierarchy. In summary, this work demonstrates the value of focusing on notions of workflow resiliency that reside in the lower levels of the polynomial hierarchy.

Includes members:
  Member "solving advanced argumentation problems with answer set programming":
    also connected through other hyperedges:
      (none)
  Member "parameterized resiliency problems via integer linear programming":
    also connected through other hyperedges:
      (none)
  Member "algorithms for the workflow satisfiability problem engineered for counting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pattern based approach to the workflow satisfiability problem with user independent constraints")
  Member "the bi objective workflow satisfiability problem and workflow resiliency":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pattern based approach to the workflow satisfiability problem with user independent constraints")
  Member "valued workflow satisfiability problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounded and approximate strong satisfiability in workflows")
  Member "iterative plan construction for the workflow satisfiability problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounded and approximate strong satisfiability in workflows")
  Member "constraint expressions and workflow satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bounded and approximate strong satisfiability in workflows")
  Member "the parameterized complexity of reasoning problems beyond np":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameterized resiliency problems via integer linear programming")

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.CR(Cryptography and Security)