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: "low density constructions can achieve the wyner ziv and gelfand pinsker bounds"
  Abstract: We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder side information (the Gelfand-Pinsker problem). Our approach relies on a combination of low-density parity check (LDPC) codes and low-density generator matrix (LDGM) codes, and produces sparse constructions that are simultaneously good as both source and channel codes. In particular, we prove that under maximum likelihood encoding/decoding, there exist low-density codes (i.e., with finite degrees) from our constructions that can saturate both the Wyner-Ziv and Gelfand-Pinsker bounds.

Connected through hyperedge HE-1 (induced by source paper "analytical framework of ldgm based iterative quantization with decimation"):
  with members:
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "average entropy functions"
    - "design and analysis of ldgm based codes for mse quantization"
    - "the case for structured random codes in network capacity theorems"
    - "low density graph codes that are optimal for source channel coding and binning"
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"
    - "analysis of ldgm and compound codes for lossy compression and binning"

Connected through hyperedge HE-2 (induced by source paper "efficient ldpc codes over gf q for lossy data compression"):
  with members:
    - "lower bounds on the rate distortion function of ldgm codes"
    - "lower bounds on the rate distortion function of individual ldgm codes"
    - "encoding for the blackwell channel with reinforced belief propagation"
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"
    - "analysis of ldgm and compound codes for lossy compression and binning"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"
    - "statistical mechanical approach to lossy data compression theory and practice"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"

Connected through hyperedge HE-3 (induced by source paper "design and analysis of ldgm based codes for mse quantization"):
  with members:
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"
    - "analysis of ldgm and compound codes for lossy compression and binning"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "the generalized area theorem and some of its consequences"
    - "performance versus complexity per iteration for low density parity check codes an information theoretic approach"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"
    - "iterative quantization using codes on graphs"

Connected through hyperedge HE-4 (induced by source paper "lower bounds on the rate distortion function of ldgm codes"):
  with members:
    - "lower bounds on the rate distortion function of individual ldgm codes"
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"
    - "analysis of ldgm and compound codes for lossy compression and binning"
    - "low density codes achieve the rate distortion bound"
    - "iterative quantization using codes on graphs"
    - "approximating the satisfiability threshold for random k xor formulas"

Connected through hyperedge HE-5 (induced by source paper "lower bounds on the rate distortion function of individual ldgm codes"):
  with members:
    - "lower bounds on the rate distortion function of ldgm codes"
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"
    - "analysis of ldgm and compound codes for lossy compression and binning"
    - "low density codes achieve the rate distortion bound"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"
    - "iterative quantization using codes on graphs"

Connected through hyperedge HE-6 (induced by source paper "hash property and coding theorems for sparse matrices and maximum likelihood coding"):
  with members:
    - "construction of codes for wiretap channel and secret key agreement from correlated source outputs by using sparse matrices"
    - "hash property and fixed rate universal coding theorems"
    - "lower bounds on the rate distortion function of ldgm codes"
    - "lower bounds on the rate distortion function of individual ldgm codes"
    - "low density codes achieve the rate distortion bound"

Connected through hyperedge HE-7 (induced by source paper "low density graph codes that are optimal for source channel coding and binning"):
  with members:
    - "analysis of ldgm and compound codes for lossy compression and binning"
    - "low density codes achieve the rate distortion bound"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"
    - "iterative quantization using codes on graphs"
    - "approximating the satisfiability threshold for random k xor formulas"

Connected through hyperedge HE-8 (induced by source paper "a new look at survey propagation and its generalizations"):
  with members:
    - "belief optimization for binary networks a stable alternative to loopy belief propagation"
    - "on the solution space geometry of random constraint satisfaction problems"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"
    - "the threshold for random k sat is 2 k ln2 o k"
    - "typical random 3 sat formulae and the satisfiability threshold"
    - "on local equilibrium equations for clustering states"
    - "survey propagation an algorithm for satisfiability"

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)