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: "the cost of mitigating power law delay in random access networks"
  Abstract: Exponential backoff (EB) is a widely adopted collision resolution mechanism in many popular random-access networks including Ethernet and wireless LAN (WLAN). The prominence of EB is primarily attributed to its asymptotic throughput stability, which ensures a non-zero throughput even when the number of users in the network goes to infinity. Recent studies, however, show that EB is fundamentally unsuitable for applications that are sensitive to large delay and delay jitters, as it induces divergent second- and higher-order moments of medium access delay. Essentially, the medium access delay follows a power law distribution, a subclass of heavy-tailed distribution. To understand and alleviate the issue, this paper systematically analyzes the tail delay distribution of general backoff functions, with EB being a special case. In particular, we establish a tradeoff between the tail decaying rate of medium access delay distribution and the stability of throughput. To be more specific, convergent delay moments are attainable only when the backoff functions $g(k)$ grows slower than exponential functions, i.e., when $g(k)\in o(r^k)$ for all $r>1$. On the other hand, non-zero asymptotic throughput is attainable only when backoff functions grow at least as fast as an exponential function, i.e., $g(k)\in\Omega(r^k)$ for some $r>1$. This implies that bounded delay moments and stable throughput cannot be achieved at the same time. For practical implementation, we show that polynomial backoff (PB), where $g(k)$ is a polynomial that grows slower than exponential functions, obtains finite delay moments and good throughput performance at the same time within a practical range of user population. This makes PB a better alternative than EB for multimedia applications with stringent delay requirements.

Connected through hyperedge HE-1 (induced by source paper "distributed scheduling in wireless powered communication network protocol design and performance analysis"):
  with members:
    - "distributed charging control in broadband wireless power transfer networks"
    - "wireless powered communication networks an overview"
    - "wireless powered communication opportunities and challenges"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "throughput maximization in wireless powered communication networks"
    - "multi antenna wireless powered communication with energy beamforming"
    - "wireless information and power transfer architecture design and rate energy tradeoff"

Connected through hyperedge HE-2 (induced by source paper "fundamentals of the backoff process in 802 11 dichotomy of the aggregation"):
  with members:
    - "on the asymptotic validity of the decoupling assumption for analyzing 802 11 mac protocol"
    - "understanding fairness and its impact on quality of service in ieee 802 11"

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)