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: "on the delay storage trade off in content download from coded distributed storage systems"
  Abstract: In this paper we study how coding in distributed storage reduces expected download time, in addition to providing reliability against disk failures. The expected download time is reduced because when a content file is encoded to add redundancy and distributed across multiple disks, reading only a subset of the disks is sufficient to reconstruct the content. For the same total storage used, coding exploits the diversity in storage better than simple replication, and hence gives faster download. We use a novel fork-join queuing framework to model multiple users requesting the content simultaneously, and derive bounds on the expected download time. Our system model and results are a novel generalization of the fork-join system that is studied in queueing theory literature. Our results demonstrate the fundamental trade-off between the expected download time and the amount of storage space. This trade-off can be used for design of the amount of redundancy required to meet the delay constraints on content delivery.

Connected through hyperedge HE-1 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes"):
  with members:
    - "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes"
    - "load balancing performance in distributed storage with regular balanced redundancy"
    - "analyzing the download time of availability codes"
    - "service rate region of content access from erasure coded storage"
    - "simplex queues for hot data download"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on distributed storage allocations of large files for maximum service rate"
    - "on the service capacity region of accessing erasure coded content"

Connected through hyperedge HE-2 (induced by source paper "parity models a general framework for coding based resilience in ml inference"):
  with members:
    - "collage inference tolerating stragglers in distributed neural network inference using coding"
    - "pretzel opening the black box of machine learning prediction serving systems"
    - "mobilenetv2 inverted residuals and linear bottlenecks"
    - "learning a code machine learning for approximate non linear coded computation"
    - "leveraging coding techniques for speeding up distributed computing"
    - "speeding up distributed machine learning using codes"
    - "rafiki machine learning as an analytics service system"
    - "tvm an automated end to end optimizing compiler for deep learning"

Connected through hyperedge HE-3 (induced by source paper "codenet training large scale neural networks in presence of soft errors"):
  with members:
    - "accumulation bit width scaling for ultra low precision training of deep networks"
    - "deep neural network approximation for custom hardware where we ve been where we re going"
    - "an application of storage optimal matdot codes for coded matrix multiplication fast k nearest neighbors estimation"
    - "hierarchical coded computation"
    - "learning a code machine learning for approximate non linear coded computation"
    - "speeding up distributed machine learning using codes"
    - "straggler resilient and communication efficient distributed iterative linear solver"
    - "training deep neural networks with 8 bit floating point numbers"

Connected through hyperedge HE-4 (induced by source paper "analyzing the download time of availability codes"):
  with members:
    - "straggler mitigation at scale"
    - "simplex queues for hot data download"
    - "on the service capacity region of accessing erasure coded content"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "efficient redundancy techniques for latency reduction in cloud systems"
    - "provably delay efficient data retrieving in storage clouds"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-5 (induced by source paper "multi tier caching analysis in cdn based over the top video streaming systems"):
  with members:
    - "fasttrack minimizing stalls for cdn based over the top video streaming systems"
    - "optimized video streaming over cloud a stall quality trade off"
    - "generalization of lru cache replacement policy with applications to video streaming"
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "a unified approach to the performance analysis of caching systems"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"

Connected through hyperedge HE-6 (induced by source paper "mds coding is better than replication for job completion times"):
  with members:
    - "gradient coding with clustering and multi message communication"
    - "speeding up distributed machine learning using codes"
    - "speeding up distributed gradient descent by utilizing non persistent stragglers"
    - "improving distributed gradient descent using reed solomon codes"
    - "when do redundant requests reduce latency"
    - "the mds queue analysing the latency performance of erasure codes"
    - "network coding meets tcp"

Connected through hyperedge HE-7 (induced by source paper "redundancy scheduling in systems with bi modal job service time distribution"):
  with members:
    - "straggler mitigation at scale"
    - "speeding up distributed machine learning using codes"
    - "on the effect of task to worker assignment in distributed computing systems with stragglers"
    - "straggler mitigation by delayed relaunch of tasks"
    - "effective straggler mitigation which clones should attack and when"
    - "efficient redundancy techniques for latency reduction in cloud systems"

Connected through hyperedge HE-8 (induced by source paper "optimal server selection for straggler mitigation"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "straggler mitigation by delayed relaunch of tasks"
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "using straggler replication to reduce latency in large scale parallel computing extended version"
    - "when do redundant requests reduce latency"

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.DC(Distributed, Parallel, and Cluster Computing)