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: "dynamic distributed storage for scaling blockchains"
  Abstract: Blockchain uses the idea of storing transaction data in the form of a distributed ledger wherein each node in the network stores a current copy of the sequence of transactions in the form of a hash chain. This requirement of storing the entire ledger incurs a high storage cost that grows undesirably large for high transaction rates and large networks. In this work we use the ideas of secret key sharing, private key encryption, and distributed storage to design a coding scheme such that each node stores only a part of the entire transaction thereby reducing the storage cost to a fraction of its original cost. When further using dynamic zone allocation, we show the coding scheme can also improve the integrity of the transaction data in the network over current schemes. Further, block validation (bitcoin mining) consumes a significant amount of energy as it is necessary to determine a hash value satisfying a specific set of constraints; we show that using dynamic distributed storage reduces these energy costs.

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"
    - "erasure code based low storage blockchain node"
    - "lsb a lightweight scalable blockchain for iot security and privacy"
    - "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"
    - "erasure code based low storage blockchain node"
    - "consensus in the age of 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"

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.IT(Information Theory)