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: "heegard berger and cascade source coding problems with common reconstruction constraints"
  Abstract: In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications, this may be undesirable, and a common reconstruction (CR) requirement, whereby one imposes that the encoder and decoder be able to agree on the decoder's estimate, may be instead in order. The rate-distortion function under the CR constraint has been derived recently for a point-to-point (Wyner-Ziv) problem. In this paper, this result is extended to three multiterminal settings with three nodes, namely the Heegard-Berger (HB) problem, its variant with cooperating decoders, and the cascade source coding problem. The HB problem consists of an encoder broadcasting to two decoders with respective side information. The cascade source coding problem is characterized by a two-hop system with side information available at the intermediate and final nodes. For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three examples, namely Gaussian source and side information with quadratic distortion metric, and binary source and side information with erasure and Hamming distortion metrics. The rate-distortion function is then characterized for the HB problem with cooperating decoders and (physically) degraded side information. For the cascade problem with the CR constraint, the rate-distortion region is obtained under the assumption that side information at the final node is physically degraded with respect to that at the intermediate node. For the latter two cases, it is worth emphasizing that the corresponding problem without the CR constraint is still open. Outer and inner bounds on the rate-distortion region are also obtained for the cascade problem under the assumption that the side information at the intermediate node is physically degraded with respect to that at the final node. For the three examples mentioned above, the bounds are shown to coincide. Finally, for the HB problem, the rate-distortion function is obtained under the more general requirement of constrained reconstruction, whereby the decoder's estimate must be recovered at the encoder only within some distortion.

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"
    - "cascade and triangular source coding with side information at the first two nodes"
    - "cascade triangular and two way source coding with degraded side information at the second user"

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

Connected through hyperedge HE-3 (induced by source paper "coding with action dependent side information and additional reconstruction requirements"):
  with members:
    - "information embedding on actions"
    - "compression with actions"
    - "mac with action dependent state information at one encoder"
    - "action dependent strictly causal state communication"
    - "robust coding for lossy computing with receiver side observation costs"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "two way source coding with a helper"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-4 (induced by source paper "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"):
  with members:
    - "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"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-5 (induced by source paper "constrained source coding with side information"):
  with members:
    - "interactive function computation with reconstruction constraints"
    - "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"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-6 (induced by source paper "on cascade source coding with a side information vending machine"):
  with members:
    - "cascade source coding with a side information vending machine"
    - "multi terminal source coding with action dependent side information"
    - "robust coding for lossy computing with receiver side observation costs"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "cascade triangular and two way source coding with degraded side information at the second user"
    - "source coding with a side information vending machine"

Connected through hyperedge HE-7 (induced by source paper "cascade source coding with a side information vending machine"):
  with members:
    - "compression with actions"
    - "multi terminal source coding with action dependent side information"
    - "robust coding for lossy computing with receiver side observation costs"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "cascade triangular and two way source coding with degraded side information at the second user"

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)