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: "achieving the uniform rate region of general multiple access channels by polar coding"
  Abstract: We consider the problem of polar coding for transmission over   $m$  -user multiple access channels. In the proposed scheme, all users encode their messages using a polar encoder, while a multiuser successive cancellation decoder is deployed at the receiver. The encoding is done separately across the users and is independent of the target achievable rate. For the code construction, the positions of information bits and frozen bits for each of the users are decided jointly. This is done by treating the polar transformations across all the   $m$   users as a single polar transformation with a certain  polarization base . We characterize the resolution of achievable rates on the dominant face of the uniform rate region in terms of the number of users   $m$   and the length of the polarization base   $L$  . In particular, we prove that for any target rate on the dominant face, there exists an achievable rate, also on the dominant face, within the distance at most   $\frac{(m-1)\sqrt{m}}{L}$   from the target rate. We then prove that the proposed MAC polar coding scheme achieves the whole uniform rate region with fine enough resolution by changing the decoding order in the multiuser successive cancellation decoder, as   $L$   and the code block length   $N$   grow large. The encoding and decoding complexities are   $O(N \log N)$   and the asymptotic block error probability of   $O(2^{-N^{0.5 - \epsilon}})$   is guaranteed. Examples of achievable rates for the 3-user multiple access channel are provided.

Connected through hyperedge HE-1 (induced by source paper "channel coding at low capacity"):
  with members:
    - "polar codes with a stepped boundary"
    - "recursive list decoding for reed muller codes"
    - "beta beta bounds finite blocklength analog of the golden formula"
    - "relaxed polar codes"
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
    - "polar codes for broadcast channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"

Connected through hyperedge HE-2 (induced by source paper "binary linear codes with optimal scaling polar codes with large kernels"):
  with members:
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "construction of polar codes with sublinear complexity"
    - "finite length scaling for polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-3 (induced by source paper "relaxed polar codes"):
  with members:
    - "recursive constructions and their maximum likelihood decoding"
    - "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"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "polar coding for the cognitive interference channel with confidential messages"):
  with members:
    - "secure polar coding for the two way wiretap channel"
    - "polar codes for broadcast 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"
    - "polar codes for the two user multiple access channel"

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"
    - "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"
    - "achieving the capacity of any dmc using only polar codes"

Connected through hyperedge HE-6 (induced by source paper "secure polar coding for the two way wiretap channel"):
  with members:
    - "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"
    - "channel upgradation for non binary input alphabets and macs"
    - "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:
    - "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"
    - "channel upgradation for non binary input alphabets and macs"
    - "polar coding for secret key generation"

Connected through hyperedge HE-8 (induced by source paper "polar codes for broadcast channels with receiver message side information and noncausal state available at the encoder"):
  with members:
    - "polar codes for broadcast channels"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "polar coding for interference networks"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "polar codes for the two user multiple access channel"
    - "achieving the capacity of any dmc using only polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "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)