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 multiple access channels using polar codes"
  Abstract: Designing polar codes for transmission over two-user multiple access channels is considered. In the proposed scheme, both users encode their messages using a polar encoder, while a joint successive cancellation decoder is deployed at the receiver. The encoding is done separately, while the codes are constructed jointly. This is done by treating the whole polar transformation on both users as a single polar transformation, wherein the multiple access channel (MAC) is regarded as one more level of polarization. We prove that our scheme achieves the whole uniform rate region by changing the decoding order in the joint successive cancellation decoder. Various simulation results over binary-additive Gaussian noise MAC are provided. At the end, a comparison is made with the existing results on polar codes for multiple access channels to emphasize the differences and the main advantages of our scheme.

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

Connected through hyperedge HE-2 (induced by source paper "achieving the uniform rate region of general multiple access channels by polar coding"):
  with members:
    - "achieving marton s region for broadcast channels using polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar coding for interference networks"
    - "compound 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-3 (induced by source paper "achieving marton s region for broadcast channels using polar codes"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "polar coding for interference networks"
    - "a comparison of superposition coding schemes"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "universal polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"

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)