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 "automated verification of accountability in security protocols"):
  Abstract: Accounting for misbehavior, instead of postulating trustworthiness, has been put forward as a new paradigm in protocol design. Accountability is meant to establish trust in the first place and to recognize and react if this trust is violated. Recently, a protocol-agnostic definition of accountability was proposed, characterizing misbehavior as deviations from the protocol that cause security violations. In this work, we provide the first mechanised method for the verification of accountability and demonstrate its use for verification and attack finding on various examples from the accountability and causality literature, including Kroll's accountable algorithms protocol. We reach a high degree of automation by transferring accountability to the centralized adversary setting in which almost all protocol verification tools operate. We show that accountability can be expressed in terms of trace properties, resulting in a sound and complete verification technique.

Includes members:
  Member "causality control flow":
    also connected through other hyperedges:
      (none)
  Member "sufficient and necessary causation are dual":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "causality control flow")
  Member "program actions as actual causes a building block for accountability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "causality control flow")

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)