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: "a novel time varying coding scheme for the gaussian broadcast channel with feedback"
  Abstract: In this paper, we generalize a coding strategy for the Gaussian broadcast channel with feedback, analyze error probabilities and achievable rate region for this coding strategy by using the iterated random function theory [1], [2], [6]. By changing some parameters in our scheme, we realize a variant of the Ozarow-Leung's code for the general two-user broadcast channel with feedback. A capacity-achieving coding scheme for the degraded broadcast channel with feedback is drawn. More interestingly, we come to a coding scheme for the symmetric Gaussian broadcast channel with feedback which achieves the same sum-rate as the LQG code [18] and strictly outperforms the Kramer code [14]. The fact that our coding scheme is a variant of the Kramer's code or time-varying posterior matching code [1] may give useful information to solve some open problems proposed in [19], [20].

Connected through hyperedge HE-1 (induced by source paper "on the capacity of symmetric gaussian interference channels with feedback"):
  with members:
    - "posterior matching scheme for gaussian multiple access channel with feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "optimal feedback communication via posterior matching"
    - "gaussian interference channel capacity to within one bit"

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)