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: "sprout a functional caching approach to minimize service latency in erasure coded storage"
  Abstract: Modern distributed storage systems 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. Storage systems may have caches at the proxy or client ends in order to reduce the latency. In this paper, we consider a novel caching framework with erasure code called {\em functional caching}. Functional Caching involves using erasure-coded chunks in the cache such that the code formed by the chunks in storage nodes and cache combined are maximal-distance-separable (MDS) erasure codes. Based on the arrival rates of different files, placement of file chunks on the servers, and service time distribution of storage servers, an optimal functional caching placement and the access probabilities of the file request from different disks are considered. The proposed algorithm gives significant latency improvement in both simulations and a prototyped solution in an open-source, cloud storage deployment.

Connected through hyperedge HE-1 (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"
    - "joint latency and cost optimization for erasure coded data center storage"

Connected through hyperedge HE-2 (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"
    - "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-3 (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"
    - "joint latency and cost optimization for erasure coded data center storage"

Connected through hyperedge HE-4 (induced by source paper "secure and energy efficient transmissions in cache enabled heterogeneous cellular networks performance analysis and optimization"):
  with members:
    - "generalization of lru cache replacement policy with applications to video streaming"
    - "cache enabled physical layer security for video streaming in backhaul limited cellular networks"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "secure video streaming in heterogeneous small cell networks with untrusted cache helpers"
    - "wireless caching technical misconceptions and business barriers"
    - "on edge caching with secrecy constraints"
    - "a survey on wireless security technical challenges recent advances and future trends"
    - "physical layer security in heterogeneous cellular networks"

Connected through hyperedge HE-5 (induced by source paper "generalization of lru cache replacement policy with applications to video streaming"):
  with members:
    - "fastscan robust low complexity rate adaptation algorithm for video streaming over http"
    - "lbp robust rate adaptation algorithm for svc video streaming"
    - "optimizing tcp loss recovery performance over mobile data networks"
    - "impact of traffic mix on caching performance in a content centric network"
    - "performance evaluation of the random replacement policy for networks of caches"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-6 (induced by source paper "the dof of two way butterfly networks"):
  with members:
    - "on the capacity regions of two way diamond channels"
    - "beyond one way communication degrees of freedom of multi way relay mimo interference networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "caching eliminates the wireless bottleneck in video aware wireless networks"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "nested lattice codes for gaussian two way relay channels"
    - "lattice coding for the two way two relay channel"
    - "two unicast two hop interference network finite field model"

Connected through hyperedge HE-7 (induced by source paper "taming tail latency for erasure coded distributed storage systems"):
  with members:
    - "joint latency and cost optimization for erasure coded data center storage"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "xoring elephants novel erasure codes for big data"
    - "tofec achieving optimal throughput delay trade off of cloud storage using erasure codes"
    - "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-8 (induced by source paper "tiered cloud storage via two stage latency aware bidding"):
  with members:
    - "differentiated latency in data center networks with erasure coded files through traffic engineering"
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "tail index for a distributed storage system with pareto file size distribution"
    - "time and location aware mobile data pricing"

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)