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 "arbitrary transmission power in the sinr model local broadcasting coloring and mis"):
  Abstract: In the light of energy conservation and the expansion of existing networks, wireless networks face the challenge of nodes with heterogeneous transmission power. However, for more realistic models of wireless communication only few algorithmic results are known. In this paper we consider nodes with arbitrary, possibly variable, transmission power in the so-called physical or SINR model. Our first result is a bound on the probabilistic interference from all simultaneously transmitting nodes on receivers. This result implies that current local broadcasting algorithms can be generalized to the case of non-uniform transmission power with minor changes. The algorithms run in $\O(\Gamma^{2} \Delta \log n)$ time slots if the maximal degree $\Delta$ is known, and $\O((\Delta + \log n)\Gamma^{2} \log n)$ otherwise, where $\Gamma$ is the ratio between the maximal and the minimal transmission range. The broad applicability of our result on bounding the interference is further highlighted, by generalizing a distributed coloring algorithm to this setting.

Includes members:
  Member "towards tight bounds for local broadcasting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")
  Member "wireless connectivity and capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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.DS(Data Structures and Algorithms)