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: "distributed joint source channel coding on a multiple access channel with side information"
  Abstract: We consider the problem of transmission of several discrete sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient conditions are provided for transmission of sources with a given distortion. The channel could have continuous alphabets (Gaussian MAC is a special case). Various previous results are obtained as special cases.

Connected through hyperedge HE-1 (induced by source paper "communicating correlated sources over mac and interference channels i separation based schemes"):
  with members:
    - "communicating correlated sources over an interference channel"
    - "broadcasting correlated vector gaussians"
    - "matched multiuser gaussian source channel communications via uncoded schemes"
    - "on joint source channel coding for correlated sources over multiple access relay channels"
    - "an achievable rate distortion region for the multiple descriptions problem"
    - "a new data processing inequality and its applications in distributed source and channel coding"
    - "optimality and approximate optimality of source channel separation in networks"
    - "interference channels with arbitrarily correlated sources"

Connected through hyperedge HE-2 (induced by source paper "hybrid coding an interface for joint source channel coding and network communication"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "on the separation of lossy source network coding and channel coding in wireline networks"
    - "communication to within a fidelity criterion over unknown networks by reduction to reliable communication problems over unknown networks"
    - "optimality and approximate optimality of source channel separation in networks"
    - "the achievable distortion region of bivariate gaussian source on gaussian broadcast channel"
    - "correlated sources over broadcast channels"
    - "wyner ziv coding over broadcast channels digital schemes"
    - "outer bounds on the admissible source region for broadcast channels with dependent sources"

Connected through hyperedge HE-3 (induced by source paper "distributed joint source channel coding for functions over a multiple access channel"):
  with members:
    - "communicating the difference of correlated gaussian sources over a mac"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"
    - "sending a bi variate gaussian source over a gaussian mac"
    - "sending a bi variate gaussian source over a gaussian mac"

Connected through hyperedge HE-4 (induced by source paper "joint source channel coding over a fading multiple access channel with partial channel state information"):
  with members:
    - "sending a bi variate gaussian source over a gaussian mac"
    - "sending a bi variate gaussian source over a gaussian mac"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-5 (induced by source paper "on optimal distributed joint source channel coding for correlated gaussian sources over gaussian channels"):
  with members:
    - "sending a bi variate gaussian source over a gaussian mac"
    - "sending a bi variate gaussian source over a gaussian mac"
    - "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)