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: "construction of two sd codes"
  Abstract: SD codes are erasure codes that address the mixed failure mode of current RAID systems. Rather than dedicate entire disks to erasure coding, as done in RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus individual sectors to erasure coding. The code then tolerates combinations of disk and sector errors, rather than solely disk errors. It is been an open problem to construct general codes that have the SD property, and previous work has relied on Monte Carlo searches. In this paper, we present two general constructions that address the cases with one disk and two sectors, and two disks and two sectors. Additionally, we make an observation about shortening SD codes that allows us to prune Monte Carlo searches.

Connected through hyperedge HE-1 (induced by source paper "on partial maximally recoverable and maximally recoverable codes"):
  with members:
    - "codes with locality for two erasures"
    - "a family of optimal locally recoverable codes"
    - "stair codes a general family of erasure codes for tolerating device and sector failures"
    - "construction of partial mds pmds and sector disk sd codes with two global parity symbols"
    - "explicit maximally recoverable codes with locality"
    - "construction of pmds and sd codes extending raid 5"
    - "partial mds codes and their application to raid type of architectures"
    - "locally repairable codes"

Connected through hyperedge HE-2 (induced by source paper "generalized concatenated types of codes for erasure correction"):
  with members:
    - "construction of partial mds pmds and sector disk sd codes with two global parity symbols"
    - "explicit maximally recoverable codes with locality"
    - "coding for combined block symbol error correction"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "construction of pmds and sd codes extending raid 5"
    - "partial mds codes and their application to raid type of architectures"

Connected through hyperedge HE-3 (induced by source paper "construction of partial mds pmds and sector disk sd codes with two global parity symbols"):
  with members:
    - "explicit maximally recoverable codes with locality"
    - "construction of pmds and sd codes extending raid 5"
    - "locally repairable 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)