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: "backpressure with adaptive redundancy bwar"
  Abstract: Backpressure scheduling and routing, in which packets are preferentially transmitted over links with high queue differentials, offers the promise of throughput-optimal operation for a wide range of communication networks. However, when the traffic load is low, due to the corresponding low queue occupancy, backpressure scheduling/routing experiences long delays. This is particularly of concern in intermittent encounter-based mobile networks which are already delay-limited due to the sparse and highly dynamic network connectivity. While state of the art mechanisms for such networks have proposed the use of redundant transmissions to improve delay, they do not work well when the traffic load is high. We propose in this paper a novel hybrid approach that we refer to as backpressure with adaptive redundancy (BWAR), which provides the best of both worlds. This approach is highly robust and distributed and does not require any prior knowledge of network load conditions. We evaluate BWAR through both mathematical analysis and simulations based on a cell-partitioned model. We prove theoretically that BWAR does not perform worse than traditional backpressure in terms of the maximum throughput, while yielding a better delay bound. The simulations confirm that BWAR outperforms traditional backpressure at low load, while outperforming a state of the art encounter-routing scheme (Spray and Wait) at high load.

Connected through hyperedge HE-1 (induced by source paper "heat diffusion pareto optimal dynamic routing for time varying wireless networks"):
  with members:
    - "empirical evaluation of the heat diffusion collection protocol for wireless sensor networks"
    - "delay based back pressure scheduling in multihop wireless networks"
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
    - "distributed link scheduling with constant overhead"

Connected through hyperedge HE-2 (induced by source paper "achieving throughput via fine grained path planning in small world dtns"):
  with members:
    - "modeling spatial and temporal dependencies of user mobility in wireless mobile networks"

Connected through hyperedge HE-3 (induced by source paper "adaptive matching for expert systems with uncertain task types"):
  with members:
    - "matching while learning"
    - "enhancing the delay performance of dynamic backpressure algorithms"
    - "approval voting and incentives in crowdsourcing"
    - "near optimal bayesian active learning for decision making"
    - "delay based back pressure scheduling in multihop wireless networks"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"
    - "budget optimal task allocation for reliable crowdsourcing systems"
    - "analysis of thompson sampling for the multi armed bandit problem"

Connected through hyperedge HE-4 (induced by source paper "robotic wireless sensor networks"):
  with members:
    - "heat diffusion pareto optimal dynamic routing for time varying wireless networks"
    - "empirical evaluation of the heat diffusion collection protocol for wireless sensor networks"
    - "b a t mobile leveraging mobility control knowledge for efficient routing in mobile robotic networks"
    - "towards controllability of wireless network quality using mobile robotic routers"
    - "interference power bound analysis of a network of wireless robots"
    - "sequential decision algorithms for measurement based impromptu deployment of a wireless relay network along a line"
    - "route swarm wireless network optimization through mobility"
    - "robotic message ferrying for wireless networks using coarse grained backpressure control"

Connected through hyperedge HE-5 (induced by source paper "end to end delay modeling in buffer limited manets a general theoretical framework"):
  with members:
    - "on delay constrained multicast capacity of large scale mobile ad hoc networks"
    - "rethinking information theory for mobile ad hoc networks"

Connected through hyperedge HE-6 (induced by source paper "empirical evaluation of the heat diffusion collection protocol for wireless sensor networks"):
  with members:
    - "heat diffusion pareto optimal dynamic routing for time varying wireless networks"

Connected through hyperedge HE-7 (induced by source paper "enhancing the delay performance of dynamic backpressure algorithms"):
  with members:
    - "delay based back pressure scheduling in multihop wireless networks"
    - "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning"

Connected through hyperedge HE-8 (induced by source paper "end to end delay modeling for mobile ad hoc networks a quasi birth and death approach"):
  with members:
    - "optimal control in two hop relay routing"
    - "on delay constrained multicast capacity of large scale mobile ad hoc networks"
    - "rethinking information theory for mobile ad hoc networks"

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)