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: "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems"
  Abstract: Modern distributed storage systems apply redundancy coding techniques to stored data. One form of redundancy is based on regenerating codes, which can minimize the repair bandwidth, i.e., the amount of data transferred when repairing a failed storage node. Existing regenerating codes mainly require surviving storage nodes encode data during repair. In this paper, we study functional minimum storage regenerating (FMSR) codes, which enable uncoded repair without the encoding requirement in surviving nodes, while preserving the minimum repair bandwidth guarantees and also minimizing disk reads. Under double-fault tolerance settings, we formally prove the existence of FMSR codes, and provide a deterministic FMSR code construction that can significantly speed up the repair process. We further implement and evaluate our deterministic FMSR codes to show the benefits. Our work is built atop a practical cloud storage system that implements FMSR codes, and we provide theoretical validation to justify the practicality of FMSR codes.

Connected through hyperedge HE-1 (induced by source paper "on universally good flower codes"):
  with members:
    - "on the duality of fractional repetition codes"
    - "on some universally good fractional repetition codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "optimal fractional repetition codes based on graphs and designs"
    - "reconstruction and repair degree of fractional repetition codes"
    - "enumerating some fractional repetition codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "repairable replication based storage systems using resolvable designs"

Connected through hyperedge HE-2 (induced by source paper "information theoretically secure erasure codes for distributed storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "generalization of rashmi shah kumar minimum storage regenerating codes"

Connected through hyperedge HE-3 (induced by source paper "optimal systematic distributed storage codes with fast encoding"):
  with members:
    - "fast product matrix regenerating codes"
    - "generalization of rashmi shah kumar minimum storage regenerating codes"
    - "xoring elephants novel erasure codes for big data"
    - "when do redundant requests reduce latency"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "regenerating codes a system perspective"

Connected through hyperedge HE-4 (induced by source paper "on dress codes with flowers"):
  with members:
    - "optimal fractional repetition codes and fractional repetition batch codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "optimal fractional repetition codes based on graphs and designs"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "reconstruction and repair degree of fractional repetition codes"
    - "replication based storage systems with local repair"
    - "enumerating some fractional repetition codes"
    - "on weak dress codes for cloud storage"

Connected through hyperedge HE-5 (induced by source paper "hfr code a flexible replication scheme for cloud storage systems"):
  with members:
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "optimal fractional repetition codes based on graphs and designs"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "locally repairable codes with multiple repair alternatives"
    - "on weak dress codes for cloud storage"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "repairable replication based storage systems using resolvable designs"
    - "scalable constructions of fractional repetition codes in distributed storage systems"

Connected through hyperedge HE-6 (induced by source paper "on the optimal provider selection for repair in distributed storage system with network coding"):
  with members:
    - "topology aware node selection for data regeneration in heterogeneous distributed storage systems"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "searching for minimum storage regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "fractional repetition codes with flexible repair from combinatorial designs"):
  with members:
    - "capacity of sum networks for different message alphabets"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "optimal fractional repetition codes based on graphs and designs"
    - "replication based storage systems with local repair"
    - "explicit mbr all symbol locality codes"
    - "regenerating codes a system perspective"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

Connected through hyperedge HE-8 (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"
    - "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"
    - "a construction of systematic mds codes with minimum repair bandwidth"

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)