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: "quasirandom load balancing"
  Abstract: We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a randomized algorithm by keeping the accumulated rounding errors as small as possible. Our new algorithm, surprisingly, closely approximates the idealized process (where the tokens are divisible) on important network topologies. On $d$-dimensional torus graphs with $n$ nodes it deviates from the idealized process only by an additive constant. In contrast, the randomized rounding approach of Friedrich and Sauerwald [Proceedings of the \textup41st Annual ACM Symposium on Theory of Computing, 2009, pp. 121--130] can deviate up to $\Omega(\operatorname{polylog}(n))$, and the deterministic algorithm of Rabani, Sinclair, and Wanka [Proceedings of the \textup39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 694--705] has a deviation of $\Omega(n^{1/d})$. This makes our quasirandom algorithm the first known algorithm for t...

Connected through hyperedge HE-1 (induced by source paper "discrepancy analysis of a new randomized diffusion algorithm for weighted round matrices"):
  with members:
    - "improved analysis of deterministic load balancing schemes"
    - "deterministic random walks for rapidly mixing chains"
    - "tight bounds for randomized load balancing on arbitrary network topologies"

Connected through hyperedge HE-2 (induced by source paper "reachability switching games"):
  with members:
    - "unique end of potential line"
    - "arrival a zero player graph game in np conp"
    - "did the train reach its destination the complexity of finding a witness"

Connected through hyperedge HE-3 (induced by source paper "distributed graph clustering by load balancing"):
  with members:
    - "communication optimal distributed clustering"
    - "find your place simple distributed algorithms for community detection"
    - "partitioning well clustered graphs spectral clustering works"
    - "partitioning into expanders"
    - "approximating the expansion profile and almost optimal local graph clustering"
    - "tight bounds for randomized load balancing on arbitrary network topologies"
    - "a local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning"

Connected through hyperedge HE-4 (induced by source paper "the cover time of deterministic random walks for general transition probabilities"):
  with members:
    - "total variation discrepancy of deterministic random walks for ergodic markov chains"
    - "lock in problem for parallel rotor router walks"
    - "improved analysis of deterministic load balancing schemes"
    - "deterministic random walks for rapidly mixing chains"
    - "the cover time of deterministic random walks"

Connected through hyperedge HE-5 (induced by source paper "ergodic effects in token circulation"):
  with members:
    - "total variation discrepancy of deterministic random walks for ergodic markov chains"
    - "improved analysis of deterministic load balancing schemes"
    - "tight bounds for randomized load balancing on arbitrary network topologies"

Connected through hyperedge HE-6 (induced by source paper "total variation discrepancy of deterministic random walks for ergodic markov chains"):
  with members:
    - "lock in problem for parallel rotor router walks"
    - "improved analysis of deterministic load balancing schemes"
    - "deterministic random walks for rapidly mixing chains"
    - "a deterministic polynomial time approximation scheme for counting knapsack solutions"
    - "polynomial time approximation schemes for knapsack and related counting problems using branching programs"

Connected through hyperedge HE-7 (induced by source paper "improved analysis of deterministic load balancing schemes"):
  with members:
    - "deterministic random walks for rapidly mixing chains"
    - "tight bounds for randomized load balancing on arbitrary network topologies"
    - "distributed selfish load balancing with weights and speeds"
    - "the cover time of deterministic random walks"

Connected through hyperedge HE-8 (induced by source paper "discrete load balancing in heterogeneous networks with a focus on second order diffusion"):
  with members:
    - "tight bounds for randomized load balancing on arbitrary network topologies"

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.DS(Data Structures and Algorithms)