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: "network capacity region and minimum energy function for a delay tolerant mobile ad hoc network"
  Abstract: We investigate two quantities of interest in a delay-tolerant mobile ad hoc network: the network capacity region and the minimum energy function. The network capacity region is defined as the set of all input rates that the network can stably support considering all possible scheduling and routing algorithms. Given any input rate vector in this region, the minimum energy function establishes the minimum time-average power required to support it. In this paper, we consider a cell-partitioned model of a delay-tolerant mobile ad hoc network with general Markovian mobility. This simple model incorporates the essential features of locality of wireless transmissions as well as node mobility and enables us to exactly compute the corresponding network capacity and minimum energy function. Furthermore, we propose simple schemes that offer performance guarantees that are arbitrarily close to these bounds at the cost of an increased delay.

Connected through hyperedge HE-1 (induced by source paper "on the capacity of fractal d2d social networks with hierarchical communications"):
  with members:
    - "not call me cellular any more the emergence of scaling law fractal patterns and small world in wireless networks"
    - "wireless fractal cellular networks"
    - "fundamental limits on throughput capacity in information centric networks"
    - "systematic topology analysis and generation using degree correlations"
    - "evaluating mobility pattern space routing for dtns"
    - "capacity and character expansions moment generating function and other exact results for mimo correlated channels"

Connected through hyperedge HE-2 (induced by source paper "on performance modeling for manets under general limited buffer constraint"):
  with members:
    - "on throughput capacity for a class of buffer limited manets"
    - "end to end delay modeling in buffer limited manets a general theoretical framework"
    - "source delay in mobile ad hoc networks"
    - "rethinking information theory for mobile ad hoc networks"

Connected through hyperedge HE-3 (induced by source paper "capacity and delay throughput tradeoff in icmns with poisson meeting process"):
  with members:
    - "throughput and delay in random wireless networks with restricted mobility"

Connected through hyperedge HE-4 (induced by source paper "mobility diversity in mobile wireless networks"):
  with members:
    - "throughput and delay in random wireless networks with restricted mobility"

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)