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 "structured mappings and conferencing common information for multiple access channels"):
  Abstract: In this work, we study two problems: three-user Multiple-Access Channel (MAC) with correlated sources, and MAC with Feedback (MAC-FB) with independent messages. For the first problem, we identify a structure in the joint probability distribution of discrete memoryless sources, and define a new common information called ``conferencing common information". We develop a multi-user joint-source channel coding methodology based on structured mappings to encode this common information efficiently and to transmit it over a MAC. We derive a new set of sufficient conditions for this coding strategy using single-letter information quantities for arbitrary sources and channel distributions. Next, we make a fundamental connection between this problem and the problem of communication of independent messages over three-user MAC-FB. In the latter problem, although the messages are independent to begin with, they become progressively correlated given the channel output feedback. Subsequent communication can be modeled as transmission of correlated sources over MAC. Exploiting this connection, we develop a new coding scheme for the problem. We characterize its performance using single-letter information quantities, and derive an inner bound to the capacity region. For both problems, we provide a set of examples where these rate regions are shown to be optimal. Moreover, we analytically prove that this performance is not achievable using random unstructured random mappings/codes.

Includes members:
  Member "a new achievable rate region for multiple access channel with states":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how to compute modulo prime power sums")
  Member "quasi linear codes application to point to point and multi terminal source coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new achievable rate region for multiple access channel with states")
  Member "distributed simulation of continuous random variables":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constrained functional value under general convexity conditions with applications to distributed simulation")
  Member "exact common information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication for generating correlation a unifying survey")
  Member "on interference networks over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations")
  Member "achievable rate region for three user discrete broadcast channel based on coset codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "computing sum of sources over an arbitrary multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "private information retrieval over gaussian mac")

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)