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: "window based bft blockchain consensus"
  Abstract: There is surge of interest to the blockchain technology not only in the scientific community but in the business community as well. Proof of Work (PoW) and Byzantine Fault Tolerant (BFT) are the two main classes of consensus protocols that are used in the blockchain consensus layer. PoW is highly scalable but very slow with about 7 (transactions/second) performance. BFT based protocols are highly efficient but their scalability are limited to only tens of nodes. One of the main reasons for the BFT limitation is the quadratic  $O(n^{2})$  communication complexity of BFT based protocols for  $n$  nodes that requires  $n \times n$  broadcasting. In this paper, we present the Musch protocol which is BFT based and provides communication complexity  $O(fn+n)$  for  $f$  failures and  $n$  nodes, where  $f  , without compromising the latency. Hence, the performance adjusts to  $f$  such that for constant  $f$  the communication complexity is linear. Musch achieves this by introducing the notion of exponentially increasing windows of nodes to which complains are reported, instead of broadcasting to all the nodes. To our knowledge, this is the first BFT-based blockchain protocol which efficiently addresses simultaneously the issues of communication complexity and latency under the presence of failures.

Connected through hyperedge HE-1 (induced by source paper "a secure consensus protocol for sidechains"):
  with members:
    - "selfish mining in ethereum"
    - "flash efficient dynamic routing for offchain networks"
    - "proteus a scalable bft consesus protocol for blockchains"
    - "sbft a scalable and decentralized trust infrastructure"
    - "hotstuff bft consensus in the lens of blockchain"
    - "routing cryptocurrency with the spider network"
    - "a scale out blockchain for value transfer with spontaneous sharding"
    - "sprites and state channels payment networks that go faster than lightning"

Connected through hyperedge HE-2 (induced by source paper "proteus a scalable bft consesus protocol for blockchains"):
  with members:
    - "scalable byzantine consensus via hardware assisted secret sharing"
    - "sbft a scalable decentralized trust infrastructure for blockchains"

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)