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: "correlated sources over broadcast channels"
  Abstract: The problem of reliable transmission of correlated sources over the broadcast channel, originally studied by Han and Costa, is revisited. An alternative characterization of their sufficient condition for reliable transmission is given, which includes results of Marton for channel coding over broadcast channels and of Gray and Wyner for distributed source coding. A ``minimalistic'' coding scheme is presented, which is based on joint typicality encoding and decoding, without requiring the use of Cover's superposition coding, random hashing, and common part between two sources. The analysis of the coding scheme is also conceptually simple and relies on a new multivariate covering lemma and an application of the Fourier--Motzkin elimination procedure.

Connected through hyperedge HE-1 (induced by source paper "outer bounds on the admissible source region for broadcast channels with correlated sources"):
  with members:
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "a note on outer bounds for broadcast channel"
    - "the capacity region of classes of product broadcast channels"
    - "optimality and approximate optimality of source channel separation in networks"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "outer bounds on the admissible source region for broadcast channels with dependent sources"
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "approximate characterizations for the gaussian source broadcast distortion region"

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"
    - "wyner ziv coding over broadcast channels digital schemes"
    - "outer bounds on the admissible source region for broadcast channels with dependent sources"
    - "comments on broadcast channels with arbitrarily correlated sources"

Connected through hyperedge HE-3 (induced by source paper "an achievable rate region for the broadcast channel with feedback"):
  with members:
    - "feedback can double the prelog of some memoryless gaussian networks"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "approximate characterizations for the gaussian source broadcast distortion region"
    - "a new achievable rate region for the discrete memoryless multiple access channel with noiseless feedback"
    - "broadcasting correlated gaussians"
    - "a graph based framework for transmission of correlated sources over broadcast channels"

Connected through hyperedge HE-4 (induced by source paper "achievability proof via output statistics of random binning"):
  with members:
    - "when is it possible to simulate a dmc channel from another"
    - "distributed channel synthesis"
    - "hybrid coding an interface for joint source channel coding and network communication"
    - "channel simulation via interactive communications"
    - "coordination via a relay"
    - "strongly secure communications over the two way wiretap channel"
    - "strong secrecy from channel resolvability"
    - "construction of slepian wolf source code and broadcast channel code based on hash property"

Connected through hyperedge HE-5 (induced by source paper "interference channels with arbitrarily correlated sources"):
  with members:
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "interference channels with common information"

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)