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: "distributed data storage systems with opportunistic repair"
  Abstract: The reliability of erasure-coded distributed storage systems, as measured by the mean time to data loss (MTTDL), depends on the repair bandwidth of the code. Repair-efficient codes provide reliability values several orders of magnitude better than conventional erasure codes. Current state of the art codes fix the number of helper nodes (nodes participating in repair) a priori. In practice, however, it is desirable to allow the number of helper nodes to be adaptively determined by the network traffic conditions. In this work, we propose an opportunistic repair framework to address this issue. It is shown that there exists a threshold on the storage overhead, below which such an opportunistic approach does not lose any efficiency from the optimal storage-repair-bandwidth tradeoff; i.e. it is possible to construct a code simultaneously optimal for different numbers of helper nodes. We further examine the benefits of such opportunistic codes, and derive the MTTDL improvement for two repair models: one with limited total repair bandwidth and the other with limited individual-node repair bandwidth. In both settings, we show orders of magnitude improvement in MTTDL. Finally, the proposed framework is examined in a network setting where a significant improvement in MTTDL is observed.

Connected through hyperedge HE-1 (induced by source paper "differentiated latency in data center networks with erasure coded files through traffic engineering"):
  with members:
    - "joint latency and cost optimization for erasure coded data center storage"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "on the latency of erasure coded cloud storage systems"
    - "on the delay storage trade off in content download from coded distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "a reliability model for dependent and distributed mds disk array units"):
  with members:
    - "founsure 1 0 an erasure code library with efficient repair and update features"
    - "liquid cloud storage"
    - "asymptotically mds array bp xor codes"
    - "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead"
    - "redundancy and aging of efficient multidimensional mds parity protected 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 "centralized multi node repair regenerating codes"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "optimal mds codes for cooperative repair"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "repairing reed solomon codes with two erasures"
    - "repairing multiple failures for scalar mds codes"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-4 (induced by source paper "bandwidth adaptive error resilient mbr exact repair regenerating codes"):
  with members:
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "product matrix minimum storage regenerating codes with flexible number of helpers"
    - "mds codes with progressive engagement property for cloud storage systems"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "on mbr codes with replication"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "information theoretically secure erasure codes for distributed storage"
    - "beyond the mds bound in distributed cloud storage"

Connected through hyperedge HE-5 (induced by source paper "product matrix msr codes with bandwidth adaptive exact repair"):
  with members:
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "product matrix minimum storage regenerating codes with flexible number of helpers"
    - "mds codes with progressive engagement property for cloud storage systems"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "asymptotically optimal regenerating codes over any field"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"

Connected through hyperedge HE-6 (induced by source paper "product matrix minimum storage regenerating codes with flexible number of helpers"):
  with members:
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "mds codes with progressive engagement property for cloud storage systems"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "new codes and inner bounds for exact repair in distributed storage systems"):
  with members:
    - "exact regenerating codes between mbr and msr points"
    - "rate region of the 4 3 3 exact repair regenerating codes"
    - "capacity and security of heterogeneous distributed storage systems"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "high rate regenerating codes through layering"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repair optimal erasure codes through hadamard designs"
    - "on codes for optimal rebuilding access"

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)