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: "cyclic coded integer forcing equalization"
  Abstract: A discrete-time intersymbol interference channel with additive Gaussian noise is considered, where only the receiver has knowledge of the channel impulse response. An approach for combining decision-feedback equalization with channel coding is proposed, where decoding precedes the removal of intersymbol interference. This is accomplished by combining the recently proposed integer-forcing equalization approach with cyclic block codes. The channel impulse response is linearly equalized to an integer-valued response. This is then utilized by leveraging the property that a cyclic code is closed under (cyclic) integer-valued convolution. Explicit bounds on the performance of the proposed scheme are also derived.

Connected through hyperedge HE-1 (induced by source paper "reed muller codes achieve capacity on erasure channels"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "reed muller codes for random erasures and errors"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "channel coding the road to channel capacity"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "the generalized area theorem and some of its consequences"

Connected through hyperedge HE-2 (induced by source paper "integer forcing source coding"):
  with members:
    - "optimized backhaul compression for uplink cloud radio access network"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "a technique for deriving one shot achievability results in network information theory"
    - "an algebraic approach to physical layer network coding"
    - "coding and system design for quantize map and forward relaying"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward strategies for cooperative distributed antenna systems"

Connected through hyperedge HE-3 (induced by source paper "asynchronous physical layer network coding with quasi cyclic codes"):
  with members:
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "asynchronous convolutional coded physical layer network coding"
    - "an algebraic approach to physical layer network coding"
    - "asynchronous physical layer network coding"
    - "joint ldpc and physical layer network coding for asynchronous bi directional relaying"
    - "reliable physical layer network coding"
    - "integer forcing linear receivers"
    - "channel coding and decoding in a relay system operated with physical layer network coding"

Connected through hyperedge HE-4 (induced by source paper "integer forcing mimo linear receivers based on lattice reduction"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "practical encoders and decoders for euclidean codes from barnes wall lattices"
    - "on the proximity factors of lattice reduction aided decoding"
    - "diversity of mmse mimo receivers"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"

Connected through hyperedge HE-5 (induced by source paper "integer forcing linear receivers"):
  with members:
    - "lattices over eisenstein integers for compute and forward"
    - "successive integer forcing and its sum rate optimality"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "an algebraic approach to physical layer network coding"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "achieving a vanishing snr gap to exact lattice decoding at a subexponential complexity"

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)