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 and triangular source coding with side information at the first two nodes"
  Abstract: We consider the cascade and triangular rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the rate-distortion region for these problems. For the quadratic Gaussian case, we show that it is sufficient to consider jointly Gaussian distributions, a fact that leads to an explicit solution.

Connected through hyperedge HE-1 (induced by source paper "hypothesis testing over the two hop relay network"):
  with members:
    - "distributed hypothesis testing with concurrent detections"
    - "strong converse for hypothesis testing against independence over a two hop network"
    - "distributed hypothesis testing based on unequal error protection codes"
    - "distributed hypothesis testing over discrete memoryless channels"
    - "on hypothesis testing against independence with multiple decision centers"
    - "universal outlier hypothesis testing"
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "cascade triangular and two way source coding with degraded side information at the second user"

Connected through hyperedge HE-2 (induced by source paper "in network compression for multiterminal cascade mimo systems"):
  with members:
    - "lossy compression for compute and forward in limited backhaul uplink multicell processing"
    - "optimized backhaul compression for uplink cloud radio access network"
    - "multihop backhaul compression for the uplink of cloud radio access networks"
    - "distributed function computation over a rooted directed tree"
    - "robust and efficient distributed compression for cloud radio access networks"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "cascade multiterminal source coding"

Connected through hyperedge HE-3 (induced by source paper "secure cascade channel synthesis"):
  with members:
    - "strong coordination over multi hop line networks"
    - "secrecy in cascade networks"
    - "the likelihood encoder for lossy source compression"
    - "strong coordination over a line network"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "achievability proof via output statistics of random binning"
    - "secure channel simulation"

Connected through hyperedge HE-4 (induced by source paper "successive refinement with decoder cooperation and its channel coding duals"):
  with members:
    - "channel coding and source coding with increased partial side information"
    - "coordination using implicit communication"
    - "multiple access channel with partial and controlled cribbing encoders"
    - "interference channels with destination cooperation"
    - "cascade triangular and two way source coding with degraded side information at the second user"
    - "lecture notes on network information theory"
    - "the compound multiple access channel with partially cooperating encoders"
    - "cascade multiterminal source coding"

Connected through hyperedge HE-5 (induced by source paper "empirical coordination in a triangular multiterminal network"):
  with members:
    - "cascade triangular and two way source coding with degraded side information at the second user"
    - "cascade multiterminal source coding"

Connected through hyperedge HE-6 (induced by source paper "on cooperation in multi terminal computation and rate distortion"):
  with members:
    - "computing a function of correlated sources"
    - "cascade multiterminal source coding"

Connected through hyperedge HE-7 (induced by source paper "optimality and approximate optimality of source channel separation in networks"):
  with members:
    - "separation of source network coding and channel coding in wireline networks"
    - "on the separation of lossy source network coding and channel coding in wireline networks"
    - "cascade multiterminal source coding"
    - "hybrid coding for gaussian broadcast channels with gaussian sources"
    - "approximate characterizations for the gaussian source broadcast distortion region"
    - "multicasting correlated multi source to multi sink over a network"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"
    - "coding into a source a direct inverse rate distortion theorem"

Connected through hyperedge HE-8 (induced by source paper "cascade triangular and two way source coding with degraded side information at the second user"):
  with members:
    - "cascade multiterminal source coding"

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)