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 "is non unique decoding necessary"):
  Abstract: In multi-terminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi (1981) proposed a receiving strategy which performs a joint unique decoding of messages of interest along with a subset of messages which are not of interest. It is now well-known that this provides an achievable region which is, in general, larger than if the receiver treats all messages not of interest as noise. Nair and El Gamal (2009) and Chong, Motani, Garg, and El Gamal (2008) independently proposed a generalization called indirect or non-unique decoding where the receiver uses the codebook structure of the messages to uniquely decode only its messages of interest. Non-unique decoding has since been used in various scenarios. #R##N#The main result in this paper is to provide an interpretation and a systematic proof technique for why non-unique decoding, in all known cases where it has been employed, can be replaced by a particularly designed joint unique decoding strategy, without any penalty from a rate region viewpoint.

Includes members:
  Member "hybrid coding an interface for joint source channel coding and network communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the likelihood encoder for lossy compression")
  Member "simultaneous nonunique decoding is rate optimal":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "capacity region of multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi layer gelfand pinsker strategies for the generalized multiple access channel")
  Member "interference decoding for deterministic channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance of multi cell massive mimo systems with interference decoding")
  Member "an achievability scheme for the compound channel with state noncausally available at the encoder":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "on the optimal compressions in the compress and forward relay schemes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the rate distortion function of asynchronously sampled memoryless cyclostationary gaussian processes")

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)