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: "performance of opportunistic epidemic routing on edge markovian dynamic graphs"
  Abstract: Connectivity patterns in intermittently-connected mobile networks (ICMN) can be modeled as edge-Markovian dynamic graphs. We propose a new model for epidemic propagation on such graphs and calculate a closed-form expression that links the best achievable delivery ratio to common ICMN parameters such as message size, maximum tolerated delay, and link lifetime. These theoretical results are compared to those obtained by replaying a real-life contact trace.

Connected through hyperedge HE-1 (induced by source paper "on the performance analysis of epidemic routing in non sparse delay tolerant networks"):
  with members:
    - "modelling the delay distribution of binary spray and wait routing protocol"
    - "hymad hybrid dtn manet routing for dense and highly dynamic wireless networks"
    - "connectivity percolation and information dissemination in large scale wireless networks with dynamic links"

Connected through hyperedge HE-2 (induced by source paper "performance modeling of epidemic routing in mobile social networks with emphasis on scalability"):
  with members:
    - "on the performance analysis of epidemic routing in non sparse delay tolerant networks"
    - "modeling spatial and temporal dependencies of user mobility in wireless mobile networks"

Connected through hyperedge HE-3 (induced by source paper "stability of spreading processes over time varying large scale networks"):
  with members:
    - "an efficient curing policy for epidemics on graphs"
    - "optimal vaccine allocation to control epidemic outbreaks in arbitrary networks"
    - "not always sparse flooding time in partially connected mobile ad hoc networks"
    - "information contagion an empirical study of the spread of news on digg and twitter social networks"

Connected through hyperedge HE-4 (induced by source paper "rumor spreading in random evolving graphs"):
  with members:
    - "information spreading in stationary markovian evolving graphs"
    - "strong robustness of randomized rumor spreading protocols"
    - "information propagation speed in mobile and delay tolerant networks"

Connected through hyperedge HE-5 (induced by source paper "distributed community detection in dynamic graphs"):
  with members:
    - "on the analysis of a label propagation algorithm for community detection"
    - "information spreading in stationary markovian evolving graphs"

Connected through hyperedge HE-6 (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"
    - "fast flooding over manhattan"
    - "modelling mobility a discrete revolution"
    - "information propagation speed in mobile and delay tolerant networks"
    - "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.NI(Networking and Internet Architecture)