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: "interference channels with arbitrarily correlated sources"
  Abstract: Communicating arbitrarily correlated sources over interference channels is considered in this paper. A sufficient condition is found for the lossless transmission of a pair of correlated sources over a discrete memoryless interference channel. With independent sources, the sufficient condition reduces to the Han-Kobayashi achievable rate region for the interference channel. For a special correlation structure (in the sense of Slepian-Wolf, 1973), the proposed region reduces to the known achievable region for interference channels with common information. A simple example is given to show that the separation approach, with Slepian-Wolf encoding followed by optimal channel coding, is strictly suboptimal.

Connected through hyperedge HE-1 (induced by source paper "robust gaussian joint source channel coding with a staircase distortion noise profile"):
  with members:
    - "robust gaussian joint source channel coding under the near zero bandwidth regime"
    - "minimum energy for gaussian joint source channel coding with a square law distortion noise profile"
    - "the porosity of additive noise sequences"
    - "communication over individual channels"

Connected through hyperedge HE-2 (induced by source paper "structured mappings and conferencing common information for multiple access channels"):
  with members:
    - "a new achievable rate region for multiple access channel with states"
    - "quasi linear codes application to point to point and multi terminal source coding"
    - "distributed simulation of continuous random variables"
    - "exact common information"
    - "on interference networks over finite fields"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of computation broadcast"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "the capacity of private computation"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "index coding with coded side information"
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"

Connected through hyperedge HE-4 (induced by source paper "minimum energy analysis for robust gaussian joint source channel coding with a square law profile"):
  with members:
    - "the porosity of additive noise sequences"
    - "communication over individual channels"
    - "joint source channel coding with side information using hybrid digital analog codes"

Connected through hyperedge HE-5 (induced by source paper "communicating correlated sources over an interference channel"):
  with members:
    - "a source channel separation theorem with application to the source broadcast problem"
    - "communicating correlated sources over a mac in the absence of a g acs k orner common part"
    - "on joint source channel coding for correlated sources over multiple access relay channels"

Connected through hyperedge HE-6 (induced by source paper "communicating correlated sources over mac and interference channels i separation based schemes"):
  with members:
    - "communicating correlated sources over an interference channel"
    - "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"
    - "distributed joint source channel coding on a multiple access channel with side information"

Connected through hyperedge HE-7 (induced by source paper "on transmitting correlated sources over a mac"):
  with members:
    - "matched multiuser gaussian source channel communications via uncoded schemes"
    - "on joint source channel coding for correlated sources over multiple access relay channels"

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

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)