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: "joint source channel cooperative transmission over relay broadcast networks"
  Abstract: Reliable transmission of a discrete memoryless source over a multiple-relay relay-broadcast network is considered. Motivated by sensor network applications, it is assumed that the relays and the destinations all have access to side information correlated with the underlying source signal. Joint source-channel cooperative transmission is studied in which the relays help the transmission of the source signal to the destinations by using both their overheard signals, as in th e classical channel cooperation scenario, as well as the available correlated side information. Decode-and-forward (DF) based cooperative transmission is considered in a network of multiple relay terminals and two different achievability schemes are proposed: i) a regular encoding and sliding-window decoding scheme without explicit source binning at the encoder, and ii) a semi-regular encoding and backward decoding scheme with binning based on the side information statistics. It is shown that both of these s chemes lead to the same source-channel code rate, which is shown to be the source-channel capacity in the case of i) a physically degraded relay network in which the side information signals are also degraded in the same order as the channel; and ii) a relay-broadcast network in which all the terminals want to reconstruct the source reliably, while at most one of them can act as a relay.

Connected through hyperedge HE-1 (induced by source paper "source channel coding theorems for the multiple access relay channel"):
  with members:
    - "lecture notes on network information theory"
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "interference channels with arbitrarily correlated sources"
    - "capacity gain from two transmitter and two receiver cooperation"
    - "joint source channel codes for mimo block fading channels"

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)