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: "high girth matrices and polarization"
  Abstract: The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose probabilistic girth is close to its rank. Random matrices can be used to show the existence of high-girth matrices with constant relative rank, but the construction is non-explicit. This paper uses a polar-like construction to obtain a deterministic and efficient construction of high-girth matrices for arbitrary fields and relative ranks. Applications to coding and sparse recovery are discussed.

Connected through hyperedge HE-1 (induced by source paper "reed muller codes polarize"):
  with members:
    - "recursive projection aggregation decoding of reed muller codes"
    - "general strong polarization"
    - "on the performance of reed muller codes with respect to random errors and erasures"
    - "decoding reed muller codes using minimum weight parity checks"
    - "almost optimal scaling of reed muller codes on bec and bsc channels"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "reed muller codes achieve capacity on erasure channels"

Connected through hyperedge HE-2 (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"
    - "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"
    - "polarization of the r enyi information dimension for single and multi terminal analog compression"
    - "how to construct polar codes"

Connected through hyperedge HE-3 (induced by source paper "polarization of the renyi information dimension with applications to compressed sensing"):
  with members:
    - "lossless linear analog compression"
    - "degrees of freedom in vector interference channels"
    - "almost lossless analog signal separation and probabilistic uncertainty relations"
    - "a new entropy power inequality for integer valued random variables"
    - "polar codes for the two user multiple access channel"
    - "adaptive sensing using deterministic partial hadamard matrices"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"
    - "achieving the secrecy capacity of wiretap channels using polar 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)