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: "fastscan robust low complexity rate adaptation algorithm for video streaming over http"
  Abstract: This paper proposes and evaluates a novel algorithm for streaming video over HTTP. The problem is formulated as a non-convex optimization problem which is constrained by the predicted available bandwidth, chunk deadlines, available video rates, and buffer occupancy. The objective is to optimize a QoE metric that maintains a tradeoff between maximizing the playback rate of every chunk and ensuring fairness among different chunks for the minimum re-buffering time. We propose FastScan, a low complexity algorithm that solves the problem. Online adaptations for dynamic bandwidth environments are proposed with imperfect available bandwidth prediction. Results of experiments driven by Variable Bit Rate (VBR) encoded video, video platform system (dash.js), and cellular bandwidth traces of a public dataset reveal the robustness of the online version of FastScan algorithm and demonstrate its significant performance improvement as compared to the considered state-of-the-art video streaming algorithms. For example, on an experiment conducted over 100 real cellular available bandwidth traces of a public dataset that spans different available bandwidth regimes, our proposed algorithm (FastScan) achieves the minimum re-buffering (stall) time and the maximum average playback rate in every single trace as compared to Bola, Festive, BBA, RB, and FastMPC, and Pensieve algorithms.

Connected through hyperedge HE-1 (induced by source paper "enhancing video streaming in vehicular networks via resource slicing"):
  with members:
    - "lbp robust rate adaptation algorithm for svc video streaming"
    - "towards low latency and ultra reliable vehicle to vehicle communication"
    - "network slicing to enable scalability and flexibility in 5g mobile networks"
    - "system level performance evaluation of lte v2x network"
    - "a tutorial on spectral clustering"

Connected through hyperedge HE-2 (induced by source paper "generalization of lru cache replacement policy with applications to video streaming"):
  with members:
    - "lbp robust rate adaptation algorithm for svc video streaming"
    - "optimizing tcp loss recovery performance over mobile data networks"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "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-3 (induced by source paper "groupcast preference aware cooperative video streaming with scalable video coding"):
  with members:
    - "optimized preference aware multi path video streaming with scalable video coding"
    - "lbp robust rate adaptation algorithm for svc video streaming"

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)