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: "atom horizontally scaling strong anonymity"
  Abstract: Atom is an anonymous messaging system that protects against traffic-analysis attacks. Unlike many prior systems, each Atom server touches only a small fraction of the total messages routed through the network. As a result, the system's capacity scales near-linearly with the number of servers. At the same time, each Atom user benefits from "best possible" anonymity: a user is anonymous among all honest users of the system, against an active adversary who controls the entire network, a portion of the system's servers, and any number of malicious users. The architectural ideas behind Atom have been known in theory, but putting them into practice requires new techniques for (1) avoiding the reliance on heavy general-purpose multi-party computation protocols, (2) defeating active attacks by malicious servers at minimal performance cost, and (3) handling server failure and churn. #R##N#Atom is most suitable for sending a large number of short messages, as in a microblogging application or a high-security communication bootstrapping ("dialing") for private messaging systems. We show that, on a heterogeneous network of 1,024 servers, Atom can transit a million Tweet-length messages in 28 minutes. This is over 23x faster than prior systems with similar privacy guarantees.

Connected through hyperedge HE-1 (induced by source paper "encode shuffle analyze privacy revisited formalizations and empirical evaluation"):
  with members:
    - "private heavy hitters and range queries in the shuffled model"
    - "the privacy blanket of the shuffle model"
    - "that which we call private"
    - "private stochastic convex optimization with optimal rates"
    - "evaluating differentially private machine learning in practice"
    - "differentially private summation with multi message shuffling"
    - "amplification by shuffling from local to central differential privacy via anonymity"
    - "privacy amplification by subsampling tight analyses via couplings and divergences"

Connected through hyperedge HE-2 (induced by source paper "prifi low latency anonymity for organizational networks"):
  with members:
    - "taranet traffic analysis resistant anonymity at the network layer"
    - "i know what you saw last minute encrypted http adaptive video streaming title classification"
    - "the loopix anonymity system"
    - "device fingerprinting in wireless networks challenges and opportunities"
    - "riposte an anonymous messaging system handling millions of users"
    - "hornet high speed onion routing at the network layer"
    - "dovetail stronger anonymity in next generation internet routing"
    - "hang with your buddies to resist intersection attacks"

Connected through hyperedge HE-3 (induced by source paper "talek private group messaging with hidden access patterns"):
  with members:
    - "xrd scalable messaging system with cryptographic privacy"
    - "the loopix anonymity system"
    - "riposte an anonymous messaging system handling millions of users"
    - "rappor randomized aggregatable privacy preserving ordinal response"
    - "proactively accountable anonymous messaging in verdict"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of anonymous communication through public networks"):
  with members:
    - "tempest temporal dynamics in anonymity systems"
    - "practical and provably secure onion routing"
    - "raptor routing attacks on privacy in tor"
    - "riposte an anonymous messaging system handling millions of users"
    - "the melbourne shuffle improving oblivious storage in the cloud"
    - "calibrating data to sensitivity in private data analysis"
    - "probabilistic analysis of onion routing in a black box model"

Connected through hyperedge HE-5 (induced by source paper "express lowering the cost of metadata hiding communication with cryptographic privacy"):
  with members:
    - "xrd scalable messaging system with cryptographic privacy"
    - "prio private robust and scalable computation of aggregate statistics"
    - "the loopix anonymity system"
    - "riposte an anonymous messaging system handling millions of users"
    - "conscript your friends into larger anonymity sets with javascript"
    - "proactively accountable anonymous messaging in verdict"

Connected through hyperedge HE-6 (induced by source paper "xrd scalable messaging system with cryptographic privacy"):
  with members:
    - "the loopix anonymity system"
    - "riposte an anonymous messaging system handling millions of users"

Connected through hyperedge HE-7 (induced by source paper "obladi oblivious serializable transactions in the cloud"):
  with members:
    - "spectre attacks exploiting speculative execution"
    - "safe serializable secure scheduling transactions and the trade off between security and consistency"
    - "high performance concurrency control mechanisms for main memory databases"

Connected through hyperedge HE-8 (induced by source paper "multiparty routing secure routing for mixnets"):
  with members:
    - "certificate transparency with privacy"
    - "certificate transparency with privacy"
    - "anonymous card shuffling and its applications to parallel mixnets"

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)