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: "robust coding for lossy computing with receiver side observation costs"
  Abstract: An encoder wishes to minimize the bit rate necessary to guarantee that a decoder is able to calculate a symbolwise function of a sequence available only at the encoder and a sequence that can be measured only at the decoder. This classical problem, first studied by Yamamoto, is addressed here by including two new aspects: (i) The decoder obtains noisy measurements of its sequence, where the quality of such measurements can be controlled via a cost-constrained "action" sequence; (ii) Measurement at the decoder may fail in a way that is unpredictable to the encoder, thus requiring robust encoding. The considered scenario generalizes known settings such as the Heegard-Berger-Kaspi and the "source coding with a vending machine" problems. The rate-distortion-cost function is derived and numerical examples are also worked out to obtain further insight into the optimal system design.

Connected through hyperedge HE-1 (induced by source paper "coding with action dependent side information and additional reconstruction requirements"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "information embedding on actions"
    - "compression with actions"
    - "mac with action dependent state information at one encoder"
    - "action dependent strictly causal state communication"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "two way source coding with a helper"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-2 (induced by source paper "two way communication with adaptive data acquisition"):
  with members:
    - "coding with action dependent side information and additional reconstruction requirements"
    - "cascade source coding with a side information vending machine"
    - "compression with actions"
    - "multi terminal source coding with action dependent side information"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "source coding with a side information vending machine"
    - "two way source coding with a helper"

Connected through hyperedge HE-3 (induced by source paper "on cascade source coding with a side information vending machine"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "cascade source coding with a side information vending machine"
    - "multi terminal source coding with action dependent side information"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "cascade triangular and two way source coding with degraded side information at the second user"
    - "source coding with a side information vending machine"

Connected through hyperedge HE-4 (induced by source paper "cascade source coding with a side information vending machine"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "compression with actions"
    - "multi terminal source coding with action dependent side information"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "cascade triangular and two way source coding with degraded side information at the second user"

Connected through hyperedge HE-5 (induced by source paper "distributed and cascade lossy source coding with a side information vending machine"):
  with members:
    - "on real time coding with limited lookahead"
    - "multi terminal source coding with action dependent side information"
    - "source coding with a side information vending machine"
    - "alphabet sizes of auxiliary random variables in canonical inner bounds"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

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)