human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "source coding problems with conditionally less noisy side information"):
  Abstract: A computable expression for the rate-distortion (RD) function proposed by Heegard and Berger has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for \emph{physically degraded} side information; however, it is not known whether the bound is optimal for arbitrarily correlated side information (general discrete memoryless sources). In this paper, we consider a new setup in which the side information at one receiver is \emph{conditionally less noisy} than the side information at the other. The new setup includes degraded side information as a special case, and it is motivated by the literature on degraded and less noisy broadcast channels. Our key contribution is a converse proving the optimality of Heegard and Berger's achievability bound in a new setting. The converse rests upon a certain \emph{single-letterization} lemma, which we prove using an information theoretic telescoping identity {recently presented by Kramer}. We also generalise the above ideas to two different successive-refinement problems.

Includes members:
  Member "secure multiterminal source coding with side information at the eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "rate distortion with side information at many decoders":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed hypothesis testing with concurrent detections")
  Member "the rate distortion function for product of two sources with side information at decoders":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "common reconstructions in the successive refinement problem with receiver side information")
  Member "wyner ziv coding over broadcast channels digital schemes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "noisy broadcast networks with receiver caching")
  Member "source coding for a simple network with receiver side information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement")
  Member "side information scalable source coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "extended gray wyner system with complementary causal side information")
  Member "on multistage successive refinement for wyner ziv source coding with degraded side informations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "vector gaussian successive refinement with degraded side information")

Question: Please tell me which class the source paper 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)