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 "on the optimal stacking of noisy observations"):
  Abstract: Observations where additive noise is present can for many models be grouped into a compound observation matrix, adhering to the same type of model. There are many ways the observations can be stacked, for instance vertically, horizontally, or quadratically. An estimator for the spectrum of the underlying model can be formulated for each stacking scenario in the case of Gaussian noise. We compare these spectrum estimators for the different stacking scenarios, and show that all kinds of stacking actually decreases the variance when compared to just taking an average of the observations. We show that, regardless of the number of observations, the variance of the estimator is smallest when the compound observation matrix is made as square as possible. When the number of observations grow, however, it is shown that the difference between the estimators is marginal: Two stacking scenarios where the number of columns and rows grow to infinity are shown to have the same variance asymptotically, even if the asymptotic matrix aspect ratios differ. Only the cases of vertical and horizontal stackings display different behaviour, giving a higher variance asymptotically. Models where not all kinds of stackings are possible are also discussed.

Includes members:
  Member "finite dimensional statistical inference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "signal processing in large systems a new paradigm")
  Member "channel capacity estimation using free probability theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "convolution operations arising from vandermonde matrices")

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)