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: "chain of trust can trusted hardware help scaling blockchains"
  Abstract: As blockchain systems proliferate, there remains an unresolved scalability problem of their underlying distributed consensus protocols. Byzantine Fault Tolerance (BFT) consensus protocols offer high transaction throughput, but can only support small networks. Proof-of-Work (PoW) consensus protocol, on the other hand, can support thousands of nodes, but at the expense of poor transaction throughput. Two potential approaches to address these scalability barriers are by relaxing the threat model, or employing sharding technique to deal with large networks. Nonetheless, their effectiveness against data-intensive blockchain workloads remains to be seen. #R##N#In this work, we study the use and effectiveness of trusted hardware on scaling distributed consensus protocols, and by their extension, blockchain systems. We first analyze existing approaches that harness trusted hardware to enhance scalability, and identify their limitations. Drawing insights from these results, we propose two design principles, namely scale up by scaling down and prioritize consensus messages, that enable the consensus protocols to scale. We illustrate the two principles by presenting optimizations that improve upon state-of-the-art solutions, and demonstrate via our extensive evaluations that they indeed offer better scalability. In particular, integrating our optimizations into Hyperledger Fabric achieves up to 7x higher throughput, while enabling the system to remain operational as the network size increases. Another optimization that we introduce to Hyperledger Sawtooth allows the system to sustain high throughput as the network grows. Finally, our new design for sharding protocols reduces the cost of shard creation phase by up to 35x.

Connected through hyperedge HE-1 (induced by source paper "on the feasibility of sybil attacks in shard based permissionless blockchains"):
  with members:
    - "polyshard coded sharding achieves linearly scaling efficiency and security simultaneously"
    - "towards scaling blockchain systems via sharding"
    - "a survey on security and privacy issues of bitcoin"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "blockchain mining games"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "solida a blockchain protocol based on reconfigurable byzantine consensus"
    - "centrally banked cryptocurrencies"

Connected through hyperedge HE-2 (induced by source paper "storage solutions for big data systems a qualitative study and comparison"):
  with members:
    - "a billion updates per second using 30 000 hierarchical in memory d4m databases"
    - "foundationdb record layer a multi tenant structured datastore"
    - "hadoop perfect file a fast access container for small files with direct in disc metadata access"
    - "decentralized search on decentralized web"
    - "effects of storage heterogeneity in distributed cache systems"
    - "database as a service current issues and its future"
    - "towards scaling blockchain systems via sharding"
    - "a stitch in time saves nine sparql querying of property graphs using gremlin traversals"

Connected through hyperedge HE-3 (induced by source paper "blockchains and distributed databases a twin study"):
  with members:
    - "atomic commitment across blockchains"
    - "cross chain deals and adversarial commerce"
    - "blockchain meets database design and implementation of a blockchain relational database"
    - "blockchain technology overview"
    - "performance evaluation of the quorum blockchain platform"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "towards scaling blockchain systems via sharding"
    - "atomic cross chain swaps"

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)