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: "polar codes for the m user mac"
  Abstract: In this paper, polar codes for the $m$-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Ar{\i}kan's polarization technique applied individually to each user transforms independent uses of a $m$-user binary input MAC into successive uses of extremal MACs. This transformation has a number of desirable properties: (i) the `uniform sum rate' of the original MAC is preserved, (ii) the extremal MACs have uniform rate regions that are not only polymatroids but matroids and thus (iii) their uniform sum rate can be reached by each user transmitting either uncoded or fixed bits; in this sense they are easy to communicate over. A polar code can then be constructed with an encoding and decoding complexity of $O(n \log n)$ (where $n$ is the block length), a block error probability of $o(\exp(- n^{1/2 - \e}))$, and capable of achieving the uniform sum rate of any binary input MAC with arbitrary many users. An application of this polar code construction to communicating on the AWGN channel is also discussed.

Connected through hyperedge HE-1 (induced by source paper "entropic matroids and their representation"):
  with members:
    - "polar codes for the two user multiple access channel"
    - "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"
    - "mutual information matroids and extremal dependencies"
    - "existence of new inequalities for representable polymatroids"

Connected through hyperedge HE-2 (induced by source paper "general strong polarization"):
  with members:
    - "on error correction performance and implementation of polar code list decoders for 5g"
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "polar codes for broadcast channels"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "an entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets"
    - "polar coding for interference networks"

Connected through hyperedge HE-3 (induced by source paper "polar codes for arbitrary classical quantum channels and arbitrary cq macs"):
  with members:
    - "fourier analysis of mac polarization"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "polar codes for the two user multiple access channel"
    - "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-4 (induced by source paper "relaxed polar codes"):
  with members:
    - "recursive constructions and their maximum likelihood decoding"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "polar codes for broadcast channels"
    - "fast polar decoders algorithm and implementation"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "compound polar codes"
    - "universal polar codes"

Connected through hyperedge HE-5 (induced by source paper "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"):
  with members:
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "polar codes for the two user multiple access channel"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-6 (induced by source paper "polar codes over fading channels with power and delay constraints"):
  with members:
    - "polar coding for block fading channels"
    - "an interleaver design for polar codes over slow fading channels"
    - "polar codes and polar lattices for independent fading channels"
    - "ber performance of polar coded ofdm in multipath fading"
    - "a comparative study of polar code constructions for the awgn channel"
    - "optimum power control at finite blocklength"
    - "polar coding for fading channels binary and exponential channel cases"
    - "list decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "fourier analysis of mac polarization"):
  with members:
    - "ergodic theory meets polarization ii a foundation of polarization theory"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "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 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-8 (induced by source paper "polar codes and polar lattices for independent fading channels"):
  with members:
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "polar codes for broadcast channels"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "construction of capacity achieving lattice codes polar lattices"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "achieving awgn channel capacity with lattice gaussian coding"

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)