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 unified form of evenodd and rdp codes and their efficient decoding"
  Abstract: Array codes have been widely employed in storage systems, such as Redundant Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and EVENODD codes are two popular double-parity array codes. As the capacity of hard disks increases, better fault tolerance by using array codes with three or more parity disks is needed. Although many extensions of RDP codes and EVENODD codes have been proposed, the high decoding complexity is the main drawback of them. In this paper, we present a new construction for all families of EVENODD codes and RDP codes, and propose a unified form of them. Under this unified form, RDP codes can be treated as shortened codes of EVENODD codes. Moreover, an efficient decoding algorithm based on an LU factorization of Vandermonde matrix is proposed when the number of continuous surviving parity columns is no less than the number of erased information columns. The new decoding algorithm is faster than the existing algorithms when more than three information columns fail. The proposed efficient decoding algorithm is also applicable to other Vandermonde array codes. Thus the proposed MDS array code is practically very meaningful for storage systems that need higher reliability.

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 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"
    - "repair optimal mds array codes over gf 2"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-2 (induced by source paper "array codes with local properties"):
  with members:
    - "maximally recoverable codes for grid like topologies"
    - "bounds and constructions of codes with multiple localities"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "binary mds array codes with optimal repair"):
  with members:
    - "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"
    - "repair optimal mds array codes over gf 2"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

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)