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: "on joint source channel coding for correlated sources over multiple access relay channels"
  Abstract: We study the transmission of correlated sources over discrete memoryless (DM) multiple-access-relay channels (MARCs), in which both the relay and the destination have access to side information arbitrarily correlated with the sources. As the optimal transmission scheme is an open problem, in this work we propose a new joint sourcechannel coding scheme based on a novel combination of the correlation preserving mapping (CPM) technique with Slepian-Wolf (SW) source coding, and obtain the corresponding sufficient conditions. The proposed coding scheme is based on the decode-and-forward strategy, and utilizes CPM for encoding information simultaneously to the relay and the destination, whereas the cooperation information from the relay is encoded via SW source coding. It is shown that there are cases in which the new scheme strictly outperforms the schemes available in the literature. This is the first instance of a source-channel code that uses CPM for enco ding information to two different nodes (relay and destination). In addition to sufficient conditions, we pres ent three different sets of single-letter necessary condit ions for reliable transmission of correlated sources over DM MARCs. The newly derived conditions are shown to be at least as tight as the previously known necessary conditions.

Connected through hyperedge HE-1 (induced by source paper "communicating correlated sources over an interference channel"):
  with members:
    - "a source channel separation theorem with application to the source broadcast problem"
    - "communicating correlated sources over a mac in the absence of a g acs k orner common part"
    - "interference channels with arbitrarily correlated sources"

Connected through hyperedge HE-2 (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"
    - "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"
    - "distributed joint source channel coding on a multiple access channel with side information"

Connected through hyperedge HE-3 (induced by source paper "on transmitting correlated sources over a mac"):
  with members:
    - "matched multiuser gaussian source channel communications via uncoded schemes"
    - "interference channels with arbitrarily correlated sources"

Connected through hyperedge HE-4 (induced by source paper "time asynchronous gaussian multiple access relay channel with correlated sources"):
  with members:
    - "asynchronous transmission over single user state dependent channels"
    - "source channel coding theorems for the multiple access relay channel"
    - "optimality and approximate optimality of source channel separation in networks"
    - "communication under strong asynchronism"

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)