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: "capacity of large scale csma wireless networks"
  Abstract: In the literature, asymptotic studies of multihop wireless network capacity often consider only centralized and deterministic time-division multiple-access (TDMA) coordination schemes. There have been fewer studies of the asymptotic capacity of large-scale wireless networks based on carrier-sensing multiple access (CSMA), which schedules transmissions in a distributed and random manner. With the rapid and widespread adoption of CSMA technology, a critical question is whether CSMA networks can be as scalable as TDMA networks. To answer this question and explore the capacity of CSMA networks, we first formulate the models of CSMA protocols to take into account the unique CSMA characteristics not captured by existing interference models in the literature. These CSMA models determine the feasible states, and consequently the capacity of CSMA networks. We then study the throughput efficiency of CSMA scheduling as compared to TDMA. Finally, we tune the CSMA parameters so as to maximize the throughput to the optimal order. As a result, we show that CSMA can achieve throughput as Ω([1/√(n)]), the same order as optimal centralized TDMA, on uniform random networks. Our CSMA scheme makes use of an efficient backbone-peripheral routing scheme and a careful design of dual carrier-sensing and dual channel scheme. We also address implementation issues of our CSMA scheme.

Connected through hyperedge HE-1 (induced by source paper "effective static and adaptive carrier sensing for dense wireless csma networks"):
  with members:
    - "effective carrier sensing in csma networks under cumulative interference"

Connected through hyperedge HE-2 (induced by source paper "general capacity for deterministic dissemination in wireless ad hoc networks"):
  with members:
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-3 (induced by source paper "transport capacity of distributed wireless csma networks"):
  with members:
    - "towards a simple relationship to estimate the capacity of static and mobile wireless networks"
    - "high sir transmission capacity of wireless networks with general fading and node distribution"
    - "on the throughput delay trade off in georouting networks"
    - "mean interference in hard core wireless networks"
    - "an overview of the transmission capacity of wireless networks"
    - "random access transport capacity"
    - "effective carrier sensing in csma networks under cumulative interference"
    - "interference and outage in clustered wireless ad hoc networks"

Connected through hyperedge HE-4 (induced by source paper "cell level modeling of ieee 802 11 wlans"):
  with members:
    - "modeling multi cell ieee 802 11 wlans with application to channel assignment"
    - "effective carrier sensing in csma networks under cumulative interference"
    - "back of the envelope computation of throughput distributions in csma wireless networks"

Connected through hyperedge HE-5 (induced by source paper "on the catalyzing effect of randomness on the per flow throughput in wireless networks"):
  with members:
    - "towards a system theoretic approach to wireless network capacity in finite time and space"
    - "rethinking information theory for mobile ad hoc networks"
    - "an end to end probabilistic network calculus with moment generating functions"

Connected through hyperedge HE-6 (induced by source paper "towards a simple relationship to estimate the capacity of static and mobile wireless networks"):
  with members:
    - "on the throughput delay trade off in georouting networks"
    - "an overview of the transmission capacity of wireless networks"

Connected through hyperedge HE-7 (induced by source paper "on the fundamental relationship determining the capacity of static and mobile wireless networks"):
  with members:
    - "an overview of the transmission capacity of wireless networks"

Connected through hyperedge HE-8 (induced by source paper "tcp reno over adaptive csma"):
  with members:
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "back of the envelope computation of throughput distributions in csma wireless 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)