human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "can negligible cooperation increase network reliability"):
  Abstract: In network cooperation strategies, nodes work together with the aim of increasing transmission rates or reliability. This paper demonstrates that enabling cooperation between the transmitters of a two-user multiple access channel via a cooperation facilitator that has access to both messages, always results in a network whose maximal- and average-error sum-capacities are the same—even when the information shared with the encoders is negligible. Thus, for a multiple access channel whose maximal- and average-error sum-capacities differ, the maximal-error sum-capacity is not continuous with respect to the output edge capacities of the facilitator. This shows that for some networks, sharing even a negligible number of bits per channel use with the encoders can yield a non-negligible benefit.

Includes members:
  Member "on the impact of a single edge on the network coding capacity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a local perspective on the edge removal problem")
  Member "on the capacity advantage of a single bit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "negligible cooperation contrasting the maximal and average error cases")
  Member "can negligible cooperation increase network reliability extended version":
    also connected through other hyperedges:
      (none)
  Member "network coding is zero error always possible":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lossless source coding in the point to point multiple access and random access scenarios")

Question: Please tell me which class the source paper 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)