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 "new approach to bayesian high dimensional linear regression"):
  Abstract: Consider the problem of estimating parameters $X^n \in \mathbb{R}^n $, generated by a stationary process, from $m$ response variables $Y^m = AX^n+Z^m$, under the assumption that the distribution of $X^n$ is known. This is the most general version of the Bayesian linear regression problem. The lack of computationally feasible algorithms that can employ generic prior distributions and provide a good estimate of $X^n$ has limited the set of distributions researchers use to model the data. In this paper, a new scheme called Q-MAP is proposed. The new method has the following properties: (i) It has similarities to the popular MAP estimation under the noiseless setting. (ii) In the noiseless setting, it achieves the "asymptotically optimal performance" when $X^n$ has independent and identically distributed components. (iii) It scales favorably with the dimensions of the problem and therefore is applicable to high-dimensional setups. (iv) The solution of the Q-MAP optimization can be found via a proposed iterative algorithm which is provably robust to the error (noise) in the response variables.

Includes members:
  Member "universal compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the compressibility of affinely singular random vectors")
  Member "minimum complexity pursuit for universal compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "solving inverse problems via auto encoders")
  Member "lossy compression of discrete sources via the viterbi algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "theoretical links between universal and bayesian compressed sensing algorithms")
  Member "compressive imaging using approximate message passing and a markov tree prior":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity optimality of amp in coded systems")
  Member "iterative hard thresholding for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")
  Member "randomly spread cdma asymptotics via statistical physics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")

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)