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 minimal storage regenerating codes with the optimal access update property"
  Abstract: In this paper, we present a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes based on the 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 key properties, such as the optimal access property and the optimal update property. In particular, for a given storage capacity of an individual node, one of the new codes has the largest number of systematic nodes and two of the new codes have the largest number of systematic nodes with the optimal update property.

Connected through hyperedge HE-1 (induced by source paper "a systematic construction of mds codes with small sub packetization level and near optimal repair bandwidth"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "optimal exact repair strategy for the parity nodes of the k 2 k zigzag code"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

Connected through hyperedge HE-2 (induced by source paper "a generic transformation to enable optimal repair in mds codes for distributed storage systems"):
  with members:
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "minimum storage regenerating codes for all parameters"
    - "enabling all node repair in minimum storage regenerating codes"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"
    - "optimal exact repair strategy for the parity nodes of the k 2 k zigzag code"

Connected through hyperedge HE-3 (induced by source paper "code constructions for distributed storage with low repair bandwidth and low repair complexity"):
  with members:
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a family of erasure correcting codes with low repair bandwidth and low repair complexity"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-4 (induced by source paper "a new design of binary mds array codes with asymptotically weak optimal repair"):
  with members:
    - "minimum storage regenerating codes for all parameters"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
    - "repair optimal mds array codes over gf 2"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a piggybacking design framework for read and download efficient distributed storage codes"

Connected through hyperedge HE-5 (induced by source paper "on the placement delivery array design for centralized coded caching scheme"):
  with members:
    - "coded caching with low subpacketization levels"
    - "on the optimality of uncoded cache placement"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "femtocaching and device to device collaboration a new architecture for wireless video distribution"

Connected through hyperedge HE-6 (induced by source paper "generalized piggybacking codes for distributed storage systems"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a piggybacking design framework for read and download efficient distributed storage codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "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"
    - "searching for minimum storage regenerating codes"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

Connected through hyperedge HE-7 (induced by source paper "improved upper bounds on systematic length for linear minimum storage regenerating codes"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "codes between mbr and msr points with exact repair property"

Connected through hyperedge HE-8 (induced by source paper "enabling all node repair in minimum storage regenerating codes"):
  with members:
    - "optimal exact repair strategy for the parity nodes of the k 2 k zigzag code"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repair optimal erasure codes through hadamard designs"
    - "on codes for optimal rebuilding access"

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)