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: "approximating the gaussian multiple description rate region under symmetric distortion constraints"
  Abstract: We consider multiple description coding for the Gaussian source with K descriptions under the symmetric mean squared error distortion constraints, and provide an approximate characterization of the rate region. We show that the rate region can be sandwiched between two polytopes, between which the gap can be upper bounded by constants dependent on the number of descriptions, but independent of the exact distortion constraints. Underlying this result is an exact characterization of the lossless multi-level diversity source coding problem: a lossless counterpart of the MD problem. This connection provides a polytopic template for the inner and outer bounds to the rate region. In order to establish the outer bound, we generalize Ozarow's technique to introduce a strategic expansion of the original probability space by more than one random variables. For the symmetric rate case with any number of descriptions, we show that the gap between the upper bound and the lower bound for the individual description rate is no larger than 0.92 bit. The results developed in this work also suggest the "separation" approach of combining successive refinement quantization and lossless multi-level diversity coding is a competitive one, since it is only a constant away from the optimum. The results are further extended to general sources under the mean squared error distortion measure, where a similar but looser bound on the gap holds.

Connected through hyperedge HE-1 (induced by source paper "on the storage cost of private information retrieval"):
  with members:
    - "how to use undiscovered information inequalities direct applications of the copy lemma"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "improved storage for efficient private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "on the capacity of locally decodable codes"

Connected through hyperedge HE-2 (induced by source paper "the explicit coding rate region of symmetric multilevel diversity coding"):
  with members:
    - "distributed multilevel diversity coding"
    - "multilevel diversity coding with regeneration"
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "multilevel diversity coding systems rate regions codes computation forbidden minors"
    - "secure symmetrical multilevel diversity coding"
    - "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions"
    - "information inequalities for joint distributions with interpretations and applications"

Connected through hyperedge HE-3 (induced by source paper "the sum rate of vector gaussian multiple description coding with tree structured covariance distortion constraints"):
  with members:
    - "combinatorial message sharing and a new achievable region for multiple descriptions"
    - "the gaussian many help one distributed source coding problem"
    - "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 "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"
    - "robust distributed source coding"

Connected through hyperedge HE-5 (induced by source paper "combinatorial message sharing and a new achievable region for multiple descriptions"):
  with members:
    - "an achievable rate distortion region for the multiple descriptions problem"
    - "on the role of common codewords in quadratic gaussian multiple descriptions coding"
    - "a strictly improved achievable region for multiple descriptions using combinatorial message sharing"
    - "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions"
    - "vector gaussian multiple description with individual and central receivers"

Connected through hyperedge HE-6 (induced by source paper "n channel asymmetric entropy constrained multiple description lattice vector quantization"):
  with members:
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"
    - "multiple description coding by dithered delta sigma quantization"
    - "multiple description lattice vector quantization"
    - "n channel entropy constrained multiple description lattice vector quantization"
    - "multiple description quantization via gram schmidt orthogonalization"
    - "vector gaussian multiple description with individual and central receivers"
    - "index assignment for multichannel communication under failure"

Connected through hyperedge HE-7 (induced by source paper "bounding the rate region of vector gaussian multiple descriptions with individual and central receivers"):
  with members:
    - "vector gaussian multiple description with individual and central receivers"

Connected through hyperedge HE-8 (induced by source paper "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "gaussian interference channel capacity to within one bit"
    - "vector gaussian multiple description with individual and central receivers"

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)