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: "complete interference mitigation through receiver caching in wyner s networks"
  Abstract: We present upper and lower bounds on the per-user multiplexing gain (MG) of Wyner’s circular soft-handoff model and Wyner’s circular full model with cognitive transmitters and receivers with cache memories. The bounds are tight for cache memories with prelog μ ≥ 2 3 D in the soft-handoff model and for μ ≥ D in the full model, where D denotes the number of possibly demanded files. In these cases the per-user MG of the two models is 1+ μ D , the same as for non-interfering point-to-point links with caches at the receivers. Large receiver cache-memories thus allow to completely mitigate interference in these networks.

Connected through hyperedge HE-1 (induced by source paper "wyner s network on caches combining receiver caching with a flexible backhaul"):
  with members:
    - "resolving a feedback bottleneck of multi antenna coded caching"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"
    - "multi antenna coded caching"
    - "cache aided interference management in partially connected wireless networks"
    - "multi server coded caching"
    - "flexible backhaul design and degrees of freedom for linear interference networks"
    - "fundamental limits of caching"

Connected through hyperedge HE-2 (induced by source paper "benefits of cache assignment on degraded broadcast channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "centralized caching and delivery of correlated contents over a gaussian broadcast channel"
    - "broadcast caching networks with two receivers and multiple correlated sources"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "on coded caching in the overloaded miso broadcast channel"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"

Connected through hyperedge HE-3 (induced by source paper "cache aided interference management in partially connected wireless networks"):
  with members:
    - "cache aided fog radio access networks with partial connectivity"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "coded caching in a multi server system with random topology"
    - "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "degrees of freedom of cache aided wireless interference networks"
    - "fundamental storage latency tradeoff in cache aided mimo interference networks"

Connected through hyperedge HE-4 (induced by source paper "wireless coded caching a topological perspective"):
  with members:
    - "information theoretic caching the multi user case"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of cache aided interference management"
    - "multi library coded caching"
    - "effect of number of users in multi level coded caching"
    - "cache enabled broadcast packet erasure channels with state feedback"
    - "cache aided interference channels"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-5 (induced by source paper "on storage allocation in cache enabled interference channels with mixed csit"):
  with members:
    - "fundamental limits of cache aided interference management"
    - "the synergistic gains of coded caching and delayed feedback"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"
    - "cache aided interference channels"
    - "caching at the edge a green perspective for 5g networks"
    - "multi server coded caching"
    - "hierarchical coded caching"
    - "fundamental limits of caching in wireless d2d 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.IT(Information Theory)