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: "polarization of the r enyi information dimension for single and multi terminal analog compression"
  Abstract: This paper shows that the R\'enyi information dimension (RID) of an i.i.d. sequence of mixture random variables polarizes to the extremal values of 0 and 1 (fully discrete and continuous distributions) when transformed by an Hadamard matrix. This provides a natural counter-part over the reals of the entropy polarization phenomenon over finite fields. It is further shown that the polarization pattern of the RID is equivalent to the BEC polarization pattern, which admits a closed form expression. These results are used to construct universal and deterministic partial Hadamard matrices for analog to analog (A2A) compression of random i.i.d. signals. In addition, a framework for the A2A compression of multiple correlated signals is developed, providing a first counter-part of the Slepian-Wolf coding problem in the A2A setting.

Connected through hyperedge HE-1 (induced by source paper "the fractality of polar and reed muller codes"):
  with members:
    - "relaxed polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "alignment of polarized sets"
    - "high girth matrices and polarization"
    - "ergodic theory meets polarization ii a foundation of polarization theory"
    - "finite length scaling for polar codes"
    - "a novel partial order for the information sets of polar codes over b dmcs"
    - "how to construct polar codes"

Connected through hyperedge HE-2 (induced by source paper "spright a fast and robust framework for sparse walsh hadamard transform"):
  with members:
    - "nearly optimal deterministic algorithm for sparse walsh hadamard transform"
    - "phasecode fast and efficient compressive phase retrieval based on sparse graph codes"
    - "sample optimal average case sparse fourier transform in two dimensions"
    - "a fast hadamard transform for signals with sub linear sparsity in the transform domain"
    - "computing a k sparse n length discrete fourier transform using at most 4k samples and o k log k complexity"
    - "nearly optimal sparse fourier transform"

Connected through hyperedge HE-3 (induced by source paper "high girth matrices and polarization"):
  with members:
    - "how to construct polar codes"
    - "a survey on network codes for distributed storage"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-4 (induced by source paper "a structured construction of optimal measurement matrix for noiseless compressed sensing via analog polarization"):
  with members:
    - "adaptive sensing using deterministic partial hadamard matrices"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"
    - "optimal phase transitions in compressed sensing"
    - "model based compressive sensing"
    - "construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-5 (induced by source paper "multi terminal probabilistic compressed sensing"):
  with members:
    - "adaptive sensing using deterministic partial hadamard matrices"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"
    - "optimal phase transitions in compressed sensing"
    - "the dynamics of message passing on dense graphs with applications to compressed sensing"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "message passing algorithms for compressed sensing i motivation and construction"

Connected through hyperedge HE-6 (induced by source paper "a fast hadamard transform for signals with sub linear sparsity in the transform domain"):
  with members:
    - "nearly optimal sparse fourier transform"

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)