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: "analysis of a proportionally fair and locally adaptive spatial aloha in poisson networks"
  Abstract: The proportionally fair sharing of the capacity of a Poisson network using Spatial-Aloha leads to closed-form performance expressions in two extreme cases: (1) the case without topology information, where the analysis boils down to a parametric optimization problem leveraging stochastic geometry; (2) the case with full network topology information, which was recently solved using shot-noise techniques. We show that there exists a continuum of adaptive controls between these two extremes, based on local stopping sets, which can also be analyzed in closed form. We also show that these control schemes are implementable, in contrast to the full information case which is not. As local information increases, the performance levels of these schemes are shown to get arbitrarily close to those of the full information scheme. The analytical results are combined with discrete event simulation to provide a detailed evaluation of the performance of this class of medium access controls.

Connected through hyperedge HE-1 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach"):
  with members:
    - "timely updates in energy harvesting two hop networks offline and online policies"
    - "age optimal updates of multiple information flows"
    - "delay analysis of random scheduling and round robin in small cell networks"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "cell edge aware precoding for downlink massive mimo cellular networks"

Connected through hyperedge HE-2 (induced by source paper "locally adaptive scheduling policy for optimizing information freshness in wireless networks"):
  with members:
    - "delay analysis of random scheduling and round robin in small cell networks"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "cell edge aware precoding for downlink massive mimo cellular networks"
    - "spatiotemporal stochastic modeling of iot enabled cellular networks scalability and stability analysis"
    - "heterogeneous cellular networks with spatio temporal traffic delay analysis and scheduling"
    - "energy efficient design of mimo heterogeneous networks with wireless backhaul"
    - "coverage and rate analysis for millimeter wave cellular networks"

Connected through hyperedge HE-3 (induced by source paper "random access with opportunity detection in wireless networks"):
  with members:
    - "sense and predict harnessing spatial interference correlation for cognitive radio networks"
    - "sense and predict harnessing spatial interference correlation for opportunistic access in cognitive radio networks"
    - "exploiting regional differences a spatially adaptive random access"

Connected through hyperedge HE-4 (induced by source paper "optimizing user association and spectrum allocation in hetnets a utility perspective"):
  with members:
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"
    - "distributed pricing based user association for downlink heterogeneous cellular networks"
    - "tier association probability and spectrum partitioning for maximum rate coverage in multi tier heterogeneous networks"
    - "downlink and uplink decoupling a disruptive architectural design for 5g networks"
    - "modeling analysis and design for carrier aggregation in heterogeneous cellular networks"
    - "joint access point selection and power allocation for uplink wireless networks"
    - "downlink mimo hetnets modeling ordering results and performance analysis"
    - "joint resource partitioning and offloading in heterogeneous cellular 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)