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: "unbounded contention resolution in multiple access channels"
  Abstract: A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows only for one user each time. The application of efficient solutions for this problem spans a myriad of settings such as radio communication networks or databases. For the case where the number of users is unknown, recent work has yielded fruitful results for local area networks and radio networks, although either a (possibly loose) upper bound on the number of users needs to be known, or the solution is suboptimal, or it is only implicit or embedded in other problems, with bounds proved only asymptotically. In this paper, under the assumption that collision detection or information on the number of contenders is not available, we present a novel protocol for contention resolution in radio networks, and we recreate a protocol previously used for other problems, tailoring the constants for our needs. In contrast with previous work, both protocols are proved to be optimal up to a small constant factor and with high probability for big enough number of contenders. Additionally, the protocols are evaluated and contrasted with the previous work by extensive simulations. The evaluation shows that the complexity bounds obtained by the analysis are rather tight, and that both protocols proposed have small and predictable complexity for many system sizes (unlike previous proposals).

Connected through hyperedge HE-1 (induced by source paper "singletons for simpletons revisiting windowed backoff using chernoff bounds"):
  with members:
    - "the energy complexity of broadcast"
    - "exponential separations in the energy complexity of leader election"
    - "scalable wake up of multi channel single hop radio networks"
    - "fast and robust compressive phase retrieval with sparse graph codes"
    - "a jamming resistant mac protocol for multi hop wireless networks"

Connected through hyperedge HE-2 (induced by source paper "information gathering in ad hoc radio networks"):
  with members:
    - "information gathering in ad hoc radio networks with tree topology"

Connected through hyperedge HE-3 (induced by source paper "near optimal noisy group testing via separate decoding of items"):
  with members:
    - "performance of group testing algorithms with near constant tests per item"
    - "the capacity of bernoulli nonadaptive group testing"
    - "on the optimality of some group testing algorithms"
    - "converse bounds for noisy group testing with arbitrary measurement matrices"
    - "asymptotics of fingerprinting and group testing tight bounds from channel capacities"
    - "limits on support recovery with probabilistic models an information theoretic framework"
    - "computationally tractable algorithms for finding a subset of non defective items from a large population"
    - "saffron a fast efficient and robust framework for group testing based on sparse graph codes"

Connected through hyperedge HE-4 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels"):
  with members:
    - "randomized communication in radio networks"
    - "scalable wake up of multi channel single hop radio networks"
    - "broadcasting in ad hoc multiple access channels"
    - "competitive mac under adversarial sinr"
    - "adversarial multiple access channels with individual injection rates"
    - "maximum throughput of multiple access channels in adversarial environments"
    - "source routing and scheduling in packet networks"

Connected through hyperedge HE-5 (induced by source paper "naming a channel with beeps"):
  with members:
    - "randomized communication in radio networks"
    - "asynchronous broadcasting with bivalent beeps"
    - "scalable wake up of multi channel single hop radio networks"
    - "feedback from nature simple randomised distributed algorithms for maximal independent set selection and greedy colouring"
    - "the computational power of beeps"
    - "anonymous processors with synchronous shared memory"
    - "communicating with beeps"
    - "randomized broadcast in radio networks with collision detection"

Connected through hyperedge HE-6 (induced by source paper "scalable wake up of multi channel single hop radio networks"):
  with members:
    - "packet latency of deterministic broadcasting in adversarial multiple access channels"
    - "uniform information exchange in multi channel wireless ad hoc networks"
    - "broadcasting in ad hoc multiple access channels"
    - "adversarial multiple access channels with individual injection rates"
    - "dynamic sharing of a multiple access channel"
    - "maximum throughput of multiple access channels in adversarial environments"

Connected through hyperedge HE-7 (induced by source paper "converse bounds for noisy group testing with arbitrary measurement matrices"):
  with members:
    - "the capacity of bernoulli nonadaptive group testing"
    - "asymptotics of fingerprinting and group testing tight bounds from channel capacities"
    - "limits on support recovery with probabilistic models an information theoretic framework"
    - "strong converses for group testing in the finite blocklength regime"
    - "the capacity of adaptive group testing"
    - "boolean compressed sensing and noisy group testing"

Connected through hyperedge HE-8 (induced by source paper "uniform information exchange in multi channel wireless ad hoc networks"):
  with members:
    - "scalable wake up of multi channel single hop radio networks"

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.DC(Distributed, Parallel, and Cluster Computing)