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: "itlinq a new approach for spectrum sharing in device to device communication systems"
  Abstract: We consider the problem of spectrum sharing in device-to-device communication systems. Inspired by the recent optimality condition for treating interference as noise, we define a new concept of "information-theoretic independent sets" (ITIS), which indicates the sets of links for which simultaneous communication and treating the interference from each other as noise is information-theoretically optimal (to within a constant gap). Based on this concept, we develop a new spectrum sharing mechanism, called "information-theoretic link scheduling" (ITLinQ), which at each time schedules those links that form an ITIS. We first provide a performance guarantee for ITLinQ by characterizing the fraction of the capacity region that it can achieve in a network with sources and destinations located randomly within a fixed area. Furthermore, we demonstrate how ITLinQ can be implemented in a distributed manner, using an initial 2-phase signaling mechanism which provides the required channel state information at all the links. Through numerical analysis, we show that distributed ITLinQ can outperform similar state-of-the-art spectrum sharing mechanisms, such as FlashLinQ, by more than a 100% of sum-rate gain, while keeping the complexity at the same level. Finally, we discuss a variation of the distributed ITLinQ scheme which can also guarantee fairness among the links in the network and numerically evaluate its performance.

Connected through hyperedge HE-1 (induced by source paper "topological interference management with just retransmission what are the best topologies"):
  with members:
    - "when does an ensemble of matrices with randomly scaled rows lose rank"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "resolving entanglements in topological interference management with alternating connectivity"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-2 (induced by source paper "caching eliminates the wireless bottleneck in video aware wireless networks"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "adaptive video streaming for wireless networks with multiple users and helpers"
    - "adaptive video streaming in mu mimo networks"
    - "base station assisted device to device communications for high throughput wireless video networks"
    - "the throughput outage tradeoff of wireless one hop caching networks"
    - "fundamental limits of distributed caching in d2d wireless networks"
    - "wireless device to device communications with distributed caching"
    - "fundamental limits of caching"

Connected through hyperedge HE-3 (induced by source paper "the degrees of freedom of multi way device to device communications is limited by 2"):
  with members:
    - "a survey on device to device communication in cellular networks"
    - "approximate sum capacity of the y channel"
    - "the degrees of freedom of the mimo y channel"
    - "signal space alignment for the gaussian y channel"
    - "compute and forward harnessing interference through structured codes"
    - "interference alignment and the degrees of freedom for the k user interference channel"

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)