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: "near capacity adaptive analog fountain codes for wireless channels"
  Abstract: In this paper, we propose a capacity-approaching analog fountain code (AFC) for wireless channels. In AFC, the number of generated coded symbols is potentially limitless. In contrast to the conventional binary rateless codes, each coded symbol in AFC is a real-valued symbol, generated as a weighted sum of d randomly selected information bits, where d and the weight coefficients are randomly selected from predefined probability mass functions. The coded symbols are then directly transmitted through wireless channels. We analyze the error probability of AFC and design the weight set to minimize the error probability. Simulation results show that AFC achieves the capacity of the Gaussian channel in a wide range of signal to noise ratio (SNR).

Connected through hyperedge HE-1 (induced by source paper "two layer coded channel access with collision resolution design and analysis"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "probabilistic rateless multiple access for machine to machine communication"
    - "scma for downlink multiple access of 5g wireless networks"
    - "aloha random access that operates as a rateless code"
    - "graph based random access for the collision channel without feedback capacity bound"
    - "high throughput random access via codes on graphs coded slotted aloha"

Connected through hyperedge HE-2 (induced by source paper "short block length codes for ultra reliable low latency communications"):
  with members:
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"

Connected through hyperedge HE-3 (induced by source paper "beam on graph simultaneous channel estimation for mmwave mimo systems with multiple users"):
  with members:
    - "fast channel estimation for millimetre wave wireless systems using overlapped beam patterns"
    - "multi user precoding and channel estimation for hybrid millimeter wave systems"
    - "millimeter wave mimo channel estimation using overlapped beam patterns and rate adaptation"
    - "race a rate adaptive channel estimation approach for millimeter wave mimo systems"
    - "fountain code inspired channel estimation for multi user millimeter wave mimo systems"
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "sparse signal recovery using generalized approximate message passing with built in parameter estimation"
    - "massive mimo ten myths and one critical question"

Connected through hyperedge HE-4 (induced by source paper "beam on graph simultaneous channel estimation in multi user millimeter wave mimo systems"):
  with members:
    - "fast channel estimation for millimetre wave wireless systems using overlapped beam patterns"
    - "multi user precoding and channel estimation for hybrid millimeter wave systems"
    - "millimeter wave mimo channel estimation using overlapped beam patterns and rate adaptation"
    - "race a rate adaptive channel estimation approach for millimeter wave mimo systems"
    - "fountain code inspired channel estimation for multi user millimeter wave mimo systems"
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "sparse signal recovery using generalized approximate message passing with built in parameter estimation"
    - "massive mimo ten myths and one critical question"

Connected through hyperedge HE-5 (induced by source paper "ultra reliable low latency cellular networks use cases challenges and approaches"):
  with members:
    - "massive non orthogonal multiple access for cellular iot potentials and limitations"

Connected through hyperedge HE-6 (induced by source paper "fountain code inspired channel estimation for multi user millimeter wave mimo systems"):
  with members:
    - "fast channel estimation for millimetre wave wireless systems using overlapped beam patterns"
    - "millimeter wave mimo channel estimation using overlapped beam patterns and rate adaptation"
    - "race a rate adaptive channel estimation approach for millimeter wave mimo systems"
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "massive mimo ten myths and one critical question"
    - "compressed sensing based multi user millimeter wave systems how many measurements are needed"
    - "channel estimation and hybrid precoding for millimeter wave cellular systems"

Connected through hyperedge HE-7 (induced by source paper "binary compressive sensing via analog fountain coding"):
  with members:
    - "wireless compressive sensing for energy harvesting sensor nodes"
    - "measure what should be measured progress and challenges in compressive sensing"
    - "model based compressive sensing"
    - "message passing algorithms for compressed sensing i motivation and construction"
    - "weighted superimposed codes and constrained integer compressed sensing"
    - "bayesian compressive sensing via belief propagation"

Connected through hyperedge HE-8 (induced by source paper "probabilistic rateless multiple access for machine to machine communication"):
  with members:
    - "fundamentals of throughput maximization with random arrivals for m2m communications"
    - "distributed raptor coding for erasure channels partially and fully coded cooperation"
    - "power efficient system design for cellular based machine to machine communications"
    - "on modulo sum computation over an erasure multiple access channel"
    - "spatially coupled random access on graphs"

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)