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: "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions"
  Abstract: We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of $2^K-1$ information sources, ordered in a decreasing level of importance, is encoded into $K$ messages (or descriptions). There are $2^K-1$ decoders, each of which has access to a non-empty subset of the encoded messages. Each decoder is required to reproduce the information sources up to a certain importance level depending on the combination of descriptions available to it. We obtain a single letter characterization of the achievable rate region for the 3-description problem. In contrast to symmetric multilevel diversity coding, source-separation coding is not sufficient in the asymmetric case, and ideas akin to network coding need to be used strategically. Based on the intuitions gained in treating the A-MLD problem, we derive inner and outer bounds for the rate region of the asymmetric Gaussian multiple description (MD) problem with three descriptions. Both the inner and outer bounds have a similar geometric structure to the rate region template of the A-MLD coding problem, and moreover, we show that the gap between them is small, which results in an approximate characterization of the asymmetric Gaussian three description rate region.

Connected through hyperedge HE-1 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "minimum storage regenerating codes for all parameters"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "hashtag erasure codes from theory to practice"
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "layered exact repair regenerating codes via embedded error correction and block designs"

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"
    - "information inequalities for joint distributions with interpretations and applications"
    - "approximating the gaussian multiple description rate region under symmetric distortion constraints"

Connected through hyperedge HE-3 (induced by source paper "on the tradeoff region of secure exact repair regenerating codes"):
  with members:
    - "a note on secure minimum storage regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "outer bounds for exact repair codes"

Connected through hyperedge HE-4 (induced by source paper "broadcast coded modulation multilevel and bit interleaved construction"):
  with members:
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "signal shaping for bicm at low snr"

Connected through hyperedge HE-5 (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"
    - "approximating the gaussian multiple description rate region under symmetric distortion constraints"
    - "robust distributed source coding"

Connected through hyperedge HE-6 (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"
    - "approximating the gaussian multiple description rate region under symmetric distortion constraints"
    - "vector gaussian multiple description with individual and central receivers"

Connected through hyperedge HE-7 (induced by source paper "multilevel diversity coding systems rate regions codes computation forbidden minors"):
  with members:
    - "explicit polyhedral bounds on network coding rate regions via entropy function region algorithms symmetry and computation"
    - "constrained linear representability of polymatroids and algorithms for computing achievability proofs in network coding"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "symmetry in distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "rate region of the 4 3 3 exact repair regenerating codes"
    - "entropy vectors and network codes"

Connected through hyperedge HE-8 (induced by source paper "symmetrical multilevel diversity coding and subset entropy inequalities"):
  with members:
    - "secure symmetrical multilevel diversity coding"
    - "information inequalities for joint distributions with interpretations and applications"

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)