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: "rateless coding for gaussian channels"
  Abstract: A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. We show by construction that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channels. Our construction involves the use of layered encoding and successive decoding, together with repetition using time-varying layer weights. As an illustration of our framework, we design a practical three-rate code family. We further construct rich sets of near-perfect rateless codes within our architecture that require either significantly fewer layers or lower complexity than their perfect counterparts. Variations of the basic construction are also developed, including one for time-varying channels in which there is no a priori stochastic model.

Connected through hyperedge HE-1 (induced by source paper "a framework for rate efficient control of distributed discrete systems"):
  with members:
    - "interactive scalar quantization for distributed resource allocation"
    - "overhead performance tradeoffs a resource allocation perspective"
    - "distributed function computation over a rooted directed tree"
    - "the complexity of decentralized control of markov decision processes"
    - "maa a heuristic search algorithm for solving decentralized pomdps"
    - "anytime reliable codes for stabilizing plants over erasure channels"
    - "optimal and approximate q value functions for decentralized pomdps"
    - "the communicative multiagent team decision problem analyzing teamwork theories and models"

Connected through hyperedge HE-2 (induced by source paper "capacity achieving rateless polar codes"):
  with members:
    - "capacity achieving rate compatible polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "dynamic transmit covariance design in mimo fading systems with unknown channel distributions and inaccurate channel state information"):
  with members:
    - "learning in an uncertain world mimo covariance matrix optimization with imperfect feedback"
    - "adaptive power allocation and control in time varying multi carrier mimo networks"
    - "learning to be green robust energy efficiency maximization in dynamic mimo ofdm systems"
    - "capacity achieving rateless polar codes"

Connected through hyperedge HE-4 (induced by source paper "joint unitary triangularization for gaussian multi user mimo networks"):
  with members:
    - "joint unitary triangularization for mimo networks"
    - "physical layer mimo relaying"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-5 (induced by source paper "rateless lossy compression via the extremes"):
  with members:
    - "lossy compression via sparse linear regression computationally efficient encoding and decoding"
    - "lossy compression via sparse linear regression performance under minimum distance encoding"
    - "the gaussian rate distortion function of sparse regression codes with optimal encoding"
    - "network compression worst case analysis"
    - "fixed length lossy compression in the finite blocklength regime"
    - "incremental refinement using a gaussian test channel"
    - "the dispersion of joint source channel coding"
    - "polar codes are optimal for lossy source coding"

Connected through hyperedge HE-6 (induced by source paper "network control without csi using rateless codes for downlink cellular systems"):
  with members:
    - "de randomizing shannon the design and analysis of a capacity achieving rateless code"
    - "joint scheduling and resource allocation in ofdma downlink systems via ack nak feedback"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "joint scheduling and arq for mu mimo downlink in the presence of inter cell interference"

Connected through hyperedge HE-7 (induced by source paper "overhead performance tradeoffs a resource allocation perspective"):
  with members:
    - "distributed function computation over a rooted directed tree"
    - "distributed scalar quantization for computing high resolution analysis and extensions"
    - "interaction strictly improves the wyner ziv rate distortion function"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-8 (induced by source paper "deterministic rateless codes for bsc"):
  with members:
    - "de randomizing shannon the design and analysis of a capacity achieving rateless code"

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)