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: "fast flooding over manhattan"
  Abstract: We consider a Mobile Ad-hoc NETwork (MANET) formed by n agents that move at speed V according to the Manhattan Random-Way Point model over a square region of side length L. The resulting stationary (agent) spatial probability distribution is far to be uniform: the average density over the "central zone" is asymptotically higher than that over the "suburb". Agents exchange data iff they are at distance at most R within each other. #R##N#We study the flooding time of this MANET: the number of time steps required to broadcast a message from one source agent to all agents of the network in the stationary phase. We prove the first asymptotical upper bound on the flooding time. This bound holds with high probability, it is a decreasing function of R and V, and it is tight for a wide and relevant range of the network parameters (i.e. L, R and V). #R##N#A consequence of our result is that flooding over the sparse and highly-disconnected suburb can be as fast as flooding over the dense and connected central zone. Rather surprisingly, this property holds even when R is exponentially below the connectivity threshold of the MANET and the speed V is very low.

Connected through hyperedge HE-1 (induced by source paper "improved bounds on information dissemination by manhattan random waypoint model"):
  with members:
    - "information spreading in dynamic graphs"
    - "tight bounds on information dissemination in sparse mobile networks"
    - "inferring networks of diffusion and influence"
    - "modelling mobility a discrete revolution"

Connected through hyperedge HE-2 (induced by source paper "information spreading in dynamic graphs"):
  with members:
    - "tight bounds on information dissemination in sparse mobile networks"
    - "information spreading in stationary markovian evolving graphs"
    - "flooding time in opportunistic networks under power law and exponential inter contact times"
    - "performance of opportunistic epidemic routing on edge markovian dynamic graphs"
    - "modelling mobility a discrete revolution"
    - "information propagation speed in mobile and delay tolerant networks"
    - "manets high mobility can make up for low transmission power"

Connected through hyperedge HE-3 (induced by source paper "parsimonious flooding in geometric random walks"):
  with members:
    - "information spreading in stationary markovian evolving graphs"
    - "infectious random walks"
    - "information propagation speed in mobile and delay tolerant networks"
    - "manets high mobility can make up for low transmission power"

Connected through hyperedge HE-4 (induced by source paper "modelling mobility a discrete revolution"):
  with members:
    - "information spreading in stationary markovian evolving graphs"
    - "manets high mobility can make up for low transmission power"

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.DC(Distributed, Parallel, and Cluster Computing)