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: "recursive constructions and their maximum likelihood decoding"
  Abstract: We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.

Connected through hyperedge HE-1 (induced by source paper "circular buffer rate matched polar codes"):
  with members:
    - "relaxed polar codes"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "multi kernel construction of polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "rate compatible polar codes for wireless channels"
    - "capacity achieving rateless polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"

Connected through hyperedge HE-2 (induced by source paper "relaxed polar codes"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "polar codes for broadcast channels"
    - "fast polar decoders algorithm and implementation"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "compound polar codes"
    - "universal polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "polar codes with a stepped boundary"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "efficiently decoding reed muller codes from random errors"
    - "reed muller codes for random erasures and errors"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "on decoding algorithms for polar codes"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "list decoding of polar codes"
    - "how to construct 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 "binary polar codes are optimised codes for bitwise multistage decoding"):
  with members:
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "polar codes for the m user mac"
    - "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)