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 construction of systematic mds codes with minimum repair bandwidth"
  Abstract: In a distributed storage system based on erasure coding, an important problem is the repair problem: If a node storing a coded piece fails, in order to maintain the same level of reliability, we need to create a new encoded piece and store it at a new node. This paper presents a construction of systematic (n,k)-MDS codes for 2k ≤ n that achieves the minimum repair bandwidth when repairing from k+1 nodes.

Connected through hyperedge HE-1 (induced by source paper "a novel construction of low complexity mds codes with optimal repair capability for distributed storage systems"):
  with members:
    - "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repair optimal erasure codes through hadamard designs"

Connected through hyperedge HE-2 (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-3 (induced by source paper "when can helper node selection improve regenerating codes part ii an explicit exact repair code construction"):
  with members:
    - "optimal fractional repetition codes based on graphs and designs"
    - "replication based storage systems with local repair"
    - "explicit mbr all symbol locality codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "repairable replication based storage systems using resolvable designs"
    - "scalable constructions of fractional repetition codes in distributed storage systems"
    - "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 "flexible fractional repetition codes for distributed storage networks"):
  with members:
    - "optimal fractional repetition codes based on graphs and designs"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "replication based storage systems with local repair"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "scalable constructions of fractional repetition codes in distributed storage systems"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "fractional repetition codes for repair in distributed storage systems"

Connected through hyperedge HE-5 (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"

Connected through hyperedge HE-6 (induced by source paper "when and by how much can helper node selection improve regenerating codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "explicit mbr all symbol locality codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "codes with local regeneration"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "cooperative regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "quasi cyclic flexible regenerating codes"):
  with members:
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems"
    - "locally repairable codes"
    - "mds array codes with optimal rebuilding"
    - "simple regenerating codes network coding for cloud storage"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-8 (induced by source paper "capacity and security of heterogeneous distributed storage systems"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "wireless device to device communications with distributed caching"
    - "distributed storage allocations"
    - "non homogeneous distributed storage systems"
    - "allocations for heterogenous distributed storage"
    - "cooperative regenerating codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repairing multiple failures with coordinated and adaptive regenerating 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)