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: "structure theorems for real time variable rate coding with and without side information"
  Abstract: The output of a discrete Markov source is to be encoded instantaneously by a variable-rate encoder and decoded by a finite-state decoder. Our performance measure is a linear combination of the distortion and the instantaneous rate. Structure theorems, pertaining to the encoder and next-state functions are derived for every given finite-state decoder, which can have access to side information.

Connected through hyperedge HE-1 (induced by source paper "distortion transmission trade off in real time transmission of markov sources"):
  with members:
    - "optimal strategies for communication and remote estimation with an energy harvesting sensor"
    - "paging and registration in cellular networks jointly optimal policies and an iterative algorithm"

Connected through hyperedge HE-2 (induced by source paper "zero delay and causal single user and multi user lossy source coding with decoder side information"):
  with members:
    - "data processing bounds for scalar lossy source codes with side information at the decoder"
    - "multiterminal source coding under logarithmic loss"
    - "on the statistical physics of directed polymers in a random medium and their relation to tree codes"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-3 (induced by source paper "data processing bounds for scalar lossy source codes with side information at the decoder"):
  with members:
    - "data processing theorems and the second law of thermodynamics"
    - "efficient on line schemes for encoding individual sequences with side information at the decoder"
    - "lattice quantization with side information codes asymptotics and applications in sensor networks"

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)