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: "iterative quantization using codes on graphs"
  Abstract: We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is the dual of the binary erasure channel (BEC) coding problem. We show that duals of capacity achieving codes for the BEC yield codes which approach the minimum possible rate for the BEQ. In contrast, low density parity check codes cannot achieve the minimum rate unless their density grows at least logarithmically with block length. Furthermore, we show that duals of efficient iterative decoding algorithms for the BEC yield efficient encoding algorithms for the BEQ. Hence our results suggest that graphical models may yield near optimal codes in source coding as well as in channel coding and that duality plays a key role in such constructions.

Connected through hyperedge HE-1 (induced by source paper "on privacy amplification lossy compression and their duality to channel coding"):
  with members:
    - "wiretap channels nonasymptotic fundamental limits"
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "alignment of polarized sets"
    - "e_ gamma resolvability"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "non asymptotic output statistics of random binning and its applications"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "non asymptotic analysis of privacy amplification via renyi entropy and inf spectral entropy"

Connected through hyperedge HE-2 (induced by source paper "duality between erasures and defects"):
  with members:
    - "locally rewritable codes for resistive memories"
    - "reed muller codes achieve capacity on erasure channels"
    - "rewriting flash memories by message passing"
    - "cyclic lrc codes and their subfield subcodes"
    - "coding scheme for 3d vertical flash memory"
    - "writing on dirty flash memory"
    - "on the duality of erasures and defects"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-3 (induced by source paper "rewriting flash memories by message passing"):
  with members:
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "achieving marton s region for broadcast channels using polar codes"
    - "trajectory codes for flash memory"
    - "polar write once memory codes"
    - "on coding efficiency for flash memories"

Connected through hyperedge HE-4 (induced by source paper "nonasymptotic noisy lossy source coding"):
  with members:
    - "fixed length lossy compression in the finite blocklength regime"
    - "multiterminal source coding under logarithmic loss"
    - "the dispersion of lossy source coding"
    - "multiterminal source coding with an entropy based distortion measure"

Connected through hyperedge HE-5 (induced by source paper "approaching the rate distortion limit with spatial coupling belief propagation and decimation"):
  with members:
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "spatial coupling as a proof technique"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "lossy source coding via spatially coupled ldgm ensembles"
    - "chains of mean field models"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-6 (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-7 (induced by source paper "coding and system design for quantize map and forward relaying"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "bilayer protograph codes for half duplex relay channels"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "parallel bit interleaved coded modulation"
    - "cooperative multiplexing in the multiple antenna half duplex relay channel"
    - "interference mitigation through limited receiver cooperation"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "bilayer low density parity check codes for decode and forward in relay channels"

Connected through hyperedge HE-8 (induced by source paper "blahut arimoto algorithm and code design for action dependent source coding problems"):
  with members:
    - "polar codes are optimal for lossy source coding"
    - "source coding with a side information vending machine"
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"

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)