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: "communication over individual channels"
  Abstract: A communication problem in considered, where no mathematical model is specified for the channel. The achievable rates are determined as a function of the channel input and output sequences known a-posteriori, without assuming any a-priori relation between them. For discrete channels the empirical mutual information between the input and output sequences is shown to be achievable, while for continuous channels the achievable rate is based on the empirical correlation between the sequences. A rate-adaptive scheme employing feedback which achieves these rates asymptotically with a guaranteed reliability, without prior knowledge of the channel behavior, is presented.

Connected through hyperedge HE-1 (induced by source paper "robust gaussian joint source channel coding with a staircase distortion noise profile"):
  with members:
    - "robust gaussian joint source channel coding under the near zero bandwidth regime"
    - "minimum energy for gaussian joint source channel coding with a square law distortion noise profile"
    - "the porosity of additive noise sequences"
    - "interference channels with arbitrarily correlated sources"

Connected through hyperedge HE-2 (induced by source paper "minimum energy analysis for robust gaussian joint source channel coding with a square law profile"):
  with members:
    - "the porosity of additive noise sequences"
    - "interference channels with arbitrarily correlated sources"
    - "joint source channel coding with side information using hybrid digital analog codes"

Connected through hyperedge HE-3 (induced by source paper "on capacity achieving distributions over complex awgn channels under nonlinear power constraints and their applications to swipt"):
  with members:
    - "gaussian multiple access channels with one bit quantizer at the receiver"
    - "modulation design for wireless information and power transfer with nonlinear energy harvester modeling"
    - "on the capacity of swipt systems with a nonlinear energy harvesting circuit"
    - "wireless information and power transfer over an awgn channel nonlinearity and asymmetric gaussian signaling"
    - "prototyping and experimentation of a closed loop wireless power transmission with channel acquisition and waveform optimization"
    - "low complexity adaptive multisine waveform design for wireless power transfer"
    - "waveform design for wireless power transfer"
    - "waveform optimization for swipt with nonlinear energy harvester modeling"

Connected through hyperedge HE-4 (induced by source paper "layered black box behavioral interconnection perspective and applications to the problem of communication with fidelity criteria part i i i d sources"):
  with members:
    - "a randomized covering packing duality between source coding and channel coding"
    - "information spectrum approach to the source channel separation theorem"
    - "optimality and approximate optimality of source channel separation in networks"
    - "coding into a source a direct inverse rate distortion theorem"

Connected through hyperedge HE-5 (induced by source paper "universal decoding using a noisy codebook"):
  with members:
    - "reliability of universal decoding based on vector quantized codewords"
    - "universal decoding for arbitrary channels relative to a given class of decoding metrics"
    - "communication over individual channels a general framework"

Connected through hyperedge HE-6 (induced by source paper "on optimal latency of communications"):
  with members:
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "universal communication over arbitrarily varying channels"

Connected through hyperedge HE-7 (induced by source paper "universal decoding for source channel coding with side information"):
  with members:
    - "exact random coding error exponents of optimal bin index decoding"
    - "erasure list exponents for slepian wolf decoding"
    - "universal decoding for arbitrary channels relative to a given class of decoding metrics"
    - "multiuser random coding techniques for mismatched decoding"
    - "communication over individual channels a general framework"
    - "the porosity of additive noise sequences"
    - "universal communication part i modulo additive channels"
    - "relations between random coding exponents and the statistical physics of random codes"

Connected through hyperedge HE-8 (induced by source paper "searching with measurement dependent noise"):
  with members:
    - "a simple proof for the optimality of randomized posterior matching"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "collaborative 20 questions for target localization"
    - "boolean compressed sensing and noisy group testing"
    - "interference mitigation in large random wireless networks"
    - "zero rate feedback can achieve the empirical capacity"
    - "optimal feedback communication via posterior matching"

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)