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 distributed auction policy for user association in device to device caching networks"):
  Abstract: We propose a distributed bidding-aided Matern carrier sense multiple access (CSMA) policy for device-to-device (D2D) content distribution. The network is composed of D2D receivers and potential D2D transmitters, i.e., transmitters are turned on or off by the scheduling algorithm. Each D2D receiver determines the value of its request, by bidding on the set of potential transmitters in its communication range. Given a medium access probability, a fraction of the potential transmitters are jointly scheduled, i.e., turned on, determined jointly by the auction policy and the power control scheme. The bidding-aided scheduling algorithm exploits (i) the local demand distribution, (ii) spatial distribution of D2D node locations, and (iii) the cache configurations of the potential transmitters. We contrast the performance of the bidding-aided CSMA policy with other well-known CSMA schemes that do not take into account (i)-(iii), demonstrate that our algorithm achieves a higher spectral efficiency in terms of the number of bits transmitted per unit time per unit bandwidth per user. The gain becomes even more visible under randomized configurations and requests rather than more skewed placement configurations and deterministic demand distributions.

Includes members:
  Member "optimal caching and scheduling for cache enabled d2d communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimizing joint probabilistic caching and channel access for clustered d2d networks")
  Member "fair distributed user traffic association in cache equipped cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal cache leasing from a mobile network operator to a content provider")
  Member "proximity aware balanced allocations in cache networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "storage communication and load balancing trade off in distributed cache networks")
  Member "gibbsian on line distributed content caching strategy for cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimization of caching devices with geometric constraints")
  Member "power control for d2d underlaid cellular networks modeling algorithms and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "offloading in heterogeneous networks modeling analysis and design insights":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "mean interference in hard core wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna 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)