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: "replication based storage systems with local repair"
  Abstract: We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded repair, i.e., (a) upon failure, a node can be regenerated by simply downloading packets from the surviving nodes and (b) the number of surviving nodes contacted is strictly smaller than the number of nodes that need to be contacted for reconstructing the stored file. #R##N#Our codes consist of an outer MDS code and an inner fractional repetition code that specifies the placement of the encoded symbols on the storage nodes. For our class of codes, we identify the tradeoff between the local repair property and the minimum distance. We present codes based on graphs of high girth, affine resolvable designs and projective planes that meet the minimum distance bound for specific choices of file sizes.

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"
    - "explicit mbr all symbol locality codes"
    - "enumerating some fractional repetition codes"

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

Connected through hyperedge HE-3 (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"
    - "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"
    - "a construction of systematic mds codes with minimum repair bandwidth"
    - "fractional repetition codes for repair in distributed storage systems"

Connected through hyperedge HE-4 (induced by source paper "when locally repairable codes meet regenerating codes what if some helpers are unavailable"):
  with members:
    - "when can helper node selection improve regenerating codes part ii an explicit exact repair code construction"
    - "when can helper node selection improve regenerating codes part i graph based analysis"
    - "when and by how much can helper node selection improve regenerating codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "locally repairable codes with multiple repair alternatives"
    - "explicit mbr all symbol locality codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

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"
    - "enumerating some fractional repetition codes"
    - "on weak dress codes for cloud storage"
    - "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 "optimal fractional repetition codes and fractional repetition batch codes"):
  with members:
    - "optimal fractional repetition codes based on graphs and designs"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "optimal combinatorial batch codes based on block designs"
    - "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"
    - "fractional repetition codes for repair in distributed storage systems"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

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"
    - "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"
    - "codes with local regeneration"

Connected through hyperedge HE-8 (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"
    - "locally repairable codes with multiple repair alternatives"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "enumerating some fractional repetition 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)