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: "two way source coding with a helper"
  Abstract: Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions where a Markov form (Helper)-(User 1)-(User 2) holds. The main insight of the result is that in order to achieve the optimal rate, the helper may use a binning scheme, as in Wyner-Ziv, where the side information at the decoder is the "further" user, namely, User 2. We derive these regions explicitly for the Gaussian sources with square error distortion, analyze a trade-off between the rate from the helper and the rate from the source, and examine a special case where the helper has the freedom to send different messages, at different rates, to the encoder and the decoder.

Connected through hyperedge HE-1 (induced by source paper "adaptive coding for two way lossy source channel communication"):
  with members:
    - "joint source channel coding for the transmission of correlated sources over two way channels"
    - "lossy transmission of correlated sources over two way channels"

Connected through hyperedge HE-2 (induced by source paper "cooperative binning for semi deterministic channels with non causal state information"):
  with members:
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "cooperative binning for semideterministic channels"
    - "capacity of a class of state dependent orthogonal relay channels"
    - "multiple access channels with combined cooperation and partial cribbing"
    - "bounds on the capacity of the relay channel with noncausal state at source"

Connected through hyperedge HE-3 (induced by source paper "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"):
  with members:
    - "empirical coordination in a triangular multiterminal network"
    - "successive refinement with decoder cooperation and its channel coding duals"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "mac with action dependent state information at one encoder"
    - "the state dependent semideterministic broadcast channel"
    - "multiterminal source coding under logarithmic loss"
    - "the compound multiple access channel with partially cooperating encoders"
    - "compound multiple access channels with partial cooperation"

Connected through hyperedge HE-4 (induced by source paper "collaborative information bottleneck"):
  with members:
    - "distributed binary detection with lossy data compression"
    - "distributed information theoretic biclustering"
    - "the three terminal interactive lossy source coding problem"
    - "deep learning with elastic averaging sgd"
    - "representation learning a review and new perspectives"
    - "multiterminal source coding under logarithmic loss"
    - "information theoretic proofs of entropy power inequalities"
    - "cascade triangular and two way source coding with degraded side information at the second user"

Connected through hyperedge HE-5 (induced by source paper "collaborative representation learning"):
  with members:
    - "distributed information theoretic biclustering"
    - "the three terminal interactive lossy source coding problem"
    - "deep learning with elastic averaging sgd"
    - "representation learning a review and new perspectives"
    - "information theoretic proofs of entropy power inequalities"
    - "cascade triangular and two way source coding with degraded side information at the second user"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-6 (induced by source paper "function computation through a bidirectional relay"):
  with members:
    - "structural properties of index coding capacity using fractional graph theory"
    - "an equivalence between network coding and index coding"
    - "index coding an interference alignment perspective"
    - "on network coding for sum networks"
    - "network coding is zero error always possible"
    - "optimal function computation in directed and undirected graphs"
    - "universal coding for correlated sources with complementary delivery"

Connected through hyperedge HE-7 (induced by source paper "coding with action dependent side information and additional reconstruction requirements"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "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"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-8 (induced by source paper "the three terminal interactive lossy source coding problem"):
  with members:
    - "diffusion lms over multitask networks"
    - "distributed estimation in multi agent networks"
    - "rate distortion with side information at many decoders"
    - "interaction strictly improves the wyner ziv rate distortion function"
    - "rate region of the quadratic gaussian two encoder source coding problem"

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)