human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "complex field trainable ista for linear and nonlinear inverse problems"):
  Abstract: Complex-field signal recovery problems from noisy linear/nonlinear measurements appear in many areas of signal processing and wireless communications. In this paper, we propose a trainable iterative signal recovery algorithm named complex-field TISTA (C-TISTA) which treats complex-field nonlinear inverse problems. C-TISTA is based on the concept of deep unfolding and consists of a gradient descent step with the Wirtinger derivatives followed by a shrinkage step with a trainable complex-valued shrinkage function. Importantly, it contains a small number of trainable parameters so that its training process can be executed efficiently. Numerical results indicate that C-TISTA shows remarkable signal recovery performance compared with existing algorithms.

Includes members:
  Member "trainable ista for sparse signal recovery":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent")
  Member "model driven deep learning for joint mimo channel estimation and signal detection":
    also connected through other hyperedges:
      (none)
  Member "deep learning aided trainable projected gradient decoding for ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent")
  Member "trainable projected gradient detector for massive overloaded mimo channels data driven tuning approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent")
  Member "learning to decode linear codes using deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a deep learning framework for optimization of miso downlink beamforming")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "asymptotic analysis of complex lasso via complex approximate message passing camp":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal errors and phase transitions in high dimensional generalized linear models")
  Member "message passing algorithms for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

Question: Please tell me which class the source paper 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)