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: "equidistant polarizing transforms"
  Abstract: We consider non-binary polarization transform problem of polar codes. The focus of this work is on finding equidistant (or almost equidistant) polarizing transforms to maximize the minimum distance and to approach the equidistant distant spectrum bound as a function of signal set. This bound is an ultimate limit and tight for additive white Gaussian channels. In this way, polarization of error probability for the good channel is improved while the bad channel is almost the same for a given signal set. Our main result is that the polarization speed is increased by using polarizing transform with an improved distance profile. A non-binary polarization transform for q = 5 is found that can provide the equidistant distant spectrum bound. Almost equidistant polarization transforms for q = 4, 6, 7 and 8 are introduced for PSK signal sets. As a private solution, we provided new geometries for the signal set design to define the equidistant transform for q = 3 and q = 4 for one and two dimensional signalings. We proposed a procedure to design transforms that have better distance profiles for q-ary signal sets. Finally, we show improvements in frame error rates.

Connected through hyperedge HE-1 (induced by source paper "strange attractor for efficient polar code design"):
  with members:
    - "on the successive cancellation decoding of polar codes with arbitrary linear binary kernels"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "construction of polar codes with sublinear complexity"
    - "a comparative study of polar code constructions for the awgn channel"
    - "how to construct 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)