human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "polar coding strategies for the interference channel with partially joint decoding"):
  Abstract: Existing polar coding schemes for the two-user interference channel follow the original idea of Han and Kobayashi, in which component messages are encoded independently and then mapped by some deterministic functions (i.e., homogeneous superposition coding). In this paper, we propose a new polar coding scheme for the interference channel based on the heterogeneous superposition coding approach of Chong, Motani and Garg. We prove that fully-joint decoding (the receivers simultaneously decode both senders' common messages and the intended sender's private message) in the Han-Kobayashi strategy can be simplified to two types of partially-joint decoding, which are friendly to polar coding with practical decoding algorithms. The proposed coding scheme requires less auxiliary random variables and no deterministic functions, and can be efficiently constructed. Further, we extend this result to interference networks and show that the proposed partially-joint decoding scheme is a general method for designing heterogeneous superposition polar coding schemes in interference networks.

Includes members:
  Member "achieving the uniform rate region of general multiple access channels by polar coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "channel coding at low capacity")
  Member "polar coding for processes with memory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "list decoding of universal polar codes")
  Member "optimal achievable rates for interference networks with random codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance of multi cell massive mimo systems with interference decoding")
  Member "polar codes for broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes simplicity random codes durability")
  Member "polar coding for the broadcast channel with confidential messages a random binning analogy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "how to achieve the capacity of asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar coding for interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "general strong polarization")
  Member "channel upgradation for non binary input alphabets and macs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "universal polarization for processes with memory")

Question: Please tell me which class the source paper 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)