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: "channel upgradation for non binary input alphabets and macs"
  Abstract: Consider a single-user or multiple-access channel with a large output alphabet. A method to approximate the channel by an upgraded version having a smaller output alphabet is presented and analyzed. The original channel is not necessarily symmetric and does not necessarily have a binary input alphabet. Also, the input distribution is not necessarily uniform. The approximation method is instrumental when constructing capacity achieving polar codes for an asymmetric channel with a non-binary input alphabet. Other settings in which the method is instrumental are the wiretap setting as well as the lossy source coding setting.

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"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "joint successive cancellation decoding of polar codes over intersymbol interference channels"
    - "universal source polarization and an application to a multi user problem"

Connected through hyperedge HE-2 (induced by source paper "information theoretical clustering is hard to approximate"):
  with members:
    - "approximation algorithms for clustering via weighted impurity measures"
    - "information distilling quantizers"
    - "greedy merge degrading has optimal power law"
    - "the hardness of approximation of euclidean k means"
    - "how to construct polar codes"
    - "quantization of binary input discrete memoryless channels"
    - "approximation algorithms for bregman co clustering and tensor clustering"
    - "k means requires exponentially many iterations even in the plane"

Connected through hyperedge HE-3 (induced by source paper "approximation algorithms for clustering via weighted impurity measures"):
  with members:
    - "information distilling quantizers"
    - "greedy merge degrading has optimal power law"
    - "the hardness of approximation of euclidean k means"
    - "how to construct polar codes"
    - "quantization of binary input discrete memoryless channels"
    - "approximation algorithms for bregman co clustering and tensor clustering"

Connected through hyperedge HE-4 (induced by source paper "greedy merge degrading has optimal power law"):
  with members:
    - "information distilling quantizers"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "on the construction of polar codes"
    - "at low snr asymmetric quantizers are better"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "quantization of binary input discrete memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "construction of polar codes for arbitrary discrete memoryless channels"):
  with members:
    - "a comparative study of polar code constructions for the awgn channel"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "ergodic theory meets polarization ii a foundation of polarization theory"
    - "practical polar code construction using generalised generator matrices"
    - "upgraded approximation of non binary alphabets for polar code construction"
    - "on the construction and decoding of concatenated polar codes"
    - "universal polar codes"
    - "constructing polar codes using iterative bit channel upgrading"

Connected through hyperedge HE-6 (induced by source paper "secure polar coding for the two way wiretap channel"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "polar coding for secure transmission in miso fading wiretap channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for secret key generation"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "universal polar codes"

Connected through hyperedge HE-7 (induced by source paper "polar coding strategies for the interference channel with partially joint decoding"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar coding for processes with memory"
    - "optimal achievable rates for interference networks with random codes"
    - "polar codes for broadcast channels"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "polar coding for interference networks"
    - "polar coding for secret key generation"

Connected through hyperedge HE-8 (induced by source paper "on the construction of polar codes for channels with moderate input alphabet sizes"):
  with members:
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "an entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets"
    - "upgraded approximation of non binary alphabets for polar code construction"
    - "on the construction of polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "how to construct polar codes"
    - "polar codes with mixed kernels"
    - "quantization of binary input discrete 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)