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: "fractional repetition codes with flexible repair from combinatorial designs"
  Abstract: Fractional repetition (FR) codes are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from the surviving nodes. In our work, we present constructions of FR codes based on Steiner systems and resolvable combinatorial designs such as affine geometries, Hadamard designs and mutually orthogonal Latin squares. The failure resilience of our codes can be varied in a simple manner. We construct codes with normalized repair bandwidth ($\beta$) strictly larger than one; these cannot be obtained trivially from codes with $\beta = 1$. Furthermore, we present the Kronecker product technique for generating new codes from existing ones and elaborate on their properties. FR codes with locality are those where the repair degree is smaller than the number of nodes contacted for reconstructing the stored file. For these codes we establish a tradeoff between the local repair property and failure resilience and construct codes that meet this tradeoff. Much of prior work only provided lower bounds on the FR code rate. In our work, for most of our constructions we determine the code rate for certain parameter ranges.

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"
    - "optimal fractional repetition codes based on graphs and 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 "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"
    - "optimal fractional repetition codes based on graphs and designs"
    - "codes with locality for two erasures"
    - "batch codes through dense graphs without short cycles"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "cooperative regenerating codes"

Connected through hyperedge HE-3 (induced by source paper "leveraging coding techniques for speeding up distributed computing"):
  with members:
    - "low subpacketization schemes for coded caching"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "coded caching for networks with the resolvability property"
    - "sum networks from incidence structures construction and capacity analysis"
    - "fundamental limits of caching"

Connected through hyperedge HE-4 (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"
    - "optimal fractional repetition codes based on graphs and 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-5 (induced by source paper "increasing availability in distributed storage systems via clustering"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "achieving arbitrary locality and availability in binary codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "locality and availability in distributed storage"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"

Connected through hyperedge HE-6 (induced by source paper "coded caching in a multi server system with random topology"):
  with members:
    - "cooperative multi sender index coding"
    - "coded caching with distributed storage"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "decentralized coded caching with distinct cache capacities"
    - "wireless content caching for small cell and d2d networks"
    - "caching and delivery via interference elimination"
    - "decentralized caching and coded delivery with distinct cache capacities"
    - "distributed index coding"

Connected through hyperedge HE-7 (induced by source paper "coded caching schemes with reduced subpacketization from linear block codes"):
  with members:
    - "asynchronous coded caching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "coded caching for networks with the resolvability property"
    - "sum networks from incidence structures construction and capacity analysis"
    - "capacity of sum networks for different message alphabets"
    - "finite length analysis of caching aided coded multicasting"

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"
    - "optimal fractional repetition codes based on graphs and 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)