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: "exponent function for one helper source coding problem at rates outside the rate region"
  Abstract: We consider the one helper source coding problem posed and investigated by Ahlswede, K\"orner and Wyner. In this system, the error probability of decoding goes to one as the source block length $n$ goes to infinity. This implies that we have a strong converse theorem for the one helper source coding problem. In this paper we provide a much stronger version of this strong converse theorem for the one helper source coding problem. We prove that the error probability of decoding tends to one exponentially and derive an explicit lower bound of this exponent function.

Connected through hyperedge HE-1 (induced by source paper "exponential strong converse for successive refinement with causal decoder side information"):
  with members:
    - "strong converse using change of measure arguments"
    - "exponential strong converse for content identification with lossy recovery"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "new strong converse for asymmetric broadcast channels"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "on cooperative multiple access channels with delayed csi at transmitters"

Connected through hyperedge HE-2 (induced by source paper "a new inequality related to proofs of strong converse theorems for source or channel networks"):
  with members:
    - "strong converse using change of measure arguments"
    - "new strong converse for asymmetric broadcast channels"

Connected through hyperedge HE-3 (induced by source paper "information theoretic security for broadcasting of two encrypted sources under side channel attacks"):
  with members:
    - "information theoretic security for side channel attacks to the shannon cipher system"

Connected through hyperedge HE-4 (induced by source paper "strong converse using change of measure arguments"):
  with members:
    - "a new proof of nonsignalling multiprover parallel repetition theorem"
    - "communication for generating correlation a survey"
    - "communication for generating correlation a unifying survey"
    - "improved finite blocklength converses for slepian wolf coding via linear programming"
    - "second order region for gray wyner network"
    - "strong converses are just edge removal properties"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "wiretap channel capacity secrecy criteria strong converse and phase change"

Connected through hyperedge HE-5 (induced by source paper "dispersion bound for the wyner ahlswede k orner network via reverse hypercontractivity on types"):
  with members:
    - "strong converse using change of measure arguments"
    - "exponential strong converse for content identification with lossy recovery"
    - "information theoretic perspectives on brascamp lieb inequality and its reverse"
    - "a converse bound on wyner ahlswede k orner network via gray wyner network"
    - "brascamp lieb inequality and its reverse an information theoretic view"
    - "asymptotic estimates in information theory with non vanishing error probabilities"

Connected through hyperedge HE-6 (induced by source paper "information theoretic security for side channel attacks to the shannon cipher system"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-7 (induced by source paper "strong converse for hypothesis testing against independence over a two hop network"):
  with members:
    - "exponent function for source coding with side information at the decoder at rates below the rate distortion function"

Connected through hyperedge HE-8 (induced by source paper "exponential strong converse for content identification with lossy recovery"):
  with members:
    - "refined asymptotics for rate distortion using gaussian codebooks for arbitrary sources"
    - "second order region for gray wyner network"
    - "the dispersion of universal joint source channel coding for arbitrary sources and additive channels"
    - "non asymptotic converse bounds and refined asymptotics for two lossy source coding problems"
    - "wyner s common information under r enyi divergence measures"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "new strong converse for asymmetric broadcast channels"
    - "achievable moderate deviations asymptotics for streaming compression of correlated sources"

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)