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: "on the capacity of fractal wireless networks with direct social interactions"
  Abstract: The capacity of a fractal wireless network with direct social interactions is studied in this paper. Specifically, we mathematically formulate the self-similarity of a fractal wireless network by a power-law degree distribution $ P(k) $, and we capture the connection feature between two nodes with degree $ k_{1} $ and $ k_{2} $ by a joint probability distribution $ P(k_{1},k_{2}) $. It is proved that if the source node communicates with one of its direct contacts randomly, the maximum capacity is consistent with the classical result $ \Theta\left(\frac{1}{\sqrt{n\log n}}\right) $ achieved by Kumar \cite{Gupta2000The}. On the other hand, if the two nodes with distance $ d $ communicate according to the probability $ d^{-\beta} $, the maximum capacity can reach up to $ \Theta\left(\frac{1}{\log n}\right) $, which exhibits remarkable improvement compared with the well-known result in \cite{Gupta2000The}.

Connected through hyperedge HE-1 (induced by source paper "spatial networks with wireless applications"):
  with members:
    - "boundaries as an enhancement technique for physical layer security"
    - "correlated interference from uncorrelated users in bounded ad hoc networks with blockage"
    - "coverage analysis of a vehicular network modeled as cox process driven by poisson line process"
    - "on the capacity of wireless networks with fractal and hierarchical social communications"
    - "boundaries can enhance physical layer security at high data rates"
    - "temporal correlation of interference in bounded mobile ad hoc networks with blockage"
    - "interference functionals in poisson networks"
    - "wireless fractal cellular networks"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of wireless networks with fractal and hierarchical social communications"):
  with members:
    - "wireless fractal cellular networks"
    - "fundamental limits on throughput capacity in information centric networks"
    - "systematic topology analysis and generation using degree correlations"
    - "capacity and character expansions moment generating function and other exact results for mimo correlated channels"

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)