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: "cascade source coding with a side information vending machine"
  Abstract: The model of a side information "vending machine" (VM) accounts for scenarios in which the measurement of side information sequences can be controlled via the selection of cost-constrained actions. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information VM is available and the intermediate and/or at the end node of the cascade. A single-letter characterization of the achievable trade-off among the transmission rates, the distortions in the reconstructions at the intermediate and at the end node, and the cost for acquiring the side information is derived for a number of relevant special cases. It is shown that a joint design of the description of the source and of the control signals used to guide the selection of the actions at downstream nodes is generally necessary for an efficient use of the available communication links. In particular, for all the considered models, layered coding strategies prove to be optimal, whereby the base layer fulfills two network objectives: determining the actions of downstream nodes and simultaneously providing a coarse description of the source. Design of the optimal coding strategy is shown via examples to depend on both the network topology and the action costs. Examples also illustrate the involved performance trade-offs across the network.

Connected through hyperedge HE-1 (induced by source paper "information embedding on actions"):
  with members:
    - "successive refinement with decoder cooperation and its channel coding duals"
    - "on cascade source coding with a side information vending machine"
    - "on channels with action dependent states"
    - "compression with actions"
    - "on real time coding with limited lookahead"
    - "multi terminal source coding with action dependent side information"
    - "coordination using implicit communication"
    - "distributed and cascade lossy source coding with a side information vending machine"

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"
    - "compression with actions"
    - "multi terminal source coding with action dependent side information"
    - "robust coding for lossy computing with receiver side observation costs"
    - "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"
    - "multi terminal source coding with action dependent side information"
    - "robust coding for lossy computing with receiver side observation costs"
    - "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"

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)