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: "completion time in broadcast channel and interference channel"
  Abstract: In a multi-user channel, completion time refers to the number of channel uses required for users, each with some given fixed bit pool, to complete the transmission of all their data bits. This paper extends the information theoretic formulation of multi-access completion time to broadcast channel and interference channel, enabling us to obtain the so-called completion time region (CTR), which, analogous to capacity region, characterizes all possible trade-offs between users' completion times. Specifically, for Gaussian broadcast channel (GBC) and Gaussian interference channel (GIC) in the strong/very strong regime, the exact CTR is obtained. For GIC in the weak/mixed regime, an achievable CTR based on the Etkin-Tse-Wang scheme and an outer-bound are obtained.

Connected through hyperedge HE-1 (induced by source paper "cache assisted broadcast relay wireless networks a delivery time cache memory tradeoff"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental limits on latency in transceiver cache aided hetnets"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "waveform and spectrum management for unmanned aerial systems beyond 2025"
    - "cache aided interference management in partially connected wireless networks"
    - "decentralized caching and coded delivery with distinct cache capacities"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"

Connected through hyperedge HE-2 (induced by source paper "fog aided wireless networks for content delivery fundamental latency tradeoffs"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "fundamental limits of cache aided interference management"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "fundamental storage latency tradeoff in cache aided mimo interference networks"
    - "fog computing based radio access networks issues and challenges"
    - "a new converse bound for coded caching"
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "placing dynamic content in caches with small population"

Connected through hyperedge HE-3 (induced by source paper "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"):
  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"
    - "coded caching for a large number of users"
    - "fog computing based radio access networks issues and challenges"
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "backhaul traffic balancing and dynamic content centric clustering for the downlink of fog radio access network"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"

Connected through hyperedge HE-4 (induced by source paper "delivery time minimization in edge caching synergistic benefits of subspace alignment and zero forcing"):
  with members:
    - "fundamental limits on latency in transceiver cache aided hetnets"
    - "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"
    - "waveform and spectrum management for unmanned aerial systems beyond 2025"
    - "fundamental limits of cache aided interference management"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "cache aided interference channels"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "a systematic approach for interference alignment in csit less relay aided x networks"

Connected through hyperedge HE-5 (induced by source paper "cloud and cache aided wireless networks fundamental latency trade offs"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "fog computing based radio access networks issues and challenges"
    - "a new converse bound for coded caching"
    - "placing dynamic content in caches with small population"
    - "on caching with more users than files"
    - "multi library coded caching"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"

Connected through hyperedge HE-6 (induced by source paper "completion time in multi access channel an information theoretic perspective"):
  with members:
    - "completion time minimization and robust power control in wireless packet 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)