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 "approaching single hop performance in multihop networks end to end known interference cancelation e2e kic"):
  Abstract: To improve the efficiency of wireless data communications, new physical-layer transmission methods based on known-interference cancelation (KIC) have been developed. These methods share the common idea that interference can be canceled when its content is known. Existing work on KIC mainly focuses on single-hop or two-hop networks, with physical-layer network coding and full-duplex communications as typical examples. This paper extends the idea of KIC to general multihop networks and proposes an end-to-end KIC (E2E-KIC) transmission method, together with its medium access control (MAC) design. With E2E-KIC, multiple nodes in a flow passing through a few nodes in an arbitrary topology can simultaneously transmit and receive on the same channel. We first present a theoretical analysis on the effectiveness of E2E-KIC in an idealized case. Then, to support E2E-KIC in multihop networks with an arbitrary topology, we propose an E2E-KIC-supported MAC protocol (E2E-KIC MAC), which is based on an extension of the Request-to-Send/Clear-to-Send mechanism in the IEEE 802.11 MAC. We also analytically analyze the performance of the proposed E2E-KIC MAC in the presence of hidden terminals. Simulation results illustrate that the proposed E2E-KIC MAC can improve network throughput and reduce end-to-end delay.

Includes members:
  Member "coding based data broadcasting for time critical applications with rate adaptation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on resource allocation in vehicular networks")
  Member "distributed mac protocol supporting physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reliable physical layer network coding supporting real applications")
  Member "blind known interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal spectrum sharing with arq based legacy users via chain decoding")
  Member "coordinating interfering transmissions in cooperative wireless lans":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed mac protocol supporting physical layer network coding")
  Member "pushing the limits of full duplex design and real time implementation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hybrid scheduling in heterogeneous half and full duplex wireless networks")

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.NI(Networking and Internet Architecture)