human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "achieving throughput via fine grained path planning in small world dtns"):
  Abstract: We explore the benefits of using fine-grained statistics in small world DTNs to achieve high throughput without the aid of external infrastructure. We first design an empirical node-pair inter-contacts model that predicts meetings within a time frame of suitable length, typically of the order of days, with a probability above some threshold, and can be readily computed with low overhead. This temporal knowledge enables effective time-dependent path planning that can be respond to even per-packet deadline variabilities. We describe one such routing framework, REAPER (for Reliable, Efficient and Predictive Routing), that is fully distributed and self-stabilizing. Its key objective is to provide probabilistic bounds on path length (cost) and delay in a temporally fine-grained way, while exploiting the small world structure to entail only polylogarithmic storage and control overhead. A simulation-based evaluation confirms that REAPER achieves high throughput and energy efficiency across the spectrum of ultra-light to heavy network traffic, and substantially outperforms state-of-the-art single copy protocols as well as sociability-based protocols that rely on essentially coarse-grained metrics.

Includes members:
  Member "backpressure with adaptive redundancy bwar":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "heat diffusion pareto optimal dynamic routing for time varying wireless networks")
  Member "modeling spatial and temporal dependencies of user mobility in wireless mobile networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance modeling of epidemic routing in mobile social networks with emphasis on scalability")

Question: Please tell me which class the source paper 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)