human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "recent results in continuous time network information theory"
  Abstract: In this paper, we propose to use Brownian motions to formulate continuous-time multiuser Gaussian networks and derive the capacity regions of a continuous-time white Gaussian multiple access channel with/without feedback, a continuous-time white Gaussian interference channel without feedback and a continuous-time white Gaussian broadcast channel without feedback. These ``complete'' results stand in stark contrast to the status quo of network information theory in discrete-time, where the capacity regions of the all the above-mentioned channels are known only for a handful of special scenarios. For certain cases, our results echo, from a different perspective, the folklore that ``a continuous-time channel is the limit of bandwidth limited discrete-time ones as the bandwidth tends to infinity''.

Connected through hyperedge HE-1 (induced by source paper "on continuous time gaussian channels"):
  with members:
    - "upper and lower bounds on the capacity of amplitude constrained mimo channels"
    - "wireless network information flow a deterministic approach"
    - "limit theorems in hidden markov models"
    - "directed information causal estimation and communication in continuous time"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "on the gaussian mac with imperfect feedback"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-2 (induced by source paper "capacity regions of families of continuous time multi user gaussian channels"):
  with members:
    - "extensions of the i mmse relation"
    - "wireless network information flow a deterministic approach"
    - "on the gaussian mac with imperfect feedback"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "on the capacity of multiple access channels with state information and feedback"
    - "coding for the feedback gel fand pinsker channel and the feedforward wyner ziv source"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-3 (induced by source paper "extensions of the i mmse relation"):
  with members:
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "mutual information relative entropy and estimation in the poisson channel"
    - "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels"
    - "feedback capacity of stationary gaussian channels"
    - "mutual information and minimum mean square error in gaussian channels"

Question: Please tell me which class the center node 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)