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: "properties and construction of polar codes"
  Abstract: Recently, Ar{\i}kan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel. In the thesis, we show that decoding algorithm of polar codes, called successive cancellation decoding, can be regarded as belief propagation decoding, which has been used for decoding of low-density parity-check codes, on a tree graph. On the basis of the observation, we show an efficient construction method of polar codes using density evolution, which has been used for evaluation of the error probability of belief propagation decoding on a tree graph. We further show that channel polarization phenomenon and polar codes can be generalized to non-binary discrete memoryless channels. Asymptotic performances of non-binary polar codes, which use non-binary matrices called the Reed-Solomon matrices, are better than asymptotic performances of the best explicitly known binary polar code. We also find that the Reed-Solomon matrices are considered to be natural generalization of the original binary channel polarization introduced by Ar{\i}kan.

Connected through hyperedge HE-1 (induced by source paper "polar codes simplicity random codes durability"):
  with members:
    - "reed muller codes polarize"
    - "ar i kan meets shannon polar codes with near optimal convergence to channel capacity"
    - "explicit polar codes with small scaling exponent"
    - "on the capacity of channels with deletions and states"
    - "polar codes for the deletion channel weak and strong polarization"
    - "polar like codes and asymptotic tradeoff among block length code rate and error probability"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"

Connected through hyperedge HE-2 (induced by source paper "rate dependent analysis of the asymptotic behavior of channel polarization"):
  with members:
    - "finite length scaling for polar codes"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "polar codes for the m user mac"
    - "refined rate of channel polarization"
    - "capacity achieving polar codes for arbitrarily permuted parallel channels"

Connected through hyperedge HE-3 (induced by source paper "channel upgradation for non binary input alphabets and macs"):
  with members:
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "how to achieve the capacity of asymmetric channels"
    - "upgraded approximation of non binary alphabets for polar code construction"
    - "polar codes for the two user multiple access channel"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-4 (induced by source paper "constructing polar codes using iterative bit channel upgrading"):
  with members:
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "source and channel polarization over finite fields and reed solomon matrices"):
  with members:
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "polar codes for the two user multiple access channel"
    - "polar codes for q ary channels q 2 r"
    - "multilevel polarization of polar codes over arbitrary discrete memoryless channels"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "polar codes for the m user mac"
    - "refined rate of channel polarization"

Connected through hyperedge HE-6 (induced by source paper "how to construct polar codes"):
  with members:
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "universal bounds on the scaling behavior of polar codes"
    - "list decoding of polar codes"
    - "polar codes for the two user multiple access channel"
    - "on the construction of polar codes"
    - "polar write once memory codes"
    - "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"
    - "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)