human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "distributed deterministic broadcasting in wireless networks under the sinr model"
  Abstract: In this paper we initiate a study of distributed deterministic broadcasting in ad-hoc wireless networks with uniform transmission powers under the SINR model. We design algorithms in two settings: with and without local knowledge about immediate neighborhood. In the former setting, our solution has almost optimal O(Dlog2 n) time cost, where n is the size of a network, D is the eccentricity of the network and {1,...,N} is the set of possible node IDs. In the latter case, we prove an Omega(n log N) lower bound and develop an algorithm matching this formula, where n is the number of network nodes. As one of the conclusions, we derive that the inherited cost of broadcasting techniques in wireless networks is much smaller, by factor around min{n/D,Delta}, than the cost of learning the immediate neighborhood. Finally, we develop a O(D Delta log2 N) algorithm for the setting without local knowledge, where Delta is the upper bound on the degree of the communication graph of a network. This algorithm is close to a lower bound Omega(D Delta).

Connected through hyperedge HE-1 (induced by source paper "deterministic backbone creation in an sinr network without knowledge of location"):
  with members:
    - "achieving dilution without knowledge of coordinates in the sinr model"
    - "deterministic protocols in the sinr model without knowledge of coordinates"
    - "distributed bare bones communication in wireless networks"
    - "multi broadcasting under the sinr model"
    - "distributed communication in bare bones wireless networks"
    - "almost optimal cover free families"

Connected through hyperedge HE-2 (induced by source paper "achieving dilution without knowledge of coordinates in the sinr model"):
  with members:
    - "deterministic protocols in the sinr model without knowledge of coordinates"
    - "deterministic backbone creation in an sinr network without knowledge of location"
    - "multi broadcasting under the sinr model"
    - "almost optimal cover free families"

Connected through hyperedge HE-3 (induced by source paper "message and time efficient multi broadcast schemes"):
  with members:
    - "lower bounds on information dissemination in dynamic networks"
    - "distributed connectivity of wireless networks"

Connected through hyperedge HE-4 (induced by source paper "distributed backbone structure for deterministic algorithms in the sinr model of wireless networks"):
  with members:
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "a note on uniform power connectivity in the sinr model"

Question: Please tell me which class the center node 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)