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: "caching in wireless networks"
  Abstract: We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^n-dimensional caching capacity region of the wireless network. We provide an inner bound on this caching capacity region, and, in the high path-loss regime, a matching (in the scaling sense) outer bound. For large path-loss exponent, this provides an information-theoretic scaling characterization of the entire caching capacity region. The proposed communication scheme achieving the inner bound shows that the problems of cache selection and channel coding can be solved separately without loss of order-optimality. On the other hand, our results show that the common architecture of nearest-neighbor cache selection can be arbitrarily bad, implying that cache selection and load balancing need to be performed jointly.

Connected through hyperedge HE-1 (induced by source paper "cache optimization models and algorithms"):
  with members:
    - "learning to cache with no regrets"
    - "introduction to online convex optimization"
    - "cabaret leveraging recommendation systems for mobile edge caching"
    - "optimal and scalable caching for 5g using reinforcement learning of space time popularities"
    - "competitive caching with machine learned advice"
    - "online convex optimization and no regret learning algorithms guarantees and applications"
    - "show me the cache optimizing cache friendly recommendations for sequential content access"
    - "a reinforcement learning approach to proactive caching in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "private information retrieval from a cellular network with caching at the edge"):
  with members:
    - "converse for multi server single message pir with side information"
    - "the capacity of private information retrieval from decentralized uncoded caching databases"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "cache aided private information retrieval with partially known uncoded prefetching fundamental limits"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"

Connected through hyperedge HE-3 (induced by source paper "caching with time varying popularity profiles a learning theoretic perspective"):
  with members:
    - "ultra dense edge caching under spatio temporal demand and network dynamics"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "caching policy for cache enabled d2d communications by learning user preference"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "wireless content caching for small cell and d2d networks"
    - "a transfer learning approach for cache enabled wireless networks"
    - "efficient scheduling and power allocation for d2d assisted wireless caching networks"
    - "learning based optimization of cache content in a small cell base station"

Connected through hyperedge HE-4 (induced by source paper "interference networks with caches at both ends"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "degrees of freedom of cache aided wireless interference networks"
    - "fundamental limits of cache aided interference management"
    - "fundamental storage latency tradeoff in cache aided mimo interference networks"
    - "decentralized coded caching with distinct cache capacities"
    - "wireless content caching for small cell and d2d networks"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "cache aided interference channels"

Connected through hyperedge HE-5 (induced by source paper "effect of bursty traffic on caching helpers a simple scenario"):
  with members:
    - "wireless caching technical misconceptions and business barriers"
    - "wireless content caching for small cell and d2d networks"
    - "fundamental limits of caching in wireless d2d networks"

Connected through hyperedge HE-6 (induced by source paper "feedback aided coded caching for the miso bc with small caches"):
  with members:
    - "optimal sum dof of the k user miso bc with current and delayed feedback"
    - "the synergistic gains of coded caching and delayed feedback"
    - "information theoretic caching sequential coding for computing"
    - "joint cache channel coding over erasure broadcast channels"
    - "critical database size for effective caching"
    - "on the benefits of edge caching for mimo interference alignment"
    - "finite length analysis of caching aided coded multicasting"
    - "a transfer learning approach for cache enabled wireless networks"

Connected through hyperedge HE-7 (induced by source paper "cache induced hierarchical cooperation in wireless device to device caching networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks"
    - "fundamental limits of cache aided interference management"
    - "caching in wireless multihop device to device networks"
    - "on fundamental trade offs of device to device communications in large wireless networks"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"
    - "caching and coded multicasting multiple groupcast index coding"
    - "hierarchical coded caching"

Connected through hyperedge HE-8 (induced by source paper "a learning based approach to caching in heterogenous small cell networks"):
  with members:
    - "caching with unknown popularity profiles in small cell networks"
    - "analysis on cache enabled wireless heterogeneous networks"
    - "a transfer learning approach for cache enabled wireless networks"
    - "efficient scheduling and power allocation for d2d assisted wireless caching networks"
    - "modeling and analysis of content caching in wireless small cell networks"
    - "hierarchical coded caching"
    - "mobicacher mobility aware content caching in small cell networks"
    - "learning based optimization of cache content in a small cell base station"

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)