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 "effective wireless scheduling via hypergraph sketches"):
  Abstract: An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and rate adjustment? We propose the first framework for approximation algorithms in the physical model of wireless interference that addresses these questions in full. The approximations obtained are at most doubly logarithmic in the link length and rate diversity. Where previous bounds are known, this gives an exponential improvement (or better). #R##N#A key contribution is showing that the complex interference relationship of the physical model can be simplified, at a small cost, into a novel type of amenable conflict graphs. We also show that the approximation obtained is provably the best possible for any conflict graph formulation.

Includes members:
  Member "wireless link capacity under shadowing and fading":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spanning trees with edge conflicts and wireless connectivity")
  Member "the price of local power control in wireless scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spanning trees with edge conflicts and wireless connectivity")
  Member "how well can graphs represent wireless interference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "introduction to local certification")
  Member "beyond geometry towards fully realistic wireless models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spanning trees with edge conflicts and wireless connectivity")
  Member "jamming resistant learning in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "two dimensional anti jamming mobile communication based on reinforcement learning")
  Member "online independent set beyond the worst case secretaries prophets and periods":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust algorithms for the secretary problem")
  Member "dynamic packet scheduling in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spanning trees with edge conflicts and wireless connectivity")
  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 "universal framework for wireless scheduling problems")

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)