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: "universal polar codes for more capable and less noisy channels and sources"
  Abstract: We prove two results on the universality of polar codes for source coding and channel communication. First, we show that for any polar code built for a source PX,Z there exists a slightly modified polar code-having the same rate, the same encoding and decoding complexity and the same error rate-that is universal for every source PX,Y when using successive cancellation decoding, at least when the channel PY|X is more capable than PZ|X and PX is such that it maximizes I(X; Y )-I(X;Z) for the given channels PY|X and PZ|X. This result extends to channel coding for discrete memoryless channels. Second, we prove that polar codes using successive cancellation decoding are universal for less noisy discrete memoryless channels.

Connected through hyperedge HE-1 (induced by source paper "universal polarization for processes with memory"):
  with members:
    - "a simple proof of fast polarization"
    - "fast polarization for processes with memory"
    - "polar coding for processes with memory"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "joint successive cancellation decoding of polar codes over intersymbol interference channels"
    - "universal source polarization and an application to a multi user problem"
    - "channel upgradation for non binary input alphabets and macs"

Connected through hyperedge HE-2 (induced by source paper "comparison of channels criteria for domination by a symmetric channel"):
  with members:
    - "strong data processing inequalities for channels and bayesian networks"
    - "bounds between contraction coefficients"
    - "a note on the strong data processing inequalities in bayesian networks"
    - "dissipation of information in channels with input constraints"
    - "strong data processing inequalities and phi sobolev inequalities for discrete channels"
    - "capacity regions of two new classes of 2 receiver broadcast channels"

Connected through hyperedge HE-3 (induced by source paper "alignment of polarized sets"):
  with members:
    - "polar codes for broadcast channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "universal polar codes"
    - "on the construction of polar codes"
    - "wiretap channels implications of the more capable condition and cyclic shift symmetry"

Connected through hyperedge HE-4 (induced by source paper "achieving marton s region for broadcast channels using polar codes"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "polar coding for interference networks"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "a comparison of superposition coding schemes"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "universal polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"

Connected through hyperedge HE-5 (induced by source paper "polar coding for the general wiretap channel"):
  with members:
    - "polar codes for broadcast channels"
    - "polar codes for distributed hierarchical source coding"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "polar coding for interference networks"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "polar codes for the two user multiple access channel"

Connected through hyperedge HE-6 (induced by source paper "re proving channel polarization theorems an extremality and robustness analysis"):
  with members:
    - "the symmetric convex ordering a novel partial order for b dmcs ordering the information sets of polar codes"
    - "properties of the polarization transformations for the likelihood ratios of symmetric b dmcs"
    - "extremality for gallager s reliability function e_0"
    - "extremes of error exponents"
    - "list decoding of polar codes"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "hardware architectures for successive cancellation decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "universal source polarization and an application to a multi user problem"):
  with members:
    - "compound polar codes"
    - "conditions for robustness of polar codes in the presence of channel mismatch"
    - "universal polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "the compound capacity of polar codes"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-8 (induced by source paper "joint write once memory and error control codes"):
  with members:
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "write once memory codes by source polarization"
    - "polar write once memory codes"
    - "capacity achieving multiwrite wom codes"
    - "polar codes for q ary channels q 2 r"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"

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)