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 "spatially correlated content caching for device to device communications"):
  Abstract: We study optimal geographic content placement for device-to-device (D2D) networks in which each file's popularity follows the Zipf distribution. The locations of the D2D users (caches) are modeled by a Poisson point process (PPP) and have limited communication range and finite storage. Inspired by the Mat\'{e}rn hard-core (type II) point process that captures pairwise interactions between nodes, we devise a novel spatially correlated caching strategy called {\em hard-core placement} (HCP) such that the D2D nodes caching the same file are never closer to each other than the {\em exclusion radius}. The exclusion radius plays the role of a substitute for caching probability. We derive and optimize the exclusion radii to maximize the {\em hit probability}, which is the probability that a given D2D node can find a desired file at another node's cache within its communication range. Contrasting it with independent content placement, which is used in most prior work, our HCP strategy often yields a significantly higher cache hit probability. We further demonstrate that the HCP strategy is effective for small cache sizes and a small communication radius, which are likely conditions for D2D.

Includes members:
  Member "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "edge caching in dense heterogeneous cellular networks with massive mimo aided self backhaul")
  Member "optimal geographic caching in cellular networks with linear content coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal scheduling of content caching subject to deadline")
  Member "fundamentals of modeling finite wireless networks using binomial point process":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")
  Member "optimizing content caching to maximize the density of successful receptions in device to device networking":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "individual preference aware caching policy design in wireless d2d networks")
  Member "spatial multi lru caching for wireless networks with coverage overlaps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a swiss army knife for dynamic caching in small cell networks")
  Member "placing dynamic content in caches with small population":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online convex optimization for caching networks")
  Member "modeling and performance analysis of clustered device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimizing joint probabilistic caching and channel access for clustered d2d networks")
  Member "optimizing the spatial content caching distribution for device to device communications":
    also connected through other hyperedges:
      (none)

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)