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 "on the impact of geometry on ad hoc communication in wireless networks"):
  Abstract: In this work we address the question how important is the knowledge of geometric location and network density to the efficiency of (distributed) wireless communication in ad hoc networks. We study fundamental communication task of broadcast and develop well-scalable, randomized algorithms that do not rely on GPS information, and which efficiency formulas do not depend on how dense the geometric network is. We consider two settings: with and without spontaneous wake-up of nodes. In the former setting, in which all nodes start the protocol at the same time, our algorithm accomplishes broadcast in $O(D\log n + \log^2 n)$ rounds under the SINR model, with high probability (whp), where $D$ is the diameter of the communication graph and $n$ is the number of stations. In the latter setting, in which only the source node containing the original message is active in the beginning, we develop a slightly slower algorithm working in $O(D\log^2 n)$ rounds whp. Both algorithms are based on a novel distributed coloring method, which is of independent interest and potential applicability to other communication tasks under the SINR wireless model.

Includes members:
  Member "randomized broadcast in radio networks with collision detection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  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 "dynamic packet scheduling in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  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 "a note on uniform power connectivity in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")

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)