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: "video streaming in distributed erasure coded storage systems stall duration analysis"
  Abstract: The demand for global video has been burgeoning across industries. With the expansion and improvement of video-streaming services, cloud-based video is evolving into a necessary feature of any successful business for reaching internal and external audiences. This paper considers video streaming over distributed systems where the video segments are encoded using an erasure code for better reliability thus being the first work to our best knowledge that considers video streaming over erasure-coded distributed cloud systems. The download time of each coded chunk of each video segment is characterized and ordered statistics over the choice of the erasure-coded chunks is used to obtain the playback time of different video segments. Using the playback times, bounds on the moment generating function on the stall duration is used to bound the mean stall duration. Moment generating function based bounds on the ordered statistics are also used to bound the stall duration tail probability which determines the probability that the stall time is greater than a pre-defined number. These two metrics, mean stall duration and the stall duration tail probability, are important quality of experience (QoE) measures for the end users. Based on these metrics, we formulate an optimization problem to jointly minimize the convex combination of both the QoE metrics averaged over all requests over the placement and access of the video content. The non-convex problem is solved using an efficient iterative algorithm. Numerical results show significant improvement in QoE metrics for cloud-based video as compared to the considered baselines.

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"
    - "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"
    - "sprout a functional caching approach to minimize service latency in erasure coded 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"
    - "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"
    - "on the delay storage trade off in content download from coded distributed storage systems"

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

Connected through hyperedge HE-4 (induced by source paper "optimized video streaming over cloud a stall quality trade off"):
  with members:
    - "parallel and distributed methods for nonconvex optimization part i theory"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "xoring elephants novel erasure codes for big data"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "the mds queue analysing the latency performance of erasure codes"

Connected through hyperedge HE-5 (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"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "sprout a functional caching approach to minimize service latency in erasure coded 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.NI(Networking and Internet Architecture)