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: "bounded contention coding for wireless networks in the high snr regime"
  Abstract: Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communication in such networks. #R##N#This paper proposes a novel approach for wireless communication, which embraces collisions rather than avoiding them, over an additive channel. It introduces a coding technique called Bounded-Contention Coding (BCC) that allows collisions to be successfully decoded by the receiving nodes into the original transmissions and whose complexity depends on a bound on the contention among the transmitters. #R##N#BCC enables deterministic local broadcast in a network with n nodes and at most a transmitters with information of l bits each within O(a log n + al) bits of communication with full-duplex radios, and O((a log n + al)(log n)) bits, with high probability, with half-duplex radios. When combined with random linear network coding, BCC gives global broadcast within O((D + a + log n)(a log n + l)) bits, with high probability. This also holds in dynamic networks that can change arbitrarily over time by a worst-case adversary. When no bound on the contention is given, it is shown how to probabilistically estimate it and obtain global broadcast that is adaptive to the true contention in the network.

Connected through hyperedge HE-1 (induced by source paper "cross sender bit mixing coding"):
  with members:
    - "non adaptive group testing framework based on concatenation code"
    - "group testing using left and right regular sparse graph codes"
    - "nonadaptive group testing with random set of defectives"
    - "group testing schemes from codes and designs"
    - "saffron a fast efficient and robust framework for group testing based on sparse graph codes"
    - "computing in additive networks with bounded information codes"
    - "group testing algorithms bounds and simulations"
    - "on almost disjunct matrices for group testing"

Connected through hyperedge HE-2 (induced by source paper "a pseudo bayesian approach to sign compute resolve slotted aloha"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "characterization of coded random access with compressive sensing based multi user detection"
    - "sign compute resolve for random access"
    - "random access with physical layer network coding"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-3 (induced by source paper "identifying randomly activated users via sign compute resolve on graphs"):
  with members:
    - "a pseudo bayesian approach to sign compute resolve slotted aloha"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "coded random access applying codes on graphs to design random access protocols"
    - "coded random access how coding theory helps to build random access protocols"
    - "sign compute resolve for random access"
    - "aloha random access that operates as a rateless code"
    - "frameless aloha protocol for wireless networks"
    - "reliable physical layer network coding"

Connected through hyperedge HE-4 (induced by source paper "computing in additive networks with bounded information codes"):
  with members:
    - "the locality of distributed symmetry breaking"
    - "near optimal leader election in multi hop radio networks"
    - "wireless network information flow a deterministic approach"
    - "collision helps algebraic collision recovery for wireless erasure networks"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-5 (induced by source paper "sign compute resolve for random access"):
  with members:
    - "coded random access how coding theory helps to build random access protocols"
    - "aloha random access that operates as a rateless code"
    - "coded splitting tree protocols"
    - "spatially coupled random access on graphs"
    - "random access with physical layer network coding"
    - "a network coded diversity protocol for collision recovery in slotted aloha networks"
    - "frameless aloha protocol for wireless networks"
    - "reliable physical layer network coding"

Connected through hyperedge HE-6 (induced by source paper "near optimal leader election in multi hop radio networks"):
  with members:
    - "randomized broadcast in radio networks with collision detection"
    - "broadcast throughput in radio networks routing vs network coding"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "fast structuring of radio networks large for multi message communications"
    - "beeping a maximal independent set"
    - "wireless connectivity and capacity"
    - "analyzing network coding gossip made easy"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

Connected through hyperedge HE-7 (induced by source paper "analyzing network coding gossip made easy"):
  with members:
    - "optimal gossip with direct addressing"
    - "broadcast throughput in radio networks routing vs network coding"
    - "tight bounds for rumor spreading with vertex expansion"
    - "fast structuring of radio networks large for multi message communications"
    - "lower bounds on information dissemination in dynamic networks"
    - "tighter worst case bounds on algebraic gossip"
    - "simple fast and deterministic gossip and rumor spreading"
    - "network coded gossip with correlated data"

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