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: "max min fairness in 802 11 mesh networks"
  Abstract: In this paper we build upon the recent observation that the 802.11 rate region is log-convex and, for the first time, characterise max-min fair rate allocations for a large class of 802.11 wireless mesh networks. By exploiting features of the 802.11e/n MAC, in particular TXOP packet bursting, we are able to use this characterisation to establish a straightforward, practically implementable approach for achieving max-min throughput fairness. We demonstrate that this approach can be readily extended to encompass time-based fairness in multi-rate 802.11 mesh networks.

Connected through hyperedge HE-1 (induced by source paper "maximising the utility of enterprise millimetre wave networks"):
  with members:
    - "understanding noise and interference regimes in 5g millimeter wave cellular networks"
    - "rigorous and practical proportional fair allocation for multi rate wi fi"
    - "five disruptive technology directions for 5g"
    - "user association for load balancing in heterogeneous cellular networks"

Connected through hyperedge HE-2 (induced by source paper "a control theoretic approach to achieve proportional fairness in 802 11e edca wlans"):
  with members:
    - "log convexity of rate region in 802 11e wlans"

Connected through hyperedge HE-3 (induced by source paper "proportional fair mu mimo in 802 11 wlans"):
  with members:
    - "on the performance of packet aggregation in ieee 802 11ac mu mimo wlans"
    - "convexity conditions for 802 11 wlans"

Connected through hyperedge HE-4 (induced by source paper "convexity conditions for 802 11 wlans"):
  with members:
    - "log convexity of rate region in 802 11e wlans"

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)