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 "layered synthesis of latent gaussian trees"):
  Abstract: A new successive encoding scheme is proposed to effectively generate a random vector with prescribed joint density that induces a latent Gaussian tree structure. We prove the accuracy of such encoding scheme in terms of vanishing total variation distance between the synthesized and desired statistics. The encoding algorithm relies on the learned structure of tree to use minimal number of common random variables to synthesize the desired density, with compact modeling complexity. We characterize the achievable rate region for the rate tuples of multi-layer latent Gaussian tree, through which the number of bits needed to simulate such Gaussian joint density are determined. The random sources used in our algorithm are the latent variables at the top layer of tree along with Bernoulli sign inputs, which capture the correlation signs between the variables. In latent Gaussian trees the pairwise correlation signs between the variables are intrinsically unrecoverable. Such information is vital since it completely determines the direction in which two variables are associated. Given the derived achievable rate region for synthesis of latent Gaussian trees, we also quantify the amount of information loss due to unrecoverable sign information. It is shown that maximizing the achievable rate-region is equivalent to finding the worst case density for Bernoulli sign inputs where maximum amount of sign information is lost.

Includes members:
  Member "synthesis of gaussian trees with correlation sign ambiguity an information theoretic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "successive synthesis of latent gaussian trees")
  Member "distributed simulation of continuous random variables":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constrained functional value under general convexity conditions with applications to distributed simulation")
  Member "chernoff information of bottleneck gaussian trees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "successive synthesis of latent gaussian trees")
  Member "gaussian secure source coding and wyner s common information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "common information components analysis")
  Member "a survey on latent tree models and applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "latent factor analysis of gaussian distributions under graphical constraints")

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)