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 "information propagation on permissionless blockchains"):
  Abstract: Blockchain technology, as a decentralized and non-hierarchical platform, has the potential to replace centralized systems. Yet, there are several challenges inherent in the blockchain structure. One of the deficiencies of the existing blockchains is a convenient information propagation technique enhancing incentive-compatibility and bandwidth efficiency. The transition from a centralized system into distributed one brings along game theoretical concerns. Especially for the permissionless blockchains, information propagation should be incentive-compatible just like any other communication or computational costly operation. Another important issue is that information is relayed via gossip-like protocols causing excessive bandwidth usage. Each information is propagated at least twice: first to advertise its existence, second to announce that it is final and validated, i.e., added to the block. #R##N#In this work, we investigate two distinct aspects of the information propagation of the blockchains: incentive and routing mechanisms. For the former part, we analyze the necessary and sufficient conditions of the Sybil-proof incentive-compatible propagation methodology. We show the impossibility result of the Sybil-proofness in 1-connected network model. For the rest, we prove that the propagation decision is independent of the capabilities of the receiving side. Then, we formulate the generic fee sharing function which encourages rational participants to propagate information. Regarding the bandwidth efficiency, we study a special type of consensus protocols where the block owner (round leader) is validated before the block is created. We present a smart routing mechanism which the redundant communication cost from the size of the network to the scale of average shortest path length. Finally, we combine the incentive and routing mechanisms in a storage-efficient way.

Includes members:
  Member "decentralization in bitcoin and ethereum networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stability and scalability of blockchain systems")
  Member "dandelion redesigning the bitcoin network for anonymity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stability and scalability of blockchain systems")
  Member "hijacking bitcoin routing attacks on cryptocurrencies":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an overview on smart contracts challenges advances and platforms")
  Member "deanonymisation of clients in bitcoin p2p network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "characterizing eosio blockchain")
  Member "on subversive miner strategies and block withholding attack in bitcoin digital currency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploring the attack surface of blockchain a systematic overview")
  Member "the miner s dilemma":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "on bitcoin and red balloons":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "analysis of bitcoin pooled mining reward systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cryptomining makes noise a machine learning approach for cryptojacking detection")

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)