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: "an entropy inequality for q ary random variables and its application to channel polarization"
  Abstract: It is shown that given two copies of a q-ary input channel W, where q is prime, it is possible to create two channels W− and W+ whose symmetric capacities satisfy I(W−) ≤ I(W) ≤ I(W+), where the inequalities are strict except in trivial cases. This leads to a simple proof of channel polarization in the q-ary case.

Connected through hyperedge HE-1 (induced by source paper "on the finite length scaling of ternary polar codes"):
  with members:
    - "finite length scaling for polar codes"
    - "an entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "improved bounds on the finite length scaling of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-2 (induced by source paper "an entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets"):
  with members:
    - "polar codes for broadcast channels"
    - "finite length scaling for polar codes"
    - "polynomial complexity of polar codes for non binary alphabets key agreement and slepian wolf coding"
    - "polar coding for interference networks"
    - "a new entropy power inequality for integer valued random variables"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "polar codes for the two user multiple access channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-3 (induced by source paper "polynomial complexity of polar codes for non binary alphabets key agreement and slepian wolf coding"):
  with members:
    - "key capacity with limited one way communication for product sources"
    - "polar coding for secret key generation"
    - "polar codes for the two user multiple access channel"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "polar coding for secure transmission and key agreement"
    - "polar codes for the m user mac"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "polar codes for the two user multiple access channel"):
  with members:
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-5 (induced by source paper "achieving the secrecy capacity of wiretap channels using polar codes"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "how to construct polar codes"
    - "polar coding for secure transmission and key agreement"
    - "nested polar codes for wiretap and relay channels"
    - "strong secrecy for erasure wiretap channels"
    - "secrecy achieving polar coding for binary input memoryless symmetric wire tap channels"
    - "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"

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)