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 "admm based decoder for binary linear codes aided by deep learning"):
  Abstract: Inspired by the recent advances in deep learning (DL), this work presents a deep neural network aided decoding algorithm for binary linear codes. Based on the concept of deep unfolding, we design a decoding network by unfolding the alternating direction method of multipliers (ADMM)-penalized decoder. In addition, we propose two improved versions of the proposed network. The first one transforms the penalty parameter into a set of iteration-dependent ones, and the second one adopts a specially designed penalty function, which is based on a piecewise linear function with adjustable slopes. Numerical results show that the resulting DL-aided decoders outperform the original ADMM-penalized decoder for various low density parity check (LDPC) codes with similar computational complexity.

Includes members:
  Member "deep learning methods for improved decoding of linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "perm2vec graph permutation selection for decoding of error correction codes using self attention")
  Member "amp inspired deep networks for sparse linear inverse problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent")
  Member "the admm penalized decoder for ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "deep unfolding model based inspiration of novel deep architectures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent")
  Member "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "decomposition methods for large scale lp decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a reduced complexity projection algorithm for admm based lp 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)