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: "on weak dress codes for cloud storage"
  Abstract: In a distributed storage network, reliability and bandwidth optimization can be provided by regenerating codes. Recently table based regenerating codes viz. DRESS (Distributed Replication-based Exact Simple Storage) codes has been proposed which also optimizes the disk I/O. Dress codes consists of an outer MDS code with an inner fractional repetition (FR) code with replication degree $\rho$. Several constructions of FR codes based on regular graphs, resolvable designs and bipartite graphs are known. This paper presents a simple modular construction of FR codes. We also generalize the concept of FR codes to weak fractional repetition (WFR) codes where each node has different number of packets. We present a construction of WFR codes based on partial regular graph. Finally we present a simple generalized ring construction of both strong and weak fractional repetition codes.

Connected through hyperedge HE-1 (induced by source paper "bounds on fractional repetition codes using hypergraphs"):
  with members:
    - "load balanced fractional repetition codes"
    - "on the duality of fractional repetition codes"
    - "on some universally good fractional repetition codes"
    - "optimal fractional repetition codes and fractional repetition batch codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "reconstruction and repair degree of fractional repetition codes"
    - "replication based storage systems with local repair"
    - "explicit mbr all symbol locality codes"

Connected through hyperedge HE-2 (induced by source paper "on code rates of fractional repetition codes"):
  with members:
    - "on some universally good fractional repetition codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "reconstruction and repair degree of fractional repetition codes"
    - "explicit mbr all symbol locality codes"
    - "enumerating some fractional repetition codes"
    - "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-3 (induced by source paper "on the duality of fractional repetition codes"):
  with members:
    - "on dress codes with flowers"
    - "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"
    - "xoring elephants novel erasure codes for big data"
    - "enumerating some fractional repetition codes"
    - "repairable replication based storage systems using resolvable designs"
    - "scalable constructions of fractional repetition codes in distributed storage systems"

Connected through hyperedge HE-4 (induced by source paper "on optimal heterogeneous regenerating codes"):
  with members:
    - "tradeoff for heterogeneous distributed storage systems between storage and repair cost"
    - "on heterogeneous regenerating codes and capacity of distributed storage systems"
    - "a survey on network codes for distributed storage"
    - "network coding for distributed storage systems"

Connected through hyperedge HE-5 (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"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

Connected through hyperedge HE-6 (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"
    - "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"
    - "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems"
    - "scalable constructions of fractional repetition codes in distributed storage systems"

Connected through hyperedge HE-7 (induced by source paper "optimal fractional repetition codes based on graphs and designs"):
  with members:
    - "fractional repetition and erasure batch codes"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "optimal combinatorial batch codes based on block designs"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "reconstruction and repair degree of fractional repetition codes"
    - "replication based storage systems with local repair"
    - "locally repairable codes with multiple repair alternatives"
    - "exact repair regenerating codes via layered erasure correction and block designs"

Connected through hyperedge HE-8 (induced by source paper "on heterogeneous regenerating codes and capacity of distributed storage systems"):
  with members:
    - "when and by how much can helper node selection improve regenerating codes"
    - "new codes and inner bounds for exact repair in distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "capacity and security of heterogeneous 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"
    - "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)