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: "source channel coding theorems for the multiple access relay channel"
  Abstract: We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources, while in MABRCs, both the relay and the destination want to reconstruct them. In addition to arbitrary correlation among the source signals at the users, both the relay and the destination have side information correlated with the source signals. Our objective is to determine whether a given pair of sources can be losslessly transmitted to the destination for a given number of channel symbols per source sample, defined as the source-channel rate. Sufficient conditions for reliable communication based on operational separation, as well as necessary conditions on the achievable source-channel rates are characterized. Since operational separation is generally not optimal for MARCs and MABRCs, sufficient conditions for reliable communication using joint source-channel coding schemes based on a combination of the correlation preserving mapping technique with Slepian-Wolf source coding are also derived. For correlated sources transmitted over fading Gaussian MARCs and MABRCs, we present conditions under which separation (i.e., separate and stand-alone source and channel codes) is optimal. This is the first time optimality of separation is proved for MARCs and MABRCs.

Connected through hyperedge HE-1 (induced by source paper "the secrecy capacity of gaussian mimo channels with finite memory full version"):
  with members:
    - "on the capacity of narrowband plc channels"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "full rank solutions for the mimo gaussian wiretap channel with an average power constraint"
    - "private broadcasting over independent parallel channels"
    - "for the grid and through the grid the role of power line communications in the smart grid"
    - "secured communication over frequency selective fading channels a practical vandermonde precoding"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the capacity region of the degraded finite state broadcast channel"

Connected through hyperedge HE-2 (induced by source paper "on the energy distortion tradeoff of gaussian broadcast channels with feedback"):
  with members:
    - "on the ozarow leung scheme for the gaussian broadcast channel with feedback"
    - "interactive schemes for the awgn channel with noisy feedback"
    - "insufficiency of linear feedback schemes in gaussian broadcast channels with common message"
    - "mimo mac bc duality with linear feedback coding schemes"
    - "lqg control approach to gaussian broadcast channels with feedback"
    - "optimality and approximate optimality of source channel separation in networks"
    - "variations on a theme by schalkwijk and kailath"
    - "sending a bivariate gaussian source over a gaussian mac with feedback"

Connected through hyperedge HE-3 (induced by source paper "joint source channel coding for broadcast channel with cooperating receivers"):
  with members:
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "interference channels with arbitrarily correlated sources"
    - "rate regions for relay broadcast channels"
    - "broadcast channels with cooperating decoders"

Connected through hyperedge HE-4 (induced by source paper "spatially coupled ldpc codes for decode and forward relaying of two correlated sources over the bec"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "universality for the noisy slepian wolf problem via spatial coupling"
    - "bilayer ldpc convolutional codes for half duplex relay channels"
    - "ldpc code design for transmission of correlated sources across noisy channels without csit"
    - "asymptotically regular ldpc codes with linear distance growth and thresholds close to capacity"
    - "can iterative decoding for erasure correlated sources be universal"
    - "bilayer low density parity check codes for decode and forward in relay channels"
    - "network information flow with correlated sources"

Connected through hyperedge HE-5 (induced by source paper "on joint source channel coding for correlated sources over multiple access relay channels"):
  with members:
    - "joint source channel coding for the multiple access relay channel"
    - "separation theorems for phase incoherent multiple user channels"
    - "a new data processing inequality and its applications in distributed source and channel coding"
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "interference channels with arbitrarily correlated sources"

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

Connected through hyperedge HE-7 (induced by source paper "joint source channel coding for the multiple access relay channel"):
  with members:
    - "optimality and approximate optimality of source channel separation in networks"
    - "interference channels with arbitrarily correlated sources"

Connected through hyperedge HE-8 (induced by source paper "separation theorems for phase incoherent multiple user channels"):
  with members:
    - "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)