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 multi access channel an information theoretic perspective"
  Abstract: In a multi-access 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. In this paper, the characterization of the completion time region is based on the concept of constrained rates, where users' rates are defined over possibly different number of channel uses. An information theoretic formulation of completion time is given and the completion time region is then established for two-user Gaussian multi-access channel, which, analogous to capacity region, characterizes all possible trade-offs between users' completion times.

Connected through hyperedge HE-1 (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-2 (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-3 (induced by source paper "latency optimal uplink scheduling policy in training based large scale antenna systems"):
  with members:
    - "optimum transmission through the multiple antenna gaussian multiple access channel"
    - "power allocation schemes for multicell massive mimo systems"
    - "linear precoding based on polynomial expansion large scale multi cell mimo systems"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "energy and spectral efficiency of very large multiuser mimo systems"
    - "optimum transmission policies for battery limited energy harvesting nodes"
    - "training and feedback optimization for multiuser mimo downlink"

Connected through hyperedge HE-4 (induced by source paper "optimum transmission through the multiple antenna gaussian multiple access channel"):
  with members:
    - "fairness in multiuser systems with polymatroid capacity region"
    - "optimal order of decoding for max min fairness in k user memoryless interference channels"

Connected through hyperedge HE-5 (induced by source paper "completion time in broadcast channel and interference channel"):
  with members:
    - "alternating offer bargaining games over the gaussian interference channel"
    - "capacity bounds for the gaussian interference channel"
    - "completion time minimization and robust power control in wireless packet networks"
    - "gaussian interference channel capacity to within one bit"

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)