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: "a stochastic geometry framework for asynchronous full duplex networks"
  Abstract: In-band full-duplex is emerging as a promising solution to enhance throughput in wireless networks. Allowing nodes to simultaneously send and receive data over the same bandwidth can potentially double the system capacity, and a good degree of maturity has been reached in terms of physical layer design with practical demonstrations in simple topologies. However, the true potential of full-duplex at a system level is yet to be fully understood. In this paper, we introduce an analytical framework based on stochastic geometry that captures the behaviour of large full-duplex networks implementing an asynchronous random access policy. Via closed-form expressions we discuss the key tradeoffs that characterise these systems, exploring among the rest the role of transmission duration, imperfect self- interference cancellation and fraction of full-duplex nodes in the network. We also provide protocol design principles, and our comparison with slotted systems sheds light on the performance loss induced by the lack of synchronism.

Connected through hyperedge HE-1 (induced by source paper "wireless powered asynchronous backscatter networks with sporadic short packets performance analysis and optimization"):
  with members:
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "backscatter communications for the internet of things a stochastic geometry approach"
    - "physical layer security in mimo backscatter wireless systems"
    - "full duplex backscatter interference networks based on time hopping spread spectrum"
    - "some new research trends in wirelessly powered communications"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "wirelessly powered backscatter communication networks modeling coverage and capacity"
    - "wireless powered communication opportunities and challenges"

Connected through hyperedge HE-2 (induced by source paper "on the stability of a full duplex aloha network"):
  with members:
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"
    - "in band full duplex wireless challenges and opportunities"

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)