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 novel partial order for the information sets of polar codes over b dmcs"
  Abstract: We study partial orders on the information sets of polar codes designed for binary discrete memoryless channels. We show that the basic polarization transformations defined by Ar{\i}kan preserve `symmetric convex/concave orders'. While for symmetric channels this ordering turns out to be equivalent to the stochastic degradation ordering already known to order the information sets of polar codes, we show that a strictly weaker partial order is obtained when at least one of the channels is asymmetric. We also discuss two tools which can be useful for verifying `symmetric convex/concave ordering': a criterion known as the cut criterion and channel symmetrization.

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

Connected through hyperedge HE-2 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder"):
  with members:
    - "a simple proof of fast polarization"
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "polar coding for processes with memory"

Connected through hyperedge HE-3 (induced by source paper "fast construction of polar codes"):
  with members:
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "universal polar decoding with channel knowledge at the encoder"):
  with members:
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

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)