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: "repair optimal mds array codes over gf 2"
  Abstract: Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, where they minimize the communication and disk access required for the recovery of failed nodes. However, the encoding and decoding algorithms of the proposed codes use arithmetic over finite fields of order greater than 2, which could result in a complex implementation. #R##N#In this work, we present a construction of 2-parity MDS array codes, that allow for optimal repair of a failed information node using XOR operations only. The reduction of the field order is achieved by allowing more parity bits to be updated when a single information bit is being changed by the user.

Connected through hyperedge HE-1 (induced by source paper "multi layer transformed mds codes with optimal repair access and low sub packetization"):
  with members:
    - "a unified form of evenodd and rdp codes and their efficient decoding"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "binary mds array codes with optimal repair"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "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"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-2 (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"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a piggybacking design framework for read and download efficient distributed storage codes"

Connected through hyperedge HE-3 (induced by source paper "binary mds array codes with optimal repair"):
  with members:
    - "a unified form of evenodd and rdp codes and their efficient decoding"
    - "a new design of binary mds array codes with asymptotically weak optimal repair"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
    - "xoring elephants novel erasure codes for big data"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-4 (induced by source paper "codes for graph erasures"):
  with members:
    - "codes for erasures over directed graphs"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "rebuilding for array codes in distributed storage systems"

Connected through hyperedge HE-6 (induced by source paper "a piggybacking design framework for read and download efficient distributed storage codes"):
  with members:
    - "a high rate msr code with polynomial sub packetization level"
    - "repairing reed solomon codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "a family of optimal locally recoverable codes"
    - "update efficient regenerating codes with minimum per node storage"
    - "quasi cyclic flexible regenerating codes"
    - "error correcting regenerating and locally repairable codes via rank metric 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)