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: "multi user coverage probability of uplink cellular systems a stochastic geometry approach"
  Abstract: We analyze the coverage probability of multi-user uplink cellular networks with fractional power control. We use a stochastic geometry approach where the mobile users are distributed as a Poisson Point Process (PPP), whereas the serving base station (BS) is placed at the origin. Using conditional thinning, we are able to calculate the coverage probability of $k$ users which are allocated a set of orthogonal resources in the cell of interest, obtaining analytical expressions for this probability considering their respective distances to the serving BS. These expressions give useful insights on the interplay between the power control policy, the interference level and the degree of fairness among different users in the system.

Connected through hyperedge HE-1 (induced by source paper "achieving spatial scalability for coded caching over wireless networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching in a multi server system with random topology"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "wireless caching technical misconceptions and business barriers"

Connected through hyperedge HE-2 (induced by source paper "on muting mobile terminals for uplink interference mitigation in hetnets system level analysis via stochastic geometry"):
  with members:
    - "analytical modeling of interference aware power control for the uplink of heterogeneous cellular networks"
    - "the intensity matching approach a tractable stochastic geometry approximation to system level analysis of cellular networks"
    - "optimizing user association and spectrum allocation in hetnets a utility perspective"
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"
    - "joint rate and sinr coverage analysis for decoupled uplink downlink biased cell associations in hetnets"
    - "downlink and uplink decoupling a disruptive architectural design for 5g networks"
    - "on association cells in random heterogeneous networks"
    - "downlink rate distribution in heterogeneous cellular networks under generalized cell selection"

Connected through hyperedge HE-3 (induced by source paper "analytical modeling of interference aware power control for the uplink of heterogeneous cellular networks"):
  with members:
    - "the intensity matching approach a tractable stochastic geometry approximation to system level analysis of cellular networks"
    - "analysis of the decoupled access for downlink and uplink in wireless heterogeneous networks"
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"
    - "joint rate and sinr coverage analysis for decoupled uplink downlink biased cell associations in hetnets"
    - "downlink and uplink decoupling a disruptive architectural design for 5g networks"
    - "on association cells in random heterogeneous networks"
    - "average rate of downlink heterogeneous cellular networks over generalized fading channels a stochastic geometry approach"
    - "downlink rate distribution in heterogeneous cellular networks under generalized cell selection"

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)