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: "connectivity percolation and information dissemination in large scale wireless networks with dynamic links"
  Abstract: We investigate the problem of disseminating broadcast messages in wireless networks with time-varying links from a percolation-based perspective. Using a model of wireless networks based on random geometric graphs with dynamic on-off links, we show that the delay for disseminating broadcast information exhibits two behavioral regimes, corresponding to the phase transition of the underlying network connectivity. When the dynamic network is in the subcritical phase, ignoring propagation delays, t he delay scales linearly with the Euclidean distance between the sender and the receiver. When the dynamic network is in the supercritical phase, the delay scales sublinearly with the distance. Finally, we show that in the pres ence of a non-negligible propagation delay, the delay for information dissemination scales linearly with the Euclidean distance in both the subcritical and supercritical regimes, with the rates for the linear scaling being differe nt in the two regimes.

Connected through hyperedge HE-1 (induced by source paper "on the performance analysis of epidemic routing in non sparse delay tolerant networks"):
  with members:
    - "modelling the delay distribution of binary spray and wait routing protocol"
    - "performance of opportunistic epidemic routing on edge markovian dynamic graphs"
    - "hymad hybrid dtn manet routing for dense and highly dynamic wireless networks"

Connected through hyperedge HE-2 (induced by source paper "on the connectivity and multihop delay of ad hoc cognitive radio networks"):
  with members:
    - "cognitive networks achieve throughput scaling of a homogeneous network"
    - "information propagation speed in mobile and delay tolerant networks"
    - "power control in cognitive radio networks how to cross a multi lane highway"
    - "bandwidth partitioning in decentralized wireless networks"
    - "scaling laws for overlaid wireless networks a cognitive radio network vs a primary network"
    - "scaling laws of cognitive networks"

Connected through hyperedge HE-3 (induced by source paper "connectivity of heterogeneous wireless networks"):
  with members:
    - "on the connectivity and multihop delay of ad hoc cognitive radio networks"
    - "power control in cognitive radio networks how to cross a multi lane highway"

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.IT(Information Theory)