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 "an efficient permissioned blockchain model with provable reputation mechanism"):
  Abstract: Permissioned blockchain, in which only known nodes are allowed to participate, has been widely used by governments, companies, institutes and so on. We study the case where permissioned blockchain is applied to the field of horizontal strategic alliances to ensure that any participant of the alliance who does not follow the regulation will be detected and punished for his behavior afterward. We propose a general hierarchical model of permissioned blockchain which includes three tiers: providers, collectors, and governors. To utilize the overlap of collectors in gathering transactions from providers, we introduce the reputation as a measure of the reliability of the collectors. With the help of reputation system, governors will not need to check all transactions uploaded by collectors. As a result, our protocol will have a significant improvement in efficiency. Meanwhile, let us denote $T$ to be the number of total transactions. Then the number of mistakes that governors suffer is only asymptotically $O(\sqrt{T})$ when guided by our reputation mechanism, as long as there exists a collector who behaves well. This result implies that our protocol remains high performance. The reputation mechanism also provides incentives for collectors to work honestly. To our knowledge, Our work is the first one to give an analytical result on reputation mechanism in permissioned blockchains. Furthermore, we demonstrate two typical cases where our model can be well applied to.

Includes members:
  Member "poah a novel consensus algorithm for fast scalable private blockchain for large scale iot frameworks":
    also connected through other hyperedges:
      (none)
  Member "cycledger a scalable and secure parallel protocol for distributed ledger via sharding":
    also connected through other hyperedges:
      (none)
  Member "blockchains consensus protocols in the wild":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tenderbake classical bft style consensus for public 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.CR(Cryptography and Security)