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: "side information scalable source coding"
  Abstract: The problem of side-information scalable (SI-scalable) source coding is considered in this work, where the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the bitstream and reconstruct in the rate distortion sense, while the receiver with low quality side information will have to receive further data in order to decode. We provide inner and outer bounds for general discrete memoryless sources. The achievable region is shown to be tight for the case that either of the decoders requires a lossless reconstruction, as well as the case with degraded deterministic distortion measures. Furthermore we show that the gap between the achievable region and the outer bounds can be bounded by a constant when square error distortion measure is used. The notion of perfectly scalable coding is introduced as both the stages operate on the Wyner-Ziv bound, and necessary and sufficient conditions are given for sources satisfying a mild support condition. Using SI-scalable coding and successive refinement Wyner-Ziv coding as basic building blocks, a complete characterization is provided for the important quadratic Gaussian source with multiple jointly Gaussian side-informations, where the side information quality does not have to be monotonic along the scalable coding order. Partial result is provided for the doubly symmetric binary source with Hamming distortion when the worse side information is a constant, for which one of the outer bound is strictly tighter than the other one.

Connected through hyperedge HE-1 (induced by source paper "extended gray wyner system with complementary causal side information"):
  with members:
    - "strong functional representation lemma and applications to coding theorems"
    - "synergy redundancy and common information"
    - "notes on information theoretic privacy"
    - "assisted common information with an application to secure two party sampling"
    - "tension bounds for information complexity"
    - "from the information bottleneck to the privacy funnel"
    - "distributed channel synthesis"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"

Connected through hyperedge HE-2 (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"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-3 (induced by source paper "information theoretic caching sequential coding for computing"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "a new converse bound for coded caching"
    - "a rate distortion approach to caching"
    - "content caching and delivery over heterogeneous wireless networks"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "fundamental limits of caching with secure delivery"
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "coded caching for delay sensitive content"

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"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-5 (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"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-6 (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-7 (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"

Connected through hyperedge HE-8 (induced by source paper "source coding problems with conditionally less noisy side information"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "rate distortion with side information at many decoders"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "wyner ziv coding over broadcast channels digital schemes"
    - "source coding for a simple network with receiver side information"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

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)