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 marton s region for broadcast channels using polar codes"
  Abstract: We present polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region up to date, and it is tight for all classes of 2-user DM-BCs whose capacity regions are known. Due to space limitations, this paper describes polar codes for the superposition strategy. The scheme for the achievability of Marton's region is presented in the longer version [1], and it is based on a combination of superposition coding and binning. We follow the lead of the recent work by Goela, Abbe, and Gastpar, who introduce polar codes emulating these two information-theoretic techniques. In order to align the polar indices, for both schemes, their solution involves some degradedness constraints that are assumed to hold between the auxiliary random variables and the channel outputs. To remove these constraints, we consider the transmission of k blocks, and employ chaining constructions that guarantee the proper alignment of polarized indices. The techniques described in this work are quite general, and they can be adopted in many other multi-terminal scenarios whenever there is the need for the aligning of polar indices.

Connected through hyperedge HE-1 (induced by source paper "achieving the uniform rate region of general multiple access channels by polar coding"):
  with members:
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar coding for interference networks"
    - "compound polar codes"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "list decoding of polar codes"
    - "polar codes for the two user multiple access channel"
    - "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-2 (induced by source paper "polar coding for non stationary channels"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "finite length scaling for polar codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "improved bounds on the finite length scaling of polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "on the rate of channel polarization"

Connected through hyperedge HE-3 (induced by source paper "polar codes for broadcast channels"):
  with members:
    - "a comparison of superposition coding schemes"
    - "polar codes for the two user multiple access channel"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "polar codes for q ary channels q 2 r"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "multilevel polarization of polar codes over arbitrary discrete memoryless channels"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"

Connected through hyperedge HE-4 (induced by source paper "polar codes for distributed hierarchical source coding"):
  with members:
    - "polar codes for some multi terminal communications problems"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "interactive function computation via polar coding"
    - "polar codes for the two user multiple access channel"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "polar codes for q ary channels q 2 r"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "polar codes for the m user mac"

Connected through hyperedge HE-5 (induced by source paper "lossy compression with privacy constraints optimality of polar codes"):
  with members:
    - "polar codes for broadcast channels"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "lossy source coding with reconstruction privacy"
    - "from the information bottleneck to the privacy funnel"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "rate distortion theory for secrecy systems"
    - "calibrating data to sensitivity in private data analysis"
    - "polar codes are optimal for lossy source coding"

Connected through hyperedge HE-6 (induced by source paper "rewriting flash memories by message passing"):
  with members:
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "trajectory codes for flash memory"
    - "polar write once memory codes"
    - "on coding efficiency for flash memories"
    - "iterative quantization using codes on graphs"

Connected through hyperedge HE-7 (induced by source paper "how to achieve the capacity of asymmetric channels"):
  with members:
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "construction of polar codes with sublinear complexity"
    - "polar codes for broadcast channels"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "threshold analysis of non binary spatially coupled ldpc codes with windowed decoding"

Connected through hyperedge HE-8 (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"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "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"

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)