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 pmds and sd codes extending raid 5"
  Abstract: A construction of Partial Maximum Distance Separable (PMDS) and Sector-Disk (SD) codes extending RAID 5 with two extra parities is given, solving an open problem. Previous constructions relied on computer searches, while our constructions provide a theoretical solution to the problem.

Connected through hyperedge HE-1 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions"):
  with members:
    - "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3"
    - "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "on optimal ternary locally repairable codes"
    - "liquid cloud storage"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with all symbol locality and availability"

Connected through hyperedge HE-2 (induced by source paper "constructions of maximally recoverable local reconstruction codes via function fields"):
  with members:
    - "how long can optimal locally repairable codes be"
    - "maximally recoverable codes for grid like topologies"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "partial mds codes and their application to raid type of architectures"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "maximally recoverable codes for grid like topologies"):
  with members:
    - "bipartite perfect matching is in quasi nc"
    - "on partial maximally recoverable and maximally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "partial mds codes and their application to raid type of architectures"

Connected through hyperedge HE-4 (induced by source paper "new constructions of sd and mr codes over small finite fields"):
  with members:
    - "explicit maximally recoverable codes with locality"
    - "optimal locally repairable codes and connections to matroid theory"
    - "partial mds codes and their application to raid type of architectures"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-5 (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 two sd codes"
    - "partial mds codes and their application to raid type of architectures"
    - "locally repairable codes"

Connected through hyperedge HE-6 (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 two sd codes"
    - "partial mds codes and their application to raid type of architectures"

Connected through hyperedge HE-7 (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 two sd codes"
    - "locally repairable codes"

Connected through hyperedge HE-8 (induced by source paper "explicit maximally recoverable codes with locality"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols in non linear codes"
    - "partial mds codes and their application to raid type of architectures"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "long nonbinary codes exceeding the gilbert varshamov bound for any fixed distance"

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)