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 "a tractable analysis of the improvement in unique localizability through collaboration"):
  Abstract: In this paper, we mathematically characterize the improvement in device localizability achieved by allowing collaboration among devices. Depending on the detection sensitivity of the receivers in the devices, it is not unusual for a device to be localized to lack a sufficient number of detectable positioning signals from localized devices to determine its location without ambiguity (i.e., to be uniquely localizable). This occurrence is well-known to be a limiting factor in localization performance, especially in communications systems. In cellular positioning, for example, cellular network designers call this the hearability problem. We study the conditions required for unique localizability and use tools from stochastic geometry to derive accurate analytic expressions for the probabilities of meeting these conditions in the noncollaborative and collaborative cases. We consider the scenario without shadowing, the scenario with shadowing and universal frequency reuse, and, finally, the shadowing scenario with random frequency reuse. The results from the latter scenario, which apply particularly to cellular networks, reveal that collaboration between two devices separated by only a short distance yields drastic improvements in both devices' abilities to uniquely determine their positions. The results from this analysis are very promising and motivate delving further into techniques which enhance cellular positioning with small-scale collaborative ranging observations among nearby devices.

Includes members:
  Member "towards a tractable analysis of localization fundamentals in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on jamming against wireless networks")
  Member "sinr based k coverage probability in cellular networks with arbitrary shadowing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sir meta distribution of k tier downlink heterogeneous cellular networks with cell range expansion")
  Member "analytical modeling of uplink cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic tdd interference analysis in macro cell and small cell deployments")
  Member "modeling and analysis of k tier downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "fundamental limits of wideband localization part ii cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "peregrine network localization and navigation with scalable inference and efficient operation")
  Member "connectivity of heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on simultaneous percolation with two disk types")
  Member "connection between system parameters and localization probability in network of randomly distributed nodes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "towards a tractable analysis of localization fundamentals in cellular networks")

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)