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: "a graph based framework for transmission of correlated sources over broadcast channels"
  Abstract: In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for this information transmission problem. The system involves a source coding module and a channel coding module. In the source coding module, the sources are efficiently mapped into a nearly semi-regular bipartite graph, and in the channel coding module, the edges of this graph are reliably transmitted over a broadcast channel. We consider nearly semi-regular bipartite graphs as discrete interface between source coding and channel coding in this multiterminal setting. We provide an information-theoretic characterization of (1) the rate of exponential growth (as a function of the number of channel uses) of the size of the bipartite graphs whose edges can be reliably transmitted over a broadcast channel and (2) the rate of exponential growth (as a function of the number of source samples) of the size of the bipartite graphs which can reliably represent a pair of correlated sources to be transmitted over a broadcast channel.

Connected through hyperedge HE-1 (induced by source paper "new sufficient conditions for multiple access channel with correlated sources"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"

Connected through hyperedge HE-2 (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"
    - "correlated sources over broadcast channels"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "typicality graphs large deviation analysis"):
  with members:
    - "a new achievable rate region for the discrete memoryless multiple access channel with noiseless feedback"

Connected through hyperedge HE-4 (induced by source paper "source and channel coding for correlated sources over multiuser channels"):
  with members:
    - "broadcast capacity region of two phase bidirectional relaying"
    - "on the capacity of gaussian weak interference channels with degraded message sets"

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)