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: "wireless connectivity and capacity"
  Abstract: Given $n$ wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent links can be scheduled in fewest possible time slots, assuming the SINR model of interference. #R##N#In this paper, we provide an algorithm that connects an arbitrary point set in $O(\log n)$ slots, improving on the previous best bound of $O(\log^2 n)$ due to Moscibroda. This is complemented with a super-constant lower bound on our approach to connectivity. An important feature is that the algorithms allow for bi-directional (half-duplex) communication. #R##N#One implication of this result is an improved bound of $\Omega(1/\log n)$ on the worst-case capacity of wireless networks, matching the best bound known for the extensively studied average-case. #R##N#We explore the utility of oblivious power assignments, and show that essentially all such assignments result in a worst case bound of $\Omega(n)$ slots for connectivity. This rules out a recent claim of a $O(\log n)$ bound using oblivious power. On the other hand, using our result we show that $O(\min(\log \Delta, \log n \cdot (\log n + \log \log \Delta)))$ slots suffice, where $\Delta$ is the ratio between the largest and the smallest links in a minimum spanning tree of the points. #R##N#Our results extend to the related problem of minimum latency aggregation scheduling, where we show that aggregation scheduling with $O(\log n)$ latency is possible, improving upon the previous best known latency of $O(\log^3 n)$. We also initiate the study of network design problems in the SINR model beyond strong connectivity, obtaining similar bounds for biconnected and $k$-edge connected structures.

Connected through hyperedge HE-1 (induced by source paper "reception capacity definitions game theory and hardness"):
  with members:
    - "how well can graphs represent wireless interference"
    - "algorithms for wireless capacity"
    - "wireless capacity with arbitrary gain matrix"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "on a game theoretic approach to capacity maximization in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "effective wireless scheduling via hypergraph sketches"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "jamming resistant learning in wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "dynamic packet scheduling in wireless networks"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"

Connected through hyperedge HE-3 (induced by source paper "spanning trees with edge conflicts and wireless connectivity"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "dynamic packet scheduling in wireless networks"
    - "algorithms for wireless capacity"
    - "graph products revisited tight approximation hardness of induced matching poset dimension and more"

Connected through hyperedge HE-4 (induced by source paper "wireless link capacity under shadowing and fading"):
  with members:
    - "3d channel model in 3gpp"
    - "beyond geometry towards fully realistic wireless models"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "a fully distributed algorithm for throughput performance in wireless networks"
    - "dynamic packet scheduling in wireless networks"
    - "algorithms for wireless capacity"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless capacity with oblivious power in general metrics"

Connected through hyperedge HE-5 (induced by source paper "reception capacity through perfect domination"):
  with members:
    - "how well can graphs represent wireless interference"
    - "braess s paradox in wireless networks the danger of improved technology"
    - "algorithms for wireless capacity"
    - "wireless capacity with arbitrary gain matrix"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "on a game theoretic approach to capacity maximization in wireless networks"

Connected through hyperedge HE-6 (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"
    - "towards tight bounds for local broadcasting"
    - "percolation and connectivity on the signal to interference ratio graph"
    - "algorithms for wireless capacity"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

Connected through hyperedge HE-7 (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"
    - "towards tight bounds for local broadcasting"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "wireless scheduling with power control"

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.DS(Data Structures and Algorithms)