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: "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
  Abstract: In this paper, we present a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes based on invariant subspace technique. Codes constructed in our framework not only contain some best known codes as special cases, but also include some new codes with good properties such as the optimal access property and the optimal update property. In addition, to the best of our knowledge, two of the new codes have the largest number of systematic nodes with the optimal update property for given store capacity of an individual node.

Connected through hyperedge HE-1 (induced by source paper "information theoretically secure erasure codes for distributed storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "generalization of rashmi shah kumar minimum storage regenerating codes"
    - "on minimizing data read and download for storage node recovery"

Connected through hyperedge HE-2 (induced by source paper "explicit mds codes for optimal repair bandwidth"):
  with members:
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "access vs bandwidth in codes for storage"
    - "mds array codes with optimal rebuilding"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "on codes for optimal rebuilding access"

Connected through hyperedge HE-3 (induced by source paper "a sytematic piggybacking design for minimum storage regenerating codes"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a piggybacking design framework for read and download efficient distributed storage codes"
    - "repair optimal erasure codes through hadamard designs"

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)