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: "program actions as actual causes a building block for accountability"
  Abstract: Protocols for tasks such as authentication, electronic voting, and secure multiparty computation ensure desirable security properties if agents follow their prescribed programs. However, if some agents deviate from their prescribed programs and a security property is violated, it is important to hold agents accountable by determining which deviations actually caused the violation. Motivated by these applications, we initiate a formal study of program actions as actual causes. Specifically, we define in an interacting program model what it means for a set of program actions to be an actual cause of a violation. We present a sound technique for establishing program actions as actual causes. We demonstrate the value of this formalism in two ways. First, we prove that violations of a specific class of safety properties always have an actual cause. Thus, our definition applies to relevant security properties. Second, we provide a cause analysis of a representative protocol designed to address weaknesses in the current public key certification infrastructure.

Connected through hyperedge HE-1 (induced by source paper "causality control flow"):
  with members:
    - "sufficient and necessary causation are dual"
    - "a modification of the halpern pearl definition of causality"
    - "graded causation and defaults"
    - "actual causation and the art of modeling"
    - "defaults and normality in causal structures"

Connected through hyperedge HE-2 (induced by source paper "automated verification of accountability in security protocols"):
  with members:
    - "causality control flow"
    - "sufficient and necessary causation are dual"

Connected through hyperedge HE-3 (induced by source paper "analyzing query performance and attributing blame for contentions in a cluster computing framework"):
  with members:
    - "perfxplain debugging mapreduce job performance"
    - "the complexity of causality and responsibility for query answers and non answers"
    - "why did my query slow down"

Connected through hyperedge HE-4 (induced by source paper "counterfactual causality from first principles"):
  with members:
    - "a modification of the halpern pearl definition of causality"
    - "axiomatizing causal reasoning"
    - "actual causation and the art of modeling"

Connected through hyperedge HE-5 (induced by source paper "what caused what a quantitative account of actual causation using dynamical causal networks"):
  with members:
    - "towards information based spatiotemporal patterns as a foundation for agent representation in dynamical systems"
    - "defining explanation in probabilistic systems"

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)