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: "towards tight bounds for local broadcasting"
  Abstract: We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among $n$ wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a $\log^2 n$ additive term). This improves upon the previous best $O(\log n)$-approximate algorithm. Without power measurement, our algorithm achieves $O(\log n)$-approximation, matching the previous best result, but with a simpler approach that works under harsher conditions, such as arbitrary node failures. We give complementary lower bounds under reasonable assumptions.

Connected through hyperedge HE-1 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates"):
  with members:
    - "achieving dilution without knowledge of coordinates in the sinr model"
    - "deterministic backbone creation in an sinr network without knowledge of location"
    - "multi broadcasting under the sinr model"
    - "distributed communication in bare bones wireless networks"
    - "almost optimal cover free families"
    - "beyond geometry towards fully realistic wireless models"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"

Connected through hyperedge HE-2 (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"
    - "competitive mac under adversarial sinr"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "deploying wireless networks with beeps"

Connected through hyperedge HE-3 (induced by source paper "wireless aggregation at nearly constant rate"):
  with members:
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "percolation and connectivity on the signal to interference ratio graph"
    - "algorithms for wireless capacity"
    - "wireless connectivity and capacity"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

Connected through hyperedge HE-4 (induced by source paper "data dissemination in unified dynamic wireless networks"):
  with members:
    - "leveraging multiple channels in ad hoc networks"
    - "distributed bare bones communication in wireless networks"
    - "a local broadcast layer for the sinr network model"
    - "distributed communication in bare bones wireless networks"
    - "multi message broadcast with abstract mac layers and unreliable links"
    - "randomized broadcast in radio networks with collision detection"
    - "beyond geometry towards fully realistic wireless models"
    - "radio network lower bounds made easy"

Connected through hyperedge HE-5 (induced by source paper "leveraging multiple channels in ad hoc networks"):
  with members:
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "distributed connectivity of wireless networks"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "wireless connectivity and capacity"
    - "wireless scheduling with power control"

Connected through hyperedge HE-6 (induced by source paper "the price of local power control in wireless scheduling"):
  with members:
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "wireless scheduling algorithms in complex environments"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "the power of non uniform wireless power"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "algorithms for wireless capacity"

Connected through hyperedge HE-7 (induced by source paper "a local broadcast layer for the sinr network model"):
  with members:
    - "multi message broadcast with abstract mac layers and unreliable links"
    - "consensus with an abstract mac layer"
    - "randomized broadcast in radio networks with collision detection"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "a bound on the throughput of radio networks"
    - "bounds on contention management in radio networks"
    - "distributed connectivity of wireless networks"
    - "the power of non uniform wireless power"

Connected through hyperedge HE-8 (induced by source paper "beyond geometry towards fully realistic wireless models"):
  with members:
    - "wireless scheduling algorithms in complex environments"
    - "jamming resistant learning in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "distributed connectivity of wireless networks"
    - "mlls minimum length link scheduling under physical interference model"
    - "the power of non uniform wireless power"

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)