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: "inter operator infrastructure sharing trade offs and market"
  Abstract: We model the problem of infrastructure sharing among mobile network operators (MNOs) as a multiple-seller single-buyer market where the MNOs are able to share their own base stations (BSs) with each other. First, we use techniques from stochastic geometry to find the coverage probability of the infrastructure sharing system and analyze the trade-off between increasing the transmit power of a BS and the BS intensity of a buyer MNO required to achieve a given quality-of-service (QoS) in terms of the coverage probability. We also analyze the power consumption of the network per unit area (i.e., areal power consumption) and show that it is a piecewise continuous function composed of a linear and a convex functions. We show that when the transmit power of the BSs and/or the BS intensity of a network increases, the system becomes interference limited and the coverage probability tends to saturate at a certain value. As such, when the required QoS is set above this bound, an MNO can improve its coverage by buying infrastructure from other MNOs. Subsequently, we analyze the strategy of a buyer MNO on choosing how many MNOs and which MNOs to buy the infrastructure from. The optimal strategy of the buyer is given by greedy fractional knapsack algorithm. On the sellers' side, the pricing and the fraction of infrastructure to be sold are formulated using a Cournot oligopoly game.

Connected through hyperedge HE-1 (induced by source paper "edge caching in delay constrained virtualized cellular networks analysis and market"):
  with members:
    - "infrastructure sharing for mobile network operators analysis of trade offs and market"
    - "pricing and resource allocation via game theory for a small cell video caching system"
    - "caching incentive design in wireless d2d networks a stackelberg game approach"
    - "a stackelberg game for incentive proactive caching mechanisms in wireless networks"
    - "virtualization of 5g cellular networks as a hierarchical combinatorial auction"
    - "integral approximations for coverage probability"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-2 (induced by source paper "on spectrum sharing among micro operators in 5g"):
  with members:
    - "integral approximations for coverage probability"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-3 (induced by source paper "infrastructure sharing for mobile network operators analysis of trade offs and market"):
  with members:
    - "on spectrum sharing among micro operators in 5g"
    - "designing and implementing future aerial communication networks"
    - "on spectrum and infrastructure sharing in multi operator cellular networks"
    - "integral approximations for coverage probability"
    - "soaran a service oriented architecture for radio access network sharing in evolving mobile networks"
    - "a tractable approach to coverage and rate in cellular networks"

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.NI(Networking and Internet Architecture)