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: "channels with cooperation links that may be absent"
  Abstract: It is well known that cooperation between users in a communication network can lead to significant performance gains. A common assumption in past works is that all the users are aware of the resources available for cooperation, and know exactly to what extent these resources can be used. Unfortunately, in many modern communication networks the availability of cooperation links cannot be guaranteed a priori, due to the dynamic nature of the network. In this work a family of models is suggested where the cooperation links may or may not be present. Coding schemes are devised that exploit the cooperation links if they are present, and can still operate (although at reduced rates) if cooperation is not possible.

Connected through hyperedge HE-1 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding"
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "on the synergistic benefits of alternating csit for the miso bc"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"

Connected through hyperedge HE-2 (induced by source paper "multiplexing gain region of sectorized cellular networks with mixed delay constraints"):
  with members:
    - "resource allocation for multi user downlink urllc ofdma systems"
    - "non orthogonal multiplexing of ultra reliable and broadband services in fog radio architectures"
    - "coexistence of urllc and embb services in the c ran uplink an information theoretic study"
    - "layered uplink transmission in clustered cellular networks"
    - "optimal dynamic resource allocation for multi antenna broadcasting with heterogeneous delay constrained traffic"

Connected through hyperedge HE-3 (induced by source paper "sparse phase retrieval via truncated amplitude flow"):
  with members:
    - "sublinear time algorithms for compressive phase retrieval"
    - "fundamental limits of phasemax for phase retrieval a replica analysis"
    - "undersampled sparse phase retrieval via majorization minimization"
    - "scalable solvers of random quadratic equations via stochastic truncated amplitude flow"
    - "structured signal recovery from quadratic measurements breaking sample complexity barriers via nonconvex optimization"
    - "low rank positive semidefinite matrix recovery from corrupted rank one measurements"
    - "non convex phase retrieval from stft measurements"
    - "phase retrieval using feasible point pursuit algorithms and cramer rao bound"

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)