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: "distributed link scheduling with constant overhead"
  Abstract: This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. The class is parameterized by integers $k\geq 1$. We show that algorithm $k$ of our class achieves $k/(k+2)$ of the capacity region, for every $k\geq 1$. The algorithms have small and constant worst-case overheads: in particular, algorithm $k$ generates a new schedule using {\em (a)} time less than $4k+2$ round-trip times between neighboring nodes in the network, and {\em (b)} at most three control transmissions by any given node, for any $k$. The control signals are explicitly specified, and face the same interference effects as normal data transmissions. Our class of distributed wireless scheduling algorithms are the first ones guaranteed to achieve any fixed fraction of the capacity region while using small and constant overheads that do not scale with network size. The parameter $k$ explicitly captures the tradeoff between control overhead and scheduler throughput performance and provides a tuning knob protocol designers can use to harness this trade-off in practice.

Connected through hyperedge HE-1 (induced by source paper "heat diffusion pareto optimal dynamic routing for time varying wireless networks"):
  with members:
    - "empirical evaluation of the heat diffusion collection protocol for wireless sensor networks"
    - "delay based back pressure scheduling in multihop wireless networks"
    - "backpressure with adaptive redundancy bwar"
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"

Connected through hyperedge HE-2 (induced by source paper "leveraging physical layer capabilites distributed scheduling in interference networks with local views"):
  with members:
    - "topological interference management through index coding"
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "on the capacity of multi hop wireless networks with partial network knowledge"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "local multicoloring algorithms computing a nearly optimal tdma schedule in constant time"

Connected through hyperedge HE-3 (induced by source paper "throughput optimizing localized link scheduling for multihop wireless networks under physical interference model"):
  with members:
    - "novel architectures and algorithms for delay reduction in back pressure scheduling and routing"

Connected through hyperedge HE-4 (induced by source paper "exploiting the past to reduce delay in csma scheduling a high order markov chain approach"):
  with members:
    - "on the design of efficient csma algorithms for wireless networks"
    - "throughput optimal random access with order optimal delay"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "randomized scheduling algorithm for queueing networks"

Connected through hyperedge HE-5 (induced by source paper "link scheduling for throughput maximization in multihop wireless networks under physical interference"):
  with members:
    - "mlls minimum length link scheduling under physical interference model"
    - "the power of non uniform wireless power"
    - "a fully distributed algorithm for throughput performance in wireless networks"
    - "wireless network stability in the sinr model"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "wireless scheduling with power control"

Connected through hyperedge HE-6 (induced by source paper "on resource allocation in fading multiple access channels an efficient approximate projection approach"):
  with members:
    - "resource allocation in multiple access channels"

Connected through hyperedge HE-7 (induced by source paper "throughput optimal random access with order optimal delay"):
  with members:
    - "on the design of efficient csma algorithms for wireless networks"

Connected through hyperedge HE-8 (induced by source paper "dynamic rate allocation in fading multiple access channels"):
  with members:
    - "on resource allocation in fading multiple access channels an efficient approximate projection approach"
    - "rate and power allocation in fading multiple access channels"

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)