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 "brick asynchronous state channels"):
  Abstract: Off-chain (Layer 2) protocols are a promising solution to the scalability and privacy challenges of blockchain systems. In off-chain protocols, or so-called channels, the core idea is that state changes between two parties in consensus need not be transparently published. Instead, on-chain computation (acting as a trusted third party) is only required when the parties are in dispute. Current proposals, however, require a synchronous network to preserve the safety of the channel, leaking to the adversary the exact amount of time he needs to control the network in order to attack clients. This problem is exacerbated when lifting the assumption of a perfect blockchain substrate, as low chain-quality (i.e. censorship probability) or congestion can break the assumption that dispute resolution transactions will appear on-chain on-time even if the network is perfect. In this paper, we introduce Brick, the first off-chain construction that remains secure under full asynchrony. The core idea is to incorporate the conflict resolution process within the off-chain channel by introducing a watchtower committee. Every state update is consistently broadcasted to the committee after approval. Hence, if a party wants to unilaterally close a channel, it can only get the committee's approval for the valid state. Furthermore, we consider the permissioned model of blockchains where the additional property of audibility might be desired for regulatory purposes and introduce Brick+ an off-chain construction that can provide auditability on top of Brick without conflicting with its privacy guarantees. We formally define the properties our state-channel construction should fulfill, prove them for Brick and Brick+, and design incentives for the committee such that honest and rational behavior align.

Includes members:
  Member "towards secure and efficient payment channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "congestion attacks in payment channel networks")
  Member "validated asynchronous byzantine agreement with optimal resilience and asymptotically optimal time and word communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved extension protocols for byzantine broadcast and agreement")
  Member "chainspace a sharded smart contracts platform":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "enhancing bitcoin security and performance with strong consistency via collective signing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "bitcoin meets strong consistency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the feasibility of sybil attacks in shard based permissionless blockchains")

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