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: "source coding with fixed lag side information"
  Abstract: We consider source coding with xed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding with feedforward (the dual of channel coding with feedback) introduced by Pradhan [8]. We use this duality to develop a linear complexity algorithm which achieves the rate-distortion bound for any memoryless nite alphabet source and distortion measure.

Connected through hyperedge HE-1 (induced by source paper "a symbolic dynamical system approach to lossy source coding with feedforward"):
  with members:
    - "lecture notes on network information theory"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-2 (induced by source paper "on evaluating the rate distortion function of sources with feed forward and the capacity of channels with feedback"):
  with members:
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"
    - "coding for the feedback gel fand pinsker channel and the feedforward wyner ziv source"
    - "feedback capacity of the first order moving average gaussian channel"

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)