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: "a randomized construction of polar subcodes"
  Abstract: A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are provided, which show that the obtained codes outperform LDPC and turbo codes.

Connected through hyperedge HE-1 (induced by source paper "polarization adjusted convolutional pac codes fano decoding vs list decoding"):
  with members:
    - "on pre transformed polar codes"
    - "from sequential decoding to channel polarization and back again"
    - "parity check polar coding for 5g and beyond"
    - "llr based successive cancellation list decoding of polar codes"
    - "on the origin of polar coding"
    - "a rm polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "on distance properties of convolutional polar codes"):
  with members:
    - "successive cancellation list decoding of bmera codes with application to higher order modulation"
    - "convolutional polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-3 (induced by source paper "efficient decoding of polar codes with some 16 16 kernels"):
  with members:
    - "binary linear codes with optimal scaling polar codes with large kernels"
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "binary polarization kernels from code decompositions"
    - "scaling exponent of list decoders with applications to polar codes"
    - "list decoding of polar codes"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-4 (induced by source paper "block sequential decoding techniques for polar subcodes"):
  with members:
    - "fast list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "fast sequential decoding of polar codes"):
  with members:
    - "fast list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"
    - "list decoding of polar codes"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)