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: "joint latency and cost optimization for erasure coded data center storage"
  Abstract: Modern distributed storage systems offer large capacity to satisfy the exponentially increasing need of storage space. They often use erasure codes to protect against disk and node failures to increase reliability, while trying to meet the latency requirements of the applications and clients. This paper provides an insightful upper bound on the average service delay of such erasure-coded storage with arbitrary service time distribution and consisting of multiple heterogeneous files. Not only does the result supersede known delay bounds that only work for a single file or homogeneous files, it also enables a novel problem of joint latency and storage cost minimization over three dimensions: selecting the erasure code, placement of encoded chunks, and optimizing scheduling policy. The problem is efficiently solved via the computation of a sequence of convex approximations with provable convergence. We further prototype our solution in an open-source cloud storage deployment over three geographically distributed data centers. Experimental results validate our theoretical delay analysis and show significant latency reduction, providing valuable insights into the proposed latency-cost tradeoff in erasure-coded storage.

Connected through hyperedge HE-1 (induced by source paper "grand challenges of resilience autonomous system resilience through design and runtime measures"):
  with members:
    - "spherical text embedding"
    - "straggler mitigation with tiered gradient codes"
    - "certified adversarial robustness via randomized smoothing"
    - "lower bounds on adversarial robustness from optimal transport"
    - "a reinforcement learning based approach for joint multi agent decision making"
    - "vstore a data store for analytics on large videos"
    - "optimal server selection for straggler mitigation"
    - "formal security analysis of neural networks using symbolic intervals"

Connected through hyperedge HE-2 (induced by source paper "capacity of distributed storage systems with clusters and separate nodes"):
  with members:
    - "storage and repair bandwidth tradeoff for distributed storage systems with clusters and separate nodes"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "rack aware regenerating codes for data centers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "the storage vs repair bandwidth trade off for multiple failures in clustered storage networks"
    - "capacity of clustered distributed storage"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"

Connected through hyperedge HE-3 (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"
    - "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"
    - "on the delay storage trade off in content download from coded distributed storage systems"

Connected through hyperedge HE-4 (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"
    - "using straggler replication to reduce latency in large scale parallel computing extended version"
    - "when do redundant requests reduce latency"
    - "on the delay storage trade off in content download from coded distributed storage systems"

Connected through hyperedge HE-5 (induced by source paper "differentiated latency in data center networks with erasure coded files through traffic engineering"):
  with members:
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "distributed data storage systems with opportunistic repair"
    - "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-6 (induced by source paper "resource allocation in multigranular optical networks"):
  with members:
    - "differentiated latency in data center networks with erasure coded files through traffic engineering"
    - "a reconfigurable high performance optical data center architecture"
    - "chronos a unifying optimization framework for speculative execution of deadline critical mapreduce jobs"
    - "on the optimality of scheduling dependent mapreduce tasks on heterogeneous machines"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"

Connected through hyperedge HE-7 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "coded caching with distributed storage"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

Connected through hyperedge HE-8 (induced by source paper "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"):
  with members:
    - "cooperative multi sender index coding"
    - "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"
    - "on the structure of interlinked cycle structures with interlocked outer cycles"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "structural characteristics of two sender index coding"
    - "on the capacity for distributed index coding"
    - "coded caching with distributed storage"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

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)