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: "zero rate feedback can achieve the empirical capacity"
  Abstract: The utility of limited feedback for coding over an individual sequence of discrete memoryless channels is investigated. This study complements recent results showing how limited or noisy feedback can boost the reliability of communication. A strategy with fixed input distribution P is given that asymptotically achieves rates arbitrarily close to the mutual information induced by P and the state-averaged channel. When the capacity-achieving input distribution is the same over all channel states, this achieves rates at least as large as the capacity of the state-averaged channel, sometimes called the empirical capacity.

Connected through hyperedge HE-1 (induced by source paper "learning an adversary s actions for secret communication"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"
    - "a new wiretap channel model and its strong secrecy capacity"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "list decoding random coding exponents and expurgated exponents"
    - "capacity results for arbitrarily varying wiretap channels"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"

Connected through hyperedge HE-2 (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"
    - "communication over individual channels"
    - "interference mitigation in large random wireless networks"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-3 (induced by source paper "scheduling of multicast and unicast services under limited feedback by using rateless codes"):
  with members:
    - "network control without csi using rateless codes for downlink cellular systems"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "de randomizing shannon the design and analysis of a capacity achieving rateless code"
    - "throughput of rateless codes over broadcast erasure channels"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"

Connected through hyperedge HE-4 (induced by source paper "universal communication part ii channels with memory"):
  with members:
    - "the porosity of additive noise sequences"
    - "universal communication over arbitrarily varying channels"
    - "communication over individual channels"
    - "universal communication part i modulo additive channels"

Connected through hyperedge HE-5 (induced by source paper "communication over individual channels a general framework"):
  with members:
    - "communication over individual channels"
    - "an achievable rate for the mimo individual channel"
    - "universal communication part i modulo additive channels"

Connected through hyperedge HE-6 (induced by source paper "the porosity of additive noise sequences"):
  with members:
    - "achieving the empirical capacity using feedback part i memoryless additive models"

Connected through hyperedge HE-7 (induced by source paper "universal communication over arbitrarily varying channels"):
  with members:
    - "communication over individual channels"
    - "universal communication part i modulo additive channels"
    - "achieving the empirical capacity using feedback part i memoryless additive models"

Connected through hyperedge HE-8 (induced by source paper "communication over individual channels"):
  with members:
    - "an achievable rate for the mimo individual channel"
    - "coding into a source a direct inverse rate distortion theorem"

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)