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: "integer forcing source coding"
  Abstract: Integer-Forcing (IF) is a new framework, based on compute-and-forward, for decoding multiple integer linear combinations from the output of a Gaussian multiple-input multiple-output channel. This work applies the IF approach to arrive at a new low-complexity scheme, IF source coding, for distributed lossy compression of correlated Gaussian sources under a minimum mean squared error distortion measure. All encoders use the same nested lattice codebook. Each encoder quantizes its observation using the fine lattice as a quantizer and reduces the result modulo the coarse lattice, which plays the role of binning. 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. In general, the linear combinations have smaller average powers than the original signals. This allows to increase the density of the coarse lattice, which in turn translates to smaller compression rates. We also propose and analyze a one-shot version of IF source coding, that is simple enough to potentially lead to a new design principle for analog-to-digital converters that can exploit spatial correlations between the sampled signals.

Connected through hyperedge HE-1 (induced by source paper "integer forcing architectures for uplink cloud radio access networks"):
  with members:
    - "achievability performance bounds for integer forcing source coding"
    - "green heterogeneous cloud radio access networks potential techniques performance trade offs and challenges"
    - "on the optimal fronthaul compression and decoding strategies for uplink cloud radio access networks"
    - "outage behavior of integer forcing with random unitary pre processing"
    - "fronthaul compression and transmit beamforming optimization for multi antenna uplink c ran"
    - "system architecture and key technologies for 5g heterogeneous cloud radio access networks"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "optimized backhaul compression for uplink cloud radio access network"

Connected through hyperedge HE-2 (induced by source paper "blind unwrapping of modulo reduced gaussian vectors recovering msbs from lsbs"):
  with members:
    - "a modulo based architecture for analog to digital conversion"
    - "on unlimited sampling"
    - "universal rate efficient scalar quantization"

Connected through hyperedge HE-3 (induced by source paper "above the nyquist rate modulo folding does not hurt"):
  with members:
    - "blind unwrapping of modulo reduced gaussian vectors recovering msbs from lsbs"
    - "a modulo based architecture for analog to digital conversion"
    - "on unlimited sampling"

Connected through hyperedge HE-4 (induced by source paper "a modulo based architecture for analog to digital conversion"):
  with members:
    - "on unlimited sampling"
    - "performance analysis and optimal filter design for sigma delta modulation via duality with dpcm"
    - "massive mimo for next generation wireless systems"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "universal rate efficient scalar quantization"
    - "from theory to practice sub nyquist sampling of sparse wideband analog signals"

Connected through hyperedge HE-5 (induced by source paper "some properties of successive minima and their applications"):
  with members:
    - "integer forcing architectures for uplink cloud radio access networks"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "a modified kz reduction algorithm"
    - "an algebraic approach to physical layer network coding"
    - "partial lll reduction"
    - "integer forcing linear receivers"

Connected through hyperedge HE-6 (induced by source paper "achievability performance bounds for integer forcing source coding"):
  with members:
    - "blind unwrapping of modulo reduced gaussian vectors recovering msbs from lsbs"
    - "outage behavior of integer forcing with random unitary pre processing"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-7 (induced by source paper "uplink downlink duality for integer forcing"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "lattices over eisenstein integers for compute and forward"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "an algebraic approach to physical layer network coding"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "integer forcing mimo linear receivers based on lattice reduction"

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)