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: "communicating correlated sources over an interference channel"
  Abstract: A new coding technique, based on \textit{fixed block-length} codes, is proposed for the problem of communicating a pair of correlated sources over a $2-$user interference channel. Its performance is analyzed to derive a new set of sufficient conditions. The latter is proven to be strictly less binding than the current known best, which is due to Liu and Chen [Dec, 2011]. Our findings are inspired by Dueck's example [March, 1981].

Connected through hyperedge HE-1 (induced by source paper "a new achievable rate distortion region for distributed source coding"):
  with members:
    - "on the sub optimality of single letter coding in multi terminal communications"
    - "on the sub optimality of single letter coding over networks"
    - "communicating correlated sources over a mac in the absence of a g acs k orner common part"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-2 (induced by source paper "communicating correlated sources over mac and interference channels i separation based schemes"):
  with members:
    - "broadcasting correlated vector gaussians"
    - "matched multiuser gaussian source channel communications via uncoded schemes"
    - "on joint source channel coding for correlated sources over multiple access relay channels"
    - "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"

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)