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: "communication efficient byzantine agreement without erasures"
  Abstract: Byzantine agreement (BA) is one of the most fundamental building blocks in distributed systems. A long-standing open problem is whether BA protocols with subquadratic communication complexity are possible in the presence of an adaptive attacker. A breakthrough result by King and Saia (JACM'11) showed how to overcome the quadradtic "barrier", assuming \emph{erasures}---that is, honest player can untraceably erase memory contents---achieving a communication complexity of $n^{1.5}$ while tolerating a constant fraction of corrupt nodes. Another very recent result by Micali (ITCS'17) also considers the erasure model and shows how to achieve close-to-optimal communication complexity $O(n \cdot \poly\log n)$, and handling $f<(1-\epsilon)n/3$ corrupted players, but this time using cryptographic assumptions (the existence of unique signatures and a "random oracle") and relying on a public key infrastructure (PKI). Both of these results are in the synchronous model of computation. #R##N#In this work, we present the first subquadratic protocols in the presence of a fully adaptive attacker \emph{without erasures}. We rely on the existence of an honestly generated PKI. We have: (1) an expected $O(1)$-round BA protocol with $O(n \cdot \poly\log n)$ communication complexity in the \emph{synchronous} model of communication, tolerating $f<(1-\epsilon) n/2$ adaptive corruptions; (2) a BA protocol with $O(n \cdot \poly\log n)$ communication complexity in the \emph{partially-synchronous} model of communication, tolerating $f<(1-\epsilon) n/3$ adaptive corruptions. #R##N#In the partially-synchronous model, the corruption bound $f<n/3$ is known to be tight, whereas in the synchronous model, the $f< n/2$ bound is the best known among expected $O(1)$-round protocols even for protocols with large communication complexity.

Connected through hyperedge HE-1 (induced by source paper "linbft linear communication byzantine fault tolerance for public blockchains"):
  with members:
    - "sbft a scalable decentralized trust infrastructure for blockchains"
    - "casper the friendly finality gadget"
    - "blockbench a framework for analyzing private blockchains"
    - "keeping authorities honest or bust with decentralized witness cosigning"

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.DC(Distributed, Parallel, and Cluster Computing)