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: "on delay constrained multicast capacity of large scale mobile ad hoc networks"
  Abstract: This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET consists of $n_s$ multicast sessions. Each multicast session has one source and $p$ destinations. The wireless mobiles move according to a two-dimensional i.i.d. mobility model. Each source sends identical information to the $p$ destinations in its multicast session, and the information is required to be delivered to all the $p$ destinations within $D$ time-slots. Given the delay constraint $D,$ we first prove that the capacity per multicast session is $O(\min\{1, (\log p)(\log (n_sp)) \sqrt{\frac{D}{n_s}}\}).$ Given non-negative functions $f(n)$ and $g(n)$: $f(n)=O(g(n))$ means there exist positive constants $c$ and $m$ such that $f(n) \leq cg(n)$ for all $ n\geq m;$ $f(n)=\Omega(g(n))$ means there exist positive constants $c$ and $m$ such that $f(n)\geq cg(n)$ for all $n\geq m;$ $f(n)=\Theta(g(n))$ means that both $f(n)=\Omega(g(n))$ and $f(n)=O(g(n))$ hold; $f(n)=o(g(n))$ means that $\lim_{n\to \infty} f(n)/g(n)=0;$ and $f(n)=\omega(g(n))$ means that $\lim_{n\to \infty} g(n)/f(n)=0.$ We then propose a joint coding/scheduling algorithm achieving a throughput of $\Theta(\min\{1,\sqrt{\frac{D}{n_s}}\}).$ Our simulations show that the joint coding/scheduling algorithm achieves a throughput of the same order ($\Theta(\min\{1, \sqrt{\frac{D}{n_s}}\})$) under random walk model and random waypoint model.

Connected through hyperedge HE-1 (induced by source paper "end to end delay modeling in buffer limited manets a general theoretical framework"):
  with members:
    - "backpressure with adaptive redundancy bwar"
    - "rethinking information theory for mobile ad hoc networks"

Connected through hyperedge HE-2 (induced by source paper "optimal dynamic multicast scheduling for cache enabled content centric wireless networks"):
  with members:
    - "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks"
    - "energy efficiency of downlink networks with caching at base stations"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "adaptive video streaming for wireless networks with multiple users and helpers"
    - "coded caching for delay sensitive content"
    - "on content centric wireless delivery networks"
    - "multicast aware caching for small cell networks"
    - "living on the edge the role of proactive caching in 5g wireless networks"

Connected through hyperedge HE-3 (induced by source paper "end to end delay modeling for mobile ad hoc networks a quasi birth and death approach"):
  with members:
    - "backpressure with adaptive redundancy bwar"
    - "optimal control in two hop relay routing"
    - "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)