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: "an elias bound on the bhattacharyya distance of codes for channels with a zero error capacity"
  Abstract: In this paper, we propose an upper bound on the minimum Bhattacharyya distance of codes for channels with a zero-error capacity. The bound is obtained by combining an extension of the Elias bound introduced by Blahut, with an extension of a bound previously introduced by the author, which builds upon ideas of Gallager, Lov\'asz and Marton.

Connected through hyperedge HE-1 (induced by source paper "variable length coding for zero error channel capacity"):
  with members:
    - "zero error capacity of duplication channels"
    - "bounds on the reliability of typewriter channels"
    - "zero error capacity of p ary shift channels and fifo queues"
    - "the rho capacity of a graph"
    - "uncertain wiretap channels and secure estimation"
    - "rate distance tradeoff for codes above graph capacity"
    - "secure estimation and zero error secrecy capacity"
    - "graph information ratio"

Connected through hyperedge HE-2 (induced by source paper "adaptive causal network coding with feedback"):
  with members:
    - "resource allocation and harq optimization for urllc traffic in 5g wireless networks"
    - "tiny codes for guaranteeable delay"
    - "complete mdp convolutional codes"
    - "throughput maximization for delay sensitive random access communication"
    - "analysis of feedback error in automatic repeat request"
    - "low delay random linear coding over a stream"
    - "the effect of block wise feedback on the throughput delay trade off in streaming"
    - "on the delay advantage of coding in packet erasure networks"

Connected through hyperedge HE-3 (induced by source paper "elias bound for general distances and stable sets in edge weighted graphs"):
  with members:
    - "constant compositions in the sphere packing bound for classical quantum channels"
    - "lower bounds on the probability of error for classical and classical quantum channels"

Connected through hyperedge HE-4 (induced by source paper "constant compositions in the sphere packing bound for classical quantum channels"):
  with members:
    - "elias bound for general distances and stable sets in edge weighted graphs"
    - "lower bounds on the probability of error for classical and classical quantum channels"

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)