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: "mds array codes with optimal rebuilding"
  Abstract: MDS array codes are widely used in storage systems to protect data against erasures. We address the \emph{rebuilding ratio} problem, namely, in the case of erasures, what is the the fraction of the remaining information that needs to be accessed in order to rebuild \emph{exactly} the lost information? It is clear that when the number of erasures equals the maximum number of erasures that an MDS code can correct then the rebuilding ratio is 1 (access all the remaining information). However, the interesting (and more practical) case is when the number of erasures is smaller than the erasure correcting capability of the code. For example, consider an MDS code that can correct two erasures: What is the smallest amount of information that one needs to access in order to correct a single erasure? Previous work showed that the rebuilding ratio is bounded between 1/2 and 3/4, however, the exact value was left as an open problem. In this paper, we solve this open problem and prove that for the case of a single erasure with a 2-erasure correcting code, the rebuilding ratio is 1/2. In general, we construct a new family of $r$-erasure correcting MDS array codes that has optimal rebuilding ratio of $\frac{1}{r}$ in the case of a single erasure. Our array codes have efficient encoding and decoding algorithms (for the case $r=2$ they use a finite field of size 3) and an optimal update property.

Connected through hyperedge HE-1 (induced by source paper "speeding up distributed machine learning using codes"):
  with members:
    - "a pliable index coding approach to data shuffling"
    - "coded computation over heterogeneous clusters"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "minimizing latency for secure distributed computing"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "a unified coding framework for distributed computing with straggling servers"
    - "on the worst case communication overhead for distributed data shuffling"
    - "information theoretic limits of data shuffling for distributed learning"

Connected through hyperedge HE-2 (induced by source paper "a connection between locally repairable codes and exact regenerating codes"):
  with members:
    - "when locally repairable codes meet regenerating codes what if some helpers are unavailable"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "locally repairable codes and matroid theory"
    - "codes between mbr and msr points with exact repair property"
    - "when and by how much can helper node selection improve regenerating codes"
    - "outer bounds for exact repair codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "new codes and inner bounds for exact repair in distributed storage systems"

Connected through hyperedge HE-3 (induced by source paper "constructions of optimal cyclic r delta locally repairable codes"):
  with members:
    - "constructions and properties of linear locally repairable codes"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "optimal binary locally repairable codes via anticodes"
    - "cyclic lrc codes and their subfield subcodes"
    - "achieving arbitrary locality and availability in binary codes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-4 (induced by source paper "minimum storage regenerating codes for all parameters"):
  with members:
    - "new mds codes with small sub packetization and near optimal repair bandwidth"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "general sub packetized access optimal 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"
    - "repairing reed solomon codes"
    - "constructions of high rate msr codes over small fields"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"

Connected through hyperedge HE-5 (induced by source paper "constructions and properties of linear locally repairable codes"):
  with members:
    - "codes between mbr and msr points with exact repair property"
    - "constructions of optimal and almost optimal locally repairable codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "optimal locally repairable linear codes"
    - "optimal locally repairable codes via rank metric codes"
    - "an upper bound on the size of locally recoverable codes"

Connected through hyperedge HE-6 (induced by source paper "repairing reed solomon codes with multiple erasures"):
  with members:
    - "broadcast repair for wireless distributed storage systems"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "cooperative repair of multiple node failures in distributed storage systems"
    - "repairing reed solomon codes"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact scalar minimum storage coordinated regenerating codes"
    - "locally repairable codes"
    - "cooperative regenerating codes"

Connected through hyperedge HE-7 (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"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "optimal construction of regenerating code through rate matching in hostile networks"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "repairing reed solomon codes"
    - "beyond the mds bound in distributed cloud storage"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "multilevel diversity coding with regeneration"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"

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)