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 "deterministic protocols in the sinr model without knowledge of coordinates"):
  Abstract: Much work has been developed for studying the classical broadcasting problem in the SINR (Signal-to-Interference-plus-Noise-Ratio) model for wireless device transmission. The setting typically studied is when all radio nodes transmit a signal of the same strength. This work studies the challenging problem of devising a distributed algorithm for multi-broadcasting, assuming a subset of nodes are initially awake, for the SINR model when each device only has access to knowledge about the total number of nodes in the network $n$, the range from which each node's label is taken $[1,\dots,N]$, and the label of the device itself. Specifically, we assume no knowledge of the physical coordinates of devices and also no knowledge of neighborhood of each node. #R##N#We present a deterministic protocol for the multi-broadcast problem in $O(n \lg^2 N \lg n)$ rounds, for this setting, assuming that only a subset of all $n$ nodes are initially awake. A lower bound of $\Omega(n \lg N)$ rounds is known for this, but even that assumes knowledge of physical coordinates. All previous results in the literature are either randomized or intensively use the physical coordinates of the nodes and/or knowledge of the labels of nodes' neighbors. #R##N#In addition to the above result, we present algorithms to achieve multi-broadcast in $O(n \lg^2 N)$ rounds and create a backbone in $O(n \lg^2 N)$ rounds, assuming that all nodes are initially awake. For a given backbone, messages can be exchanged between every pair of connected nodes in the backbone in $O(\lg N)$ rounds and between any node and its leader in the backbone in $O(\Delta \lg N)$ rounds.

Includes members:
  Member "achieving dilution without knowledge of coordinates in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic backbone creation in an sinr network without knowledge of location")
  Member "deterministic backbone creation in an sinr network without knowledge of location":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "achieving dilution without knowledge of coordinates in the sinr model")
  Member "multi broadcasting under the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deterministic backbone creation in an sinr network without knowledge of location")
  Member "distributed communication in bare bones wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deterministic backbone creation in an sinr network without knowledge of location")
  Member "almost optimal cover free families":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exact learning from an honest teacher that answers membership queries")
  Member "beyond geometry towards fully realistic wireless models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "on the impact of geometry on ad hoc communication in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deterministic digital clustering of wireless ad hoc networks")
  Member "distributed deterministic broadcasting in uniform power ad hoc wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deterministic digital clustering of wireless ad hoc networks")

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)