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 coding for interference networks"
  Abstract: A polar coding scheme for interference networks is introduced. The scheme combines Arikan's monotone chain rules for multiple-access channels and a method by Hassani and Urbanke to 'align' two incompatible polarization processes. It achieves the Han--Kobayashi inner bound for two-user interference channels and generalizes to interference networks.

Connected through hyperedge HE-1 (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 codes speed of polarization and polynomial gap to capacity"

Connected through hyperedge HE-2 (induced by source paper "sliding window superposition coding two user interference channels"):
  with members:
    - "optimal achievable rates for interference networks with random codes"
    - "is non unique decoding necessary"
    - "a comparison of superposition coding schemes"
    - "rate splitting in the presence of multiple receivers"
    - "universal codes for the gaussian mac via spatial coupling"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "to decode the interference or to consider it as noise"

Connected through hyperedge HE-3 (induced by source paper "polar coding strategies for the interference channel with partially joint decoding"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "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"
    - "channel upgradation for non binary input alphabets and macs"
    - "polar coding for secret key generation"

Connected through hyperedge HE-4 (induced by source paper "strong secrecy on a class of degraded broadcast channels using polar codes"):
  with members:
    - "a comparative study of polar code constructions for the awgn 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"
    - "an information theoretic approach to secret sharing"
    - "polar coding for secret key generation"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "entropy bounds for discrete random variables via maximal coupling"

Connected through hyperedge HE-5 (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"
    - "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"

Connected through hyperedge HE-6 (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"
    - "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-7 (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"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "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"

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"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "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)