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: "on multistage successive refinement for wyner ziv source coding with degraded side informations"
  Abstract: We provide a complete characterization of the rate-distortion region for the multistage successive refinement of the Wyner-Ziv source coding problem with degraded side informations at the decoder. Necessary and sufficient conditions for a source to be successively refinable along a distortion vector are subsequently derived. A source-channel separation theorem is provided when the descriptions are sent over independent channels for the multistage case. Furthermore, we introduce the notion of generalized successive refinability with multiple degraded side informations. This notion captures whether progressive encoding to satisfy multiple distortion constraints for different side informations is as good as encoding without progressive requirement. Necessary and sufficient conditions for generalized successive refinability are given. It is shown that the following two sources are generalized successively refinable: (1) the Gaussian source with degraded Gaussian side informations, (2) the doubly symmetric binary source when the worse side information is a constant. Thus for both cases, the failure of being successively refinable is only due to the inherent uncertainty on which side information will occur at the decoder, but not the progressive encoding requirement.

Connected through hyperedge HE-1 (induced by source paper "vector gaussian successive refinement with degraded side information"):
  with members:
    - "the sum rate of vector gaussian multiple description coding with tree structured covariance distortion constraints"
    - "vector gaussian rate distortion with variable side information"
    - "broadcasting correlated vector gaussians"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "private broadcasting over independent parallel channels"
    - "information theoretic proofs of entropy power inequalities"
    - "secure lossy transmission of vector gaussian sources"
    - "capacity equivocation region of the gaussian mimo wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "exponential strong converse for successive refinement with causal decoder side information"):
  with members:
    - "strong converse using change of measure arguments"
    - "exponential strong converse for content identification with lossy recovery"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "new strong converse for asymmetric broadcast channels"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "exponent function for one helper source coding problem at rates outside the rate region"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"

Connected through hyperedge HE-3 (induced by source paper "rate distortion region of a gray wyner model with side information"):
  with members:
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "source coding problems with conditionally less noisy side information"
    - "rate distortion with side information at many decoders"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "source coding for a simple network with receiver side information"
    - "side information scalable source coding"

Connected through hyperedge HE-4 (induced by source paper "common reconstructions in the successive refinement problem with receiver side information"):
  with members:
    - "vector gaussian rate distortion with variable side information"
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "source coding problems with conditionally less noisy side information"
    - "rate distortion with side information at many decoders"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "side information scalable source coding"

Connected through hyperedge HE-5 (induced by source paper "rate storage regions for massive random access"):
  with members:
    - "cache aided coded multicast for correlated sources"
    - "universal wyner ziv coding for distortion constrained general side information"
    - "fundamental limits of caching"

Connected through hyperedge HE-6 (induced by source paper "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "source coding problems with conditionally less noisy side information"
    - "rate distortion with side information at many decoders"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "multiterminal source coding with complementary delivery"
    - "side information scalable source coding"

Connected through hyperedge HE-7 (induced by source paper "secure multiterminal source coding with side information at the eavesdropper"):
  with members:
    - "rate distortion with side information at many decoders"
    - "information theoretic proofs of entropy power inequalities"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "rate region of the gaussian scalar help vector source coding problem"
    - "secure lossy source coding with side information at the decoders"
    - "construction of wiretap codes from ordinary channel codes"
    - "lecture notes on network information theory"
    - "secure source coding with a helper"

Connected through hyperedge HE-8 (induced by source paper "universal wyner ziv coding for distortion constrained general side information"):
  with members:
    - "channel coding and lossy source coding using a generator of constrained random numbers"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "achievability proof via output statistics of random binning"
    - "reliability in source coding with side information"
    - "rate distortion with side information at many decoders"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "universal source coding over generalized complementary delivery networks"
    - "efficient on line schemes for encoding individual sequences with side information at the decoder"

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)