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: "on the capacity advantage of a single bit"
  Abstract: In this work we study the capacity advantage achieved by adding a single bit of communication -- not a link of capacity 1 but a single bit over all time -- to a memoryless network. Specifically, we present a memoryless network in which adding a single bit of communication strictly increases the capacity region.

Connected through hyperedge HE-1 (induced by source paper "negligible cooperation contrasting the maximal and average error cases"):
  with members:
    - "strong converses are just edge removal properties"
    - "on the impact of a single edge on the network coding capacity"
    - "fundamental limits of communication with low probability of detection"
    - "network coding is zero error always possible"

Connected through hyperedge HE-2 (induced by source paper "can negligible cooperation increase network capacity the average error case"):
  with members:
    - "strong converses are just edge removal properties"
    - "on the impact of a single edge on the network coding capacity"
    - "network coding is zero error always possible"

Connected through hyperedge HE-3 (induced by source paper "strong converses are just edge removal properties"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "smoothing brascamp lieb inequalities and strong converses for common randomness generation"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "exponent function for one helper source coding problem at rates outside the rate region"
    - "strong converse exponent for degraded broadcast channels at rates outside the capacity region"
    - "strong converse theorems for degraded broadcast channels with feedback"
    - "equivalence for networks with adversarial state"
    - "a case where interference does not affect the channel dispersion"

Connected through hyperedge HE-4 (induced by source paper "can negligible cooperation increase network reliability"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "can negligible cooperation increase network reliability extended version"
    - "network coding is zero error always possible"

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)