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: "erasure code based low storage blockchain node"
  Abstract: The concept of a decentralized ledger usually implies that each node of a blockchain network stores the entire blockchain. However, in the case of popular blockchains, which each weigh several hundreds of GB, the large amount of data to be stored can incite new or low-capacity nodes to run lightweight clients. Such nodes do not participate to the global storage effort and can result in a centralization of the blockchain by very few nodes, which is contrary to the basic concepts of a blockchain. #R##N#To avoid this problem, we propose new low storage nodes that store a reduced amount of data generated from the blockchain by using erasure codes. The properties of this technique ensure that any block of the chain can be easily rebuild from a small number of such nodes. This system should encourage low storage nodes to contribute to the storage of the blockchain and to maintain decentralization despite of a globally increasing size of the blockchain. This system paves the way to new types of blockchains which would only be managed by low capacity nodes.

Connected through hyperedge HE-1 (induced by source paper "coded merkle tree solving data availability attacks in blockchains"):
  with members:
    - "polyshard coded sharding achieves linearly scaling efficiency and security simultaneously"
    - "fraud and data availability proofs maximising light client security and scaling blockchains with dishonest majorities"
    - "lsb a lightweight scalable blockchain for iot security and privacy"
    - "dynamic distributed storage for scaling blockchains"
    - "bitcoin ng a scalable blockchain protocol"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-2 (induced by source paper "sef a secure fountain architecture for slashing storage costs in blockchains"):
  with members:
    - "polyshard coded sharding achieves linearly scaling efficiency and security simultaneously"
    - "consensus in the age of blockchains"
    - "dynamic distributed storage for scaling blockchains"
    - "solida a blockchain protocol based on reconfigurable byzantine consensus"
    - "a survey on network codes for distributed storage"
    - "efficient erasure decoding of reed solomon codes"

Connected through hyperedge HE-3 (induced by source paper "fraud and data availability proofs maximising light client security and scaling blockchains with dishonest majorities"):
  with members:
    - "consensus in the age of blockchains"
    - "chainspace a sharded smart contracts platform"
    - "novel polynomial basis and its application to reed solomon erasure codes"

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.CR(Cryptography and Security)