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: "ohie blockchain scaling made simple"
  Abstract: Many blockchain consensus protocols have been proposed recently to scale the throughput of a blockchain with available bandwidth. However, these protocols are becoming increasingly complex, making it more and more difficult to produce proofs of their security guarantees. We propose a novel permissionless blockchain protocol OHIE which explicitly aims for simplicity. OHIE composes as many parallel instances of Bitcoin's original (and simple) backbone protocol as needed to achieve excellent throughput. We formally prove the safety and liveness properties of OHIE. We demonstrate its performance with a prototype implementation and large-scale experiments with up to 50,000 nodes. In our experiments, OHIE achieves linear scaling with available bandwidth, providing about 4-10 Mbps transaction throughput (under 8-20 Mbps per-node available bandwidth configurations) and at least about 20x better decentralization over prior works.

Connected through hyperedge HE-1 (induced by source paper "incentive analysis of bitcoin ng revisited"):
  with members:
    - "analysis of nakamoto consensus revisited"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "the gap game"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "solida a blockchain protocol based on reconfigurable byzantine consensus"
    - "optimal selfish mining strategies in bitcoin"
    - "bitcoin ng a scalable blockchain protocol"
    - "majority is not enough bitcoin mining is vulnerable"

Connected through hyperedge HE-2 (induced by source paper "privacy utility tradeoffs in routing cryptocurrency over payment channel networks"):
  with members:
    - "concurrency and privacy with payment channel networks"
    - "celer network bring internet scale to every blockchain"
    - "routing cryptocurrency with the spider network"
    - "high throughput cryptocurrency routing in payment channel networks"
    - "dandelion redesigning the bitcoin network for anonymity"
    - "settling payments fast and private efficient decentralized routing for path based transactions"
    - "deanonymisation of clients in bitcoin p2p network"
    - "extremal mechanisms for local differential privacy"

Connected through hyperedge HE-3 (induced by source paper "eunomia a permissionless parallel chain protocol based on logical clock"):
  with members:
    - "deconstructing the blockchain to approach physical limits"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "optimal selfish mining strategies in bitcoin"
    - "majority is not enough bitcoin mining is vulnerable"

Connected through hyperedge HE-4 (induced by source paper "prism scaling bitcoin by 10 000x"):
  with members:
    - "deconstructing the blockchain to approach physical limits"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "blockchains consensus protocols in the wild"
    - "the balance attack against proof of work blockchains the r3 testbed as an example"
    - "bitcoin ng a scalable blockchain protocol"

Connected through hyperedge HE-5 (induced by source paper "blockclique scaling blockchains through transaction sharding in a multithreaded block graph"):
  with members:
    - "scalable and probabilistic leaderless bft consensus through metastability"
    - "topological analysis of bitcoin s lightning network"
    - "decentralization in bitcoin and ethereum networks"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "consensus in the age of blockchains"
    - "chainspace a sharded smart contracts platform"
    - "bitcoin ng a scalable blockchain protocol"

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)