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: "a jamming resistant mac protocol for multi hop wireless networks"
  Abstract: This paper presents a simple local medium access control protocol, called \textsc{Jade}, for multi-hop wireless networks with a single channel that is provably robust against adaptive adversarial jamming. The wireless network is modeled as a unit disk graph on a set of nodes distributed arbitrarily in the plane. In addition to these nodes, there are adversarial jammers that know the protocol and its entire history and that are allowed to jam the wireless channel at any node for an arbitrary $(1-\epsilon)$-fraction of the time steps, where $0<\epsilon<1$ is an arbitrary constant. We assume that the nodes cannot distinguish between jammed transmissions and collisions of regular messages. Nevertheless, we show that \textsc{Jade} achieves an asymptotically optimal throughput if there is a sufficiently dense distribution of nodes.

Connected through hyperedge HE-1 (induced by source paper "deepwifi cognitive wifi with deep learning"):
  with members:
    - "generative adversarial learning for spectrum sensing"
    - "deep learning for launching and mitigating wireless jamming attacks"
    - "artificial neural networks based machine learning for wireless networks a tutorial"
    - "deep sensing cooperative spectrum sensing based on convolutional neural networks"
    - "enabling multi hop ad hoc networks through wifi direct multi group networking"
    - "hyperband a novel bandit based approach to hyperparameter optimization"
    - "convolutional radio modulation recognition networks"
    - "tensorflow a system for large scale machine learning"

Connected through hyperedge HE-2 (induced by source paper "singletons for simpletons revisiting windowed backoff using chernoff bounds"):
  with members:
    - "the energy complexity of broadcast"
    - "exponential separations in the energy complexity of leader election"
    - "scalable wake up of multi channel single hop radio networks"
    - "fast and robust compressive phase retrieval with sparse graph codes"
    - "unbounded contention resolution in multiple access channels"

Connected through hyperedge HE-3 (induced by source paper "jamming resistant learning in wireless networks"):
  with members:
    - "competitive mac under adversarial sinr"
    - "dynamic packet scheduling in wireless networks"
    - "algorithms for wireless capacity"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless connectivity and capacity"
    - "on a game theoretic approach to capacity maximization in wireless networks"
    - "approximation algorithms for secondary spectrum auctions"

Connected through hyperedge HE-4 (induced by source paper "a resource competitive jamming defense"):
  with members:
    - "interactive communication with unknown noise rate"
    - "competitive mac under adversarial sinr"
    - "vulnerability of lte to hostile interference"
    - "asynchrony and collusion in the n party bar transfer problem"
    - "making evildoers pay resource competitive broadcast in sensor networks"
    - "sybilcontrol practical sybil defense with computational puzzles"
    - "netfence preventing internet denial of service from inside out"

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)