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 "how well can graphs represent wireless interference"):
  Abstract: Efficient use of a wireless network requires that transmissions be grouped into feasible sets, where feasibility means that each transmission can be successfully decoded in spite of the interference caused by simultaneous transmissions. Feasibility is most closely modeled by a signal-to-interference-plus-noise (SINR) formula, which unfortunately is conceptually complicated, being an asymmetric, cumulative, many-to-one relationship. We re-examine how well graphs can capture wireless receptions as encoded in SINR relationships, placing them in a framework in order to understand the limits of such modelling. We seek for each wireless instance a pair of graphs that provide upper and lower bounds on the feasibility relation, while aiming to minimize the gap between the two graphs. The cost of a graph formulation is the worst gap over all instances, and the price of (graph) abstraction is the smallest cost of a graph formulation. We propose a family of conflict graphs that is parameterized by a non-decreasing sub-linear function, and show that with a judicious choice of functions, the graphs can capture feasibility with a cost of $O(\log^* \Delta)$, where $\Delta$ is the ratio between the longest and the shortest link length. This holds on the plane and more generally in doubling metrics. We use this to give greatly improved $O(\log^* \Delta)$-approximation for fundamental link scheduling problems with arbitrary power control. We explore the limits of graph representations and find that our upper bound is tight: the price of graph abstraction is $\Omega(\log^* \Delta)$. We also give strong impossibility results for general metrics, and for approximations in terms of the number of links.

Includes members:
  Member "beyond geometry towards fully realistic wireless models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "wireless scheduling algorithms in complex environments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the price of local power control in wireless scheduling")
  Member "approximation algorithms for wireless link scheduling with flexible data rates":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless link capacity under shadowing and fading")
  Member "dynamic packet scheduling in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "on the complexity of the minimum latency scheduling problem on the euclidean plane":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "algorithms for wireless capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "secondary spectrum auctions for symmetric and submodular bidders":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "wireless capacity and admission control in cognitive radio":
    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)