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: "the impact of mobility on gossip algorithms"
  Abstract: The influence of node mobility on the convergence time of averaging gossip algorithms in networks is studied. It is shown that a small number of fully mobile nodes can yield a significant decrease in convergence time. A method is developed for deriving lower bounds on the convergence time by merging nodes according to their mobility pattern. This method is used to show that if the agents have one-dimensional mobility in the same direction the convergence time is improved by at most a constant. Upper bounds are obtained on the convergence time using techniques from the theory of Markov chains and show that simple models of mobility can dramatically accelerate gossip as long as the mobility paths significantly overlap. Simulations verify that different mobility patterns can have significantly different effects on the convergence of distributed algorithms.

Connected through hyperedge HE-1 (induced by source paper "sample greedy gossip distributed kalman filter"):
  with members:
    - "analysis of sum weight like algorithms for averaging in wireless sensor networks"
    - "greedy gossip with eavesdropping"

Connected through hyperedge HE-2 (induced by source paper "information spreading in dynamic networks under oblivious adversaries"):
  with members:
    - "storage and search in dynamic peer to peer networks"
    - "lower bounds on information dissemination in dynamic networks"
    - "fast distributed computation in dynamic networks via random walks"
    - "faster information dissemination in dynamic networks via network coding"
    - "time varying graphs and dynamic networks"
    - "analyzing network coding gossip made easy"

Connected through hyperedge HE-3 (induced by source paper "slow links fast links and the cost of gossip"):
  with members:
    - "rumor spreading with bounded in degree"
    - "optimal gossip with direct addressing"
    - "radio network lower bounds made easy"
    - "simple fast and deterministic gossip and rumor spreading"
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"

Connected through hyperedge HE-4 (induced by source paper "gossiping with latencies"):
  with members:
    - "rumor spreading with bounded in degree"
    - "optimal gossip with direct addressing"
    - "radio network lower bounds made easy"
    - "simple fast and deterministic gossip and rumor spreading"
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"

Connected through hyperedge HE-5 (induced by source paper "optimizing the gossip algorithm with non uniform clock distribution over classical quantum networks"):
  with members:
    - "finite time convergent gossiping"
    - "optimizing the convergence rate of the continuous time quantum consensus"
    - "optimizing the convergence rate of the quantum consensus a discrete time model"
    - "gossip and distributed kalman filtering weak consensus under weak detectability"
    - "convergence rate analysis of distributed gossip linear parameter estimation fundamental limits and tradeoffs"
    - "gossip algorithms for distributed signal processing"
    - "geographic gossip efficient averaging for sensor networks"
    - "topology for distributed inference on graphs"

Connected through hyperedge HE-6 (induced by source paper "mobile conductance in sparse networks and mobility connectivity tradeoff"):
  with members:
    - "mobile conductance and gossip based information spreading in mobile networks"
    - "gossip based information spreading in mobile networks"
    - "tight bounds on information dissemination in sparse mobile networks"
    - "information spreading in stationary markovian evolving graphs"
    - "information propagation speed in mobile and delay tolerant networks"
    - "manets high mobility can make up for low transmission power"

Connected through hyperedge HE-7 (induced by source paper "epidemic spreading with external agents"):
  with members:
    - "inferring networks of diffusion and influence"
    - "gossiping with multiple messages"

Connected through hyperedge HE-8 (induced by source paper "mobile conductance and gossip based information spreading in mobile networks"):
  with members:
    - "gossip based information spreading in mobile networks"
    - "information spreading in stationary markovian evolving 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.NI(Networking and Internet Architecture)