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 "leveraging multiple channels in ad hoc networks"):
  Abstract: We examine the utility of multiple channels of communication in wireless networks under the SINR model of interference. The central question is whether the use of multiple channels can result in linear speedup, up to some fundamental limit. We answer this question affirmatively for the data aggregation problem, perhaps the most fundamental problem in sensor networks. To achieve this, we form a hierarchical structure of independent interest, and illustrate its versatility by obtaining a new algorithm with linear speedup for the node coloring problem.

Includes members:
  Member "on the impact of geometry on ad hoc communication in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")
  Member "distributed deterministic broadcasting in uniform power ad hoc wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")
  Member "distributed connectivity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")
  Member "nearly optimal bounds for distributed wireless scheduling in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spanning trees with edge conflicts and wireless connectivity")
  Member "wireless connectivity and capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "wireless scheduling with power control":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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.DC(Distributed, Parallel, and Cluster Computing)