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: "reconstruction and repair degree of fractional repetition codes"
  Abstract: Given a Fractional Repetition code, finding the reconstruction and repair degree in a distributed storage system is an important problem. In this work, we present algorithms for computing the reconstruction and repair degree of fractional repetition 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"
    - "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"
    - "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems"

Connected through hyperedge HE-2 (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"
    - "replication based storage systems with local repair"
    - "explicit mbr all symbol locality codes"
    - "enumerating some fractional repetition codes"

Connected through hyperedge HE-3 (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"
    - "explicit mbr all symbol locality codes"
    - "enumerating some fractional repetition codes"
    - "on weak dress codes for cloud storage"
    - "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 "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"
    - "replication based storage systems with local repair"
    - "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-5 (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"
    - "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"
    - "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)