human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on the capacity of fractal d2d social networks with hierarchical communications"):
  Abstract: The maximum capacity of fractal D2D (device-to-device) social networks with both direct and hierarchical communications is studied in this paper. Specifically, the fractal networks are characterized by the direct social connection and the self-similarity. Firstly, for a fractal D2D social network with direct social communications, it is proved that the maximum capacity is $ \Theta\left(\frac{1}{\sqrt{n\log n}}\right) $ if a user communicates with one of his/her direct contacts randomly, where $ n $ denotes the total number of users in the network, and it can reach up to $ \Theta\left(\frac{1}{\log n}\right) $ if any pair of social contacts with distance $ d $ communicate according to the probability in proportion to $ d^{-\beta} $. Secondly, since users might get in touch with others without direct social connections through the inter-connected multiple users, the fractal D2D social network with these hierarchical communications is studied as well, and the related capacity is further derived. Our results show that this capacity is mainly affected by the correlation exponent $\epsilon$ of the fractal structure. The capacity is reduced in proportional to $ \frac{1}{\log n} $ if $ 2 3 $.

Includes members:
  Member "not call me cellular any more the emergence of scaling law fractal patterns and small world in wireless networks":
    also connected through other hyperedges:
      (none)
  Member "wireless fractal cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a novel jt comp scheme in 5g fractal small cell networks")
  Member "fundamental limits on throughput capacity in information centric networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cache optimization models and algorithms")
  Member "network capacity region and minimum energy function for a delay tolerant mobile ad hoc network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on performance modeling for manets under general limited buffer constraint")
  Member "systematic topology analysis and generation using degree correlations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "recent advances in scalable network generation")
  Member "evaluating mobility pattern space routing for dtns":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interest aware delivery for mobile social networks a trace driven approach")
  Member "capacity and character expansions moment generating function and other exact results for mimo correlated channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "artificial noisy mimo systems under correlated scattering rayleigh fading a physical layer security approach")

Question: Please tell me which class the source paper 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)