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 continuous time gaussian channels"):
  Abstract: We establish natural connections between continuous-time Gaussian feedback/memory channels and their associated discrete-time versions in the forms of sampling and approximating theorems. It turns out that these connections, together with relevant tools from stochastic calculus, can enhance our understanding of continuous-time Gaussian channels in terms of giving alternative interpretations to some long-held "folklores", recovering known results from new perspectives, and obtaining new results inspired by the insights and ideas that come along with the connections. In particular, we derive the capacity regions of a continuous-time white Gaussian multiple access channel, a continuous-time white Gaussian interference channel, and a continuous-time white Gaussian broadcast channel, furthermore, applying the the sampling and approximating theorems and the ideas and techniques in their proofs, we analyze how feedback affects the capacity regions of families of continuous-time multi-user one-hop Gaussian channels: feedback will increase the capacity regions of some continuous-time white Gaussian broadcast and interference channels, while it will not increase capacity regions of continuous-time white Gaussian multiple access channels.

Includes members:
  Member "upper and lower bounds on the capacity of amplitude constrained mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the capacity achieving distribution for the amplitude constrained additive gaussian channel an upper bound on the number of mass points")
  Member "recent results in continuous time network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity regions of families of continuous time multi user gaussian channels")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "limit theorems in hidden markov models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a randomized approach to the capacity of finite state channels")
  Member "directed information causal estimation and communication in continuous time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generic variance bounds on estimation and prediction errors in time series analysis an entropy perspective")
  Member "feedback capacity of the gaussian interference channel to within 2 bits":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity limits of full duplex cellular network")
  Member "on the gaussian mac with imperfect feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sum rate capacity for symmetric gaussian multiple access channels with feedback")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "vector gaussian successive refinement with degraded side information")

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)