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: "competitive mac under adversarial sinr"
  Abstract: This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. While this problem has already been studied intensively for simplistic single-hop or unit disk graph models, we make a leap forward and study MAC protocols for the SINR interference model (a.k.a. the physical model). #R##N#We make two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. The second contribution of this paper is a distributed MAC protocol which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.

Connected through hyperedge HE-1 (induced by source paper "deterministic digital clustering of wireless ad hoc networks"):
  with members:
    - "a local broadcast layer for the sinr network model"
    - "how well can graphs represent wireless interference"
    - "batched point location in sinr diagrams via algebraic tools"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "towards tight bounds for local broadcasting"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "deploying wireless networks with beeps"

Connected through hyperedge HE-2 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels"):
  with members:
    - "randomized communication in radio networks"
    - "scalable wake up of multi channel single hop radio networks"
    - "broadcasting in ad hoc multiple access channels"
    - "adversarial multiple access channels with individual injection rates"
    - "unbounded contention resolution in multiple access channels"
    - "maximum throughput of multiple access channels in adversarial environments"
    - "source routing and scheduling in packet networks"

Connected through hyperedge HE-3 (induced by source paper "is our model for contention resolution wrong"):
  with members:
    - "adversarial multiple access channels with individual injection rates"
    - "sinr diagrams towards algorithmically usable sinr models of wireless networks"

Connected through hyperedge HE-4 (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"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "tree codes and a conjecture on exponential sums"
    - "making evildoers pay resource competitive broadcast in sensor networks"

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

Connected through hyperedge HE-6 (induced by source paper "a resource competitive jamming defense"):
  with members:
    - "interactive communication with unknown noise rate"
    - "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"
    - "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.NI(Networking and Internet Architecture)