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 "achievability performance bounds for integer forcing source coding"):
  Abstract: Integer-forcing source coding has been proposed as a low-complexity method for compression of distributed correlated Gaussian sources. In this scheme, each encoder quantizes its observation using the same fine lattice and reduces the result modulo a coarse lattice. Rather than directly recovering the individual quantized signals, the decoder first recovers a full-rank set of judiciously chosen integer linear combinations of the quantized signals, and then inverts it. It has been observed that the method works very well for "most" but not all source covariance matrices. The present work quantifies the measure of bad covariance matrices by studying the probability that integer-forcing source coding fails as a function of the allocated rate, %in excess of the %Berger-Tung benchmark, where the probability is with respect to a random orthonormal transformation that is applied to the sources prior to quantization. For the important case where the signals to be compressed correspond to the antenna inputs of relays in an i.i.d. Rayleigh fading environment, this orthonormal transformation can be viewed as being performed by nature. Hence, the results provide performance guarantees for distributed source coding via integer forcing in this scenario.

Includes members:
  Member "blind unwrapping of modulo reduced gaussian vectors recovering msbs from lsbs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on unlimited sampling and reconstruction")
  Member "outage behavior of integer forcing with random unitary pre processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "successive integer forcing and its sum rate optimality":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "integer forcing source coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private information retrieval over gaussian mac")
  Member "a simple proof for the existence of good pairs of nested lattices":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)