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: "robust distributed source coding"
  Abstract: We consider a distributed source coding system in which several observations are communicated to the decoder using limited transmission rate. The observations must be separately coded. We introduce a robust distributed coding scheme which flexibly trades off between system robustness and compression efficiency. The optimality of this coding scheme is proved for various special cases.

Connected through hyperedge HE-1 (induced by source paper "generalized gaussian multiterminal source coding in the high resolution regime"):
  with members:
    - "robust distributed compression of symmetrically correlated gaussian sources"
    - "generalized gaussian multiterminal source coding the symmetric case"
    - "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-2 (induced by source paper "robust distributed compression of symmetrically correlated gaussian sources"):
  with members:
    - "generalized gaussian multiterminal source coding the symmetric case"
    - "the sum rate of vector gaussian multiple description coding with tree structured covariance distortion constraints"
    - "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem"
    - "multiuser successive refinement and multiple description coding"
    - "multiple description quantization via gram schmidt orthogonalization"
    - "vector gaussian multiple description with individual and central receivers"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-3 (induced by source paper "lattice based robust distributed source coding"):
  with members:
    - "lattice quantization with side information codes asymptotics and applications in sensor networks"
    - "vector gaussian multiple description with individual and central receivers"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-4 (induced by source paper "on the sub optimality of single letter coding over networks"):
  with members:
    - "dictator functions maximize mutual information"
    - "on non interactive simulation of joint distributions"
    - "analysis of boolean functions"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "a new data processing inequality and its applications in distributed source and channel coding"
    - "on extracting common random bits from correlated sources"

Connected through hyperedge HE-5 (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"
    - "interference channels with arbitrarily correlated sources"

Connected through hyperedge HE-6 (induced by source paper "distributed multilevel diversity coding"):
  with members:
    - "broadcasting correlated vector gaussians"
    - "multilevel diversity coding with regeneration"
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "secure symmetrical multilevel diversity coding"
    - "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions"
    - "approximating the gaussian multiple description rate region under symmetric distortion constraints"

Connected through hyperedge HE-7 (induced by source paper "robust uplink communications over fading channels with variable backhaul connectivity"):
  with members:
    - "broadcast approaches to the diamond channel"
    - "robust and efficient distributed compression for cloud radio access networks"
    - "distributed mimo receiver achievable rates and upper bounds"

Connected through hyperedge HE-8 (induced by source paper "minimum expected distortion in gaussian source coding with fading side information"):
  with members:
    - "wyner ziv coding over broadcast channels digital schemes"
    - "distortion minimization in gaussian layered broadcast coding with successive refinement"
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

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)