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: "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.

Connected through hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication"):
  with members:
    - "private authentication with physical identifiers through broadcast channel measurements"
    - "controllable identifier measurements for private authentication with secret keys"
    - "secure and reliable key agreement with physical unclonable functions"
    - "coding for positive rate in the source model key agreement problem"
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "privacy secrecy and storage with multiple noisy measurements of identifiers"
    - "converses for secret key agreement and secure computing"
    - "polar coding for secret key generation"

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

Connected through hyperedge HE-5 (induced by source paper "lp bounds for rate distortion with variable 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"
    - "a rate distortion approach to index coding"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "index coding via linear programming"

Connected through hyperedge HE-6 (induced by source paper "vector gaussian rate distortion with variable side information"):
  with members:
    - "a rate distortion approach to index coding"
    - "rate distortion with side information at many decoders"
    - "the rate distortion function for product of two sources with side information at decoders"

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

Connected through hyperedge HE-8 (induced by source paper "a rate distortion approach to index coding"):
  with members:
    - "vector gaussian rate distortion with variable side information"
    - "graph theory versus minimum rank for index coding"
    - "on the capacity region for index coding"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "local graph coloring and index coding"
    - "fundamental limits of caching"
    - "index coding an interference alignment perspective"
    - "dynamic index coding for wireless broadcast networks"

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)