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: "decentralized ap selection in large scale wireless lans considering multi ap interference"
  Abstract: Densification of access points (APs) in wireless local area networks (WLANs) increases the interference and the contention domains of each AP due to multiple overlapped basic service sets (BSSs). Consequently, high interference from multiple co-channel BSS at the target AP impairs system performance. To improve system performance in the presence of multi-BSSs interference, we propose a decentralized AP selection scheme that takes interference at the candidate APs into account and selects AP that offers best signal-interference-plus noise ratio (SINR). In the proposed algorithm, the AP selection process is distributed at the user stations (STAs) and is based on the estimated SINR in the downlink. Estimating SINR in the downlink helps capture the effect of interference from neighboring BSSs or APs. Based on a simulated large-scale 802.11 network, the proposed scheme outperforms the strongest signal first (SSF) AP selection scheme used in current 802.11 standards as well as the mean probe delay (MPD) AP selection algorithm in [3]; it achieves 99% and 43% gains in aggregate throughput over SSF and MPD, respectively. While increasing STA densification, the proposed scheme is shown to increase aggregate network performance.

Connected through hyperedge HE-1 (induced by source paper "multi armed bandits for decentralized ap selection in enterprise wlans"):
  with members:
    - "potential and pitfalls of multi armed bandits for decentralized spatial reuse in wlans"
    - "introduction to multi armed bandits"
    - "the tmb path loss model for 5 ghz indoor wifi scenarios on the empirical relationship between rssi mcs and spatial streams"
    - "a tutorial on thompson sampling"
    - "collaborative spatial reuse in wireless networks via selfish multi armed bandits"
    - "ieee 802 11ax high efficiency wlans"
    - "channel selection for network assisted d2d communication via no regret bandit learning with calibrated forecasting"
    - "contextual bandits with similarity information"

Connected through hyperedge HE-2 (induced by source paper "decentralized ap selection using multi armed bandits opportunistic epsilon greedy with stickiness"):
  with members:
    - "the tmb path loss model for 5 ghz indoor wifi scenarios on the empirical relationship between rssi mcs and spatial streams"
    - "ieee 802 11ax high efficiency wlans"
    - "channel selection for network assisted d2d communication via no regret bandit learning with calibrated forecasting"

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)