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: "making evildoers pay resource competitive broadcast in sensor networks"
  Abstract: Consider a time-slotted, single-hop, wireless sensor network (WSN) consisting of n correct devices and and t=f*n Byzantine devices where f>=0 is any constant; that is, the Byzantine devices may outnumber the correct ones. There exists a trusted sender Alice who wishes to deliver a message m over a single channel to the correct devices. There also exists a malicious user Carol who controls the t Byzantine devices and uses them to disrupt the communication channel. For a constant k>=2, the correct and Byzantine devices each possess a meager energy budget of O(n^{1/k}), Alice and Carol each possess a limited budget of \tilde{O}(n^{1/k}), and sending or listening in a slot incurs unit cost. This general setup captures the inherent challenges of guaranteeing communication despite scarce resources and attacks on the network. Given this Alice versus Carol scenario, we ask: Is communication of m feasible and, if so, at what cost? #R##N#We develop a protocol which, for an arbitrarily small constant \epsilon>0, ensures that at least (1-\epsilon)n correct devices receive m with high probability. Furthermore, if Carol's devices expend T energy jamming the channel, then Alice and the correct devices each spend only \tilde{O}(T^{1/(k+1)}). In other words, delaying the transmission of m forces a jammer to rapidly deplete its energy supply and, consequently, cease attacks on the network.

Connected through hyperedge HE-1 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks"):
  with members:
    - "fast and resource competitive broadcast in multi channel radio networks"
    - "the energy complexity of broadcast"
    - "exploiting spontaneous transmissions for broadcasting and leader election in radio networks"
    - "exponential separations in the energy complexity of leader election"
    - "interactive communication with unknown noise rate"
    - "randomized broadcast in radio networks with collision detection"
    - "a resource competitive jamming defense"

Connected through hyperedge HE-2 (induced by source paper "resource competitive sybil defenses"):
  with members:
    - "proof of work without all the work"
    - "secure one way interactive communication"
    - "torbricks blocking resistant tor bridge distribution"
    - "interactive communication with unknown noise rate"
    - "bitcoin ng a scalable blockchain protocol"
    - "the mason test a defense against sybil attacks in wireless networks without trusted authorities"
    - "self healing computation"
    - "the sybil attacks and defenses a survey"

Connected through hyperedge HE-3 (induced by source paper "scalable and secure computation among strangers resource competitive byzantine protocols"):
  with members:
    - "time message trade offs in distributed algorithms"
    - "sending a message with unknown noise"
    - "torbricks blocking resistant tor bridge distribution"
    - "interactive communication with unknown noise rate"
    - "bitcoin ng a scalable blockchain protocol"
    - "sublinear bounds for randomized leader election"
    - "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary"

Connected through hyperedge HE-4 (induced by source paper "fast and resource competitive broadcast in multi channel radio networks"):
  with members:
    - "the energy complexity of broadcast"
    - "exploiting spontaneous transmissions for broadcasting and leader election in radio networks"
    - "randomized broadcast in radio networks with collision detection"
    - "a resource competitive jamming defense"

Connected through hyperedge HE-5 (induced by source paper "proof of work without all the work computationally efficient attack resistant systems"):
  with members:
    - "proof of work without all the work"
    - "secure one way interactive communication"
    - "torbricks blocking resistant tor bridge distribution"
    - "interactive communication with unknown noise rate"
    - "the mason test a defense against sybil attacks in wireless networks without trusted authorities"
    - "self healing computation"
    - "the sybil attacks and defenses a survey"
    - "storage and search in dynamic peer to peer networks"

Connected through hyperedge HE-6 (induced by source paper "interactive communication with unknown noise rate"):
  with members:
    - "interactive channel capacity revisited"
    - "breathe before speaking efficient information dissemination despite noisy limited and anonymous communication"
    - "competitive mac under adversarial sinr"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "tree codes and a conjecture on exponential sums"

Connected through hyperedge HE-7 (induced by source paper "how to scale exponential backoff"):
  with members:
    - "adversarial multiple access channels with individual injection rates"

Connected through hyperedge HE-8 (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"
    - "sybilcontrol practical sybil defense with computational puzzles"
    - "a jamming resistant mac protocol for multi hop wireless networks"
    - "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)