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: "tight bounds for parallel randomized load balancing"
  Abstract: We explore the fundamental limits of distributed balls-into-bins algorithms. We present an adaptive symmetric algorithm that achieves a bin load of two in log* n+O(1) communication rounds using O(n) messages in total. Larger bin loads can be traded in for smaller time complexities. We prove a matching lower bound of (1-o(1))log* n on the time complexity of symmetric algorithms that guarantee small bin loads at an asymptotically optimal message complexity of O(n). For each assumption of the lower bound, we provide an algorithm violating it, in turn achieving a constant maximum bin load in constant time. #R##N#As an application, we consider the following problem. Given a fully connected graph of n nodes, where each node needs to send and receive up to n messages, and in each round each node may send one message over each link, deliver all messages as quickly as possible to their destinations. We give a simple and robust algorithm of time complexity O(log* n) for this task and provide a generalization to the case where all nodes initially hold arbitrary sets of messages. A less practical algorithm terminates within asymptotically optimal O(1) rounds. All these bounds hold with high probability.

Connected through hyperedge HE-1 (induced by source paper "simple and sharp analysis of k means"):
  with members:
    - "noisy greedy and not so greedy k means"
    - "submodular optimization in the mapreduce model"
    - "a constant factor bi criteria approximation guarantee for k means"
    - "the power of randomization distributed submodular maximization on massive datasets"
    - "improved and simplified inapproximability for k means"
    - "the hardness of approximation of euclidean k means"
    - "a new framework for distributed submodular maximization"
    - "a comparative study of efficient initialization methods for the k means clustering algorithm"

Connected through hyperedge HE-2 (induced by source paper "parallel balanced allocations the heavily loaded case"):
  with members:
    - "the 1 2 3 toolkit for building your own balls into bins algorithm"
    - "balanced allocations a simple proof for the heavily loaded case"
    - "tight bounds for randomized load balancing on arbitrary network topologies"

Connected through hyperedge HE-3 (induced by source paper "rvh range vector hash for fast online packet classification"):
  with members:
    - "nfv state of the art challenges and implementation in next generation mobile networks vepc"

Connected through hyperedge HE-4 (induced by source paper "distributionally linearizable data structures"):
  with members:
    - "the power of choice in priority scheduling"

Connected through hyperedge HE-5 (induced by source paper "storage communication and load balancing trade off in distributed cache networks"):
  with members:
    - "proximity aware balanced allocations in cache networks"
    - "speeding up future video distribution via channel aware caching aided coded multicast"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "balanced allocation on graphs a random walk approach"
    - "asymptotic laws for joint content replication and delivery in wireless networks"
    - "fundamental limits of caching"
    - "femtocaching wireless video content delivery through distributed caching helpers"
    - "balanced allocation on graphs"

Connected through hyperedge HE-6 (induced by source paper "tight bounds for distributed graph computations"):
  with members:
    - "mst in o 1 rounds of the congested clique"
    - "near optimal clustering in the k machine model"
    - "worst case optimal algorithms for parallel query processing"
    - "algebraic methods in the congested clique"
    - "fast distributed algorithms for connectivity and mst in large graphs"
    - "fast distributed pagerank computation"
    - "almost optimal distributed algorithms for large scale graph problems"
    - "the input output complexity of triangle enumeration"

Connected through hyperedge HE-7 (induced by source paper "proximity aware balanced allocations in cache networks"):
  with members:
    - "multi server coded caching"
    - "hierarchical coded caching"
    - "balanced allocation on graphs a random walk approach"
    - "fundamental limits of caching in wireless d2d networks"
    - "fundamental limits of caching"
    - "femtocaching wireless video content delivery through distributed caching helpers"
    - "balanced allocation on graphs"
    - "practical load balancing for content requests in peer to peer networks"

Connected through hyperedge HE-8 (induced by source paper "fast distributed algorithms for connectivity and mst in large graphs"):
  with members:
    - "near optimal clustering in the k machine model"
    - "tight bounds for distributed graph computations"
    - "on the distributed complexity of large scale graph computations"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "super fast mst algorithms in the congested clique using o m messages"
    - "distributed algorithms for finding local clusters using heat kernel pagerank"
    - "algebraic methods in the congested clique"
    - "construction and impromptu repair of an mst in a distributed network with o m communication"

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.CC(Computational Complexity)