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: "distributed selfish load balancing"
  Abstract: Suppose that a set of $m$ tasks are to be shared as equally as possible amongst a set of $n$ resources. A game-theoretic mechanism to find a suitable allocation is to associate each task with a ``selfish agent'', and require each agent to select a resource, with the cost of a resource being the number of agents to select it. Agents would then be expected to migrate from overloaded to underloaded resources, until the allocation becomes balanced. #R##N#Recent work has studied the question of how this can take place within a distributed setting in which agents migrate selfishly without any centralized control. In this paper we discuss a natural protocol for the agents which combines the following desirable features: It can be implemented in a strongly distributed setting, uses no central control, and has good convergence properties. For $m\gg n$, the system becomes approximately balanced (an $\epsilon$-Nash equilibrium) in expected time $O(\log\log m)$. We show using a martingale technique that the process converges to a perfectly balanced allocation in expected time $O(\log\log m+n^4)$. We also give a lower bound of $\Omega(\max\{\log\log m,n\})$ for the convergence time.

Connected through hyperedge HE-1 (induced by source paper "fission a provably fast scalable and secure permissionless blockchain"):
  with members:
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "casper the friendly finality gadget"
    - "new kids on the block an analysis of modern blockchains"
    - "ipfs content addressed versioned p2p file system"
    - "majority is not enough bitcoin mining is vulnerable"

Connected through hyperedge HE-2 (induced by source paper "the dispersion time of random walks on finite graphs"):
  with members:
    - "on coalescence time in graphs when is coalescing as fast as meeting"

Connected through hyperedge HE-3 (induced by source paper "tight load balancing via randomized local search"):
  with members:
    - "self stabilizing repeated balls into bins"
    - "threshold load balancing in networks"
    - "load balancing via random local search in closed and open systems"

Connected through hyperedge HE-4 (induced by source paper "average case performance of replicator dynamics in potential games via computing regions of attraction"):
  with members:
    - "concurrent imitation dynamics in congestion games"

Connected through hyperedge HE-5 (induced by source paper "learning equilibria of games via payoff queries"):
  with members:
    - "the query complexity of correlated equilibria"
    - "finding approximate nash equilibria of bimatrix games via payoff queries"
    - "graphical models for game theory"
    - "on the communication complexity of approximate nash equilibria"
    - "query complexity of approximate nash equilibria"
    - "query complexity of correlated equilibrium"
    - "approximate well supported nash equilibria below two thirds"
    - "on the complexity of trial and error"

Connected through hyperedge HE-6 (induced by source paper "on the implications of lookahead search in game playing"):
  with members:
    - "on the complexity of nash dynamics and sink equilibria"
    - "bounding rationality by discounting time"
    - "convergence to equilibrium in local interaction games and ising models"

Connected through hyperedge HE-7 (induced by source paper "packing scheduling and covering problems in a game theoretic perspective"):
  with members:
    - "approximate strong equilibrium in job scheduling games"
    - "parametric packing of selfish items and the subset sum algorithm"
    - "strong nash equilibria in games with the lexicographical improvement property"
    - "on allocating goods to maximize fairness"
    - "on pure and approximate strong equilibria of facility location games"
    - "greedy facility location algorithms analyzed using dual fitting with factor revealing lp"

Connected through hyperedge HE-8 (induced by source paper "tight bounds for parallel randomized load balancing"):
  with members:
    - "optimal deterministic routing and sorting on the congested clique"
    - "distributed verification and hardness of distributed approximation"
    - "balanced allocation on graphs"

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.GT(Computer Science and Game Theory)