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: "extrinsic jensen shannon divergence applications to variable length coding"
  Abstract: This paper considers the problem of variable-length coding over a discrete memoryless channel with noiseless feedback. This paper provides a stochastic control view of the problem whose solution is analyzed via a newly proposed symmetrized divergence, termed extrinsic Jensen–Shannon (EJS) divergence. It is shown that strictly positive lower bounds on EJS divergence provide nonasymptotic upper bounds on the expected code length. This paper presents strictly positive lower bounds on EJS divergence, and hence nonasymptotic upper bounds on the expected code length, for the following two coding schemes: 1) variable-length posterior matching and 2) MaxEJS coding scheme that is based on a greedy maximization of the EJS divergence. As an asymptotic corollary of the main results, this paper also provides a rate–reliability test. Variable-length coding schemes that satisfy the condition(s) of the test for parameters    $R$    and    $E$    are guaranteed to achieve a rate    $R$    and an error exponent    $E$   . The results are specialized for posterior matching and MaxEJS to obtain deterministic one-phase coding schemes achieving capacity and optimal error exponent. For the special case of symmetric binary-input channels, simpler deterministic schemes of optimal performance are proposed and analyzed.

Connected through hyperedge HE-1 (induced by source paper "low complexity algorithms for transmission of short blocks over the bsc with full feedback"):
  with members:
    - "finite blocklength performance of sequential transmission over bsc with noiseless feedback"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-2 (induced by source paper "decentralized sequential active hypothesis testing and the mac feedback capacity"):
  with members:
    - "active sequential hypothesis testing"
    - "decentralized stochastic control with partial history sharing a common information approach"

Connected through hyperedge HE-3 (induced by source paper "active learning and csi acquisition for mmwave initial alignment"):
  with members:
    - "improved target acquisition rates with feedback codes"
    - "linear block coding for efficient beam discovery in millimeter wave communication networks"
    - "overview of millimeter wave communications for fifth generation 5g wireless networks with a focus on propagation models"
    - "comparative analysis of initial access techniques in 5g mmwave cellular networks"
    - "hybrid beamforming for massive mimo a survey"
    - "active learning from imperfect labelers"
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "a simple proof for the optimality of randomized posterior matching"

Connected through hyperedge HE-4 (induced by source paper "construction and analysis of posterior matching in arbitrary dimensions via optimal transport"):
  with members:
    - "variable length codes for channels with memory and feedback error exponent lower bounds"
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "a simple proof for the optimality of randomized posterior matching"
    - "searching with measurement dependent noise"
    - "collaborative 20 questions for target localization"
    - "bit wise unequal error protection for variable length block codes with feedback"
    - "active sequential hypothesis testing"
    - "information theoretic viewpoints on optimal causal coding decoding problems"

Connected through hyperedge HE-5 (induced by source paper "finite blocklength performance of sequential transmission over bsc with noiseless feedback"):
  with members:
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-6 (induced by source paper "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"):
  with members:
    - "asymptotics of input constrained erasure channel capacity"
    - "dual capacity upper bounds for noisy runlength constrained channels"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "a simple proof for the optimality of randomized posterior matching"
    - "can feedback increase the capacity of the energy harvesting channel"
    - "capacity and coding for the ising channel with feedback"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-7 (induced by source paper "feedback capacity and coding for the 0 k rll input constrained bec"):
  with members:
    - "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "a simple proof for the optimality of randomized posterior matching"
    - "modulation coding for flash memories"
    - "capacity and coding for the ising channel with feedback"
    - "optimal feedback communication via posterior matching"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-8 (induced by source paper "moderate deviation asymptotics for variable length codes with feedback"):
  with members:
    - "streaming data transmission in the moderate deviations and central limit regimes"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "moderate deviations in channel coding"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "opportunistic capacity and error exponent regions for compound channel with feedback"
    - "optimal feedback communication via posterior matching"
    - "a simple converse of burnashev s reliability function"
    - "error exponents for variable length block codes with feedback and cost constraints"

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)