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: "optimal fractional repetition codes based on graphs and designs"
  Abstract: Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded exact repairs having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating (MBR) codes, where a random set of a certain size of available nodes is used for a node repair, the repairs with FR codes are table based. This usually allows to store more data compared to MBR codes. In this work, we consider bounds on the fractional repetition capacity, which is the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain these bounds are presented. The constructions of these FR codes are based on combinatorial designs and on families of regular and biregular graphs. These constructions of FR codes for given parameters raise some interesting questions in graph theory. These questions and some of their solutions are discussed in this paper. In addition, based on a connection between FR codes and batch codes, we propose a new family of codes for DSS, namely fractional repetition batch codes, which have the properties of batch codes and FR codes simultaneously. These are the first codes for DSS which allow for uncoded efficient exact repairs and load balancing which can be performed by several users in parallel. Other concepts related to FR codes are also discussed.

Connected through hyperedge HE-1 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage"):
  with members:
    - "access balancing in storage systems by labeling partial steiner systems"
    - "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"
    - "repairable replication based storage systems using resolvable designs"
    - "fractional repetition codes for repair in distributed storage systems"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

Connected through hyperedge HE-2 (induced by source paper "access balancing in storage systems by labeling partial steiner systems"):
  with members:
    - "optimal combinatorial batch codes based on block designs"
    - "fractional repetition codes for repair in distributed storage systems"

Connected through hyperedge HE-3 (induced by source paper "private information retrieval in graph based replication systems"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private computation of systematically encoded data with colluding servers"
    - "codes for graph erasures"
    - "private information retrieval from storage constrained databases coded caching meets pir"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "codes for erasures over directed graphs"
    - "pir array codes with optimal virtual server rate"
    - "multiround private information retrieval capacity and storage overhead"

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

Connected through hyperedge HE-5 (induced by source paper "load balanced fractional repetition codes"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "fractional repetition and erasure batch codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "codes with locality for two erasures"
    - "batch codes through dense graphs without short cycles"
    - "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"
    - "cooperative regenerating codes"

Connected through hyperedge HE-6 (induced by source paper "on the duality and file size hierarchy of fractional repetition codes"):
  with members:
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "xoring elephants novel erasure codes for big data"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-7 (induced by source paper "locality and availability of array codes constructed from subspaces"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "lengthening and extending binary private information retrieval codes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "locality via partially lifted codes"
    - "pir array codes with optimal virtual server rate"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "on private information retrieval array codes"

Connected through hyperedge HE-8 (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"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "xoring elephants novel erasure codes for big data"
    - "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"

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)