human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "the price of local power control in wireless scheduling"):
  Abstract: We consider the problem of scheduling wireless links in the physical model, where we seek an assignment of power levels and a partition of the given set of links into the minimum number of subsets satisfying the signal-to-interference-and-noise-ratio (SINR) constraints. Specifically, we are interested in the efficiency of local power assignment schemes, or oblivious power schemes, in approximating wireless scheduling. Oblivious power schemes are motivated by networking scenarios when power levels must be decided in advance, and not as part of the scheduling computation. #R##N#We first show that the known algorithms fail to obtain sub-logarithmic bounds; that is, their approximation ratio are $\tilde\Omega(\log \max(\Delta,n))$, where $n$ is the number of links, $\Delta$ is the ratio of the maximum and minimum link lengths, and $\tilde\Omega$ hides doubly-logarithmic factors. We then present the first $O(\log{\log\Delta})$-approximation algorithm, which is known to be best possible (in terms of $\Delta$) for oblivious power schemes. We achieve this by representing interference by a conflict graph, which allows the application of graph-theoretic results for a variety of related problems, including the weighted capacity problem. We explore further the contours of approximability, and find the choice of power assignment matters; that not all metric spaces are equal; and that the presence of weak links makes the problem harder. Combined, our result resolve the price of oblivious power for wireless scheduling, or the value of allowing unfettered power control.

Includes members:
  Member "how well can graphs represent wireless interference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "introduction to local certification")
  Member "beyond geometry towards fully realistic wireless models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "wireless scheduling algorithms in complex environments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond geometry towards fully realistic wireless models")
  Member "on the impact of geometry on ad hoc communication in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")
  Member "approximation algorithms for wireless link scheduling with flexible data rates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wireless link capacity under shadowing and fading")
  Member "the power of non uniform wireless power":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "data dissemination in unified dynamic wireless networks")
  Member "towards tight bounds for local broadcasting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")
  Member "on the complexity of the minimum latency scheduling problem on the euclidean plane":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "effective wireless scheduling via hypergraph sketches")

Question: Please tell me which class the source paper 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)