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: "sign compute resolve for random access"
  Abstract: We present an approach to random access that is based on three elements: physical-layer network coding, signature codes and tree splitting. Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum of the information that was transmitted by the individual users. For each user this information consists of the data that the user wants to communicate as well as the user's signature. As long as no more than $K$ users collide, their identities can be recovered from the sum of their signatures. A splitting protocol is used to deal with the case that more than $K$ users collide. We measure the performance of the proposed method in terms of user resolution rate as well as overall throughput of the system. The results show that our approach significantly increases the performance of the system even compared to coded random access, where collisions are not wasted, but are reused in successive interference cancellation.

Connected through hyperedge HE-1 (induced by source paper "neural network aided decoding for physical layer network coding random access"):
  with members:
    - "frameless aloha with reliability latency guarantees"
    - "performance analysis of csma with multi packet reception the inhomogeneous case"
    - "seek and decode random access with physical layer network coding and multiuser detection"

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"
    - "bounded contention coding for wireless networks in the high snr regime"
    - "random access with physical layer network coding"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-3 (induced by source paper "asymptotic performance of coded slotted aloha with multi packet reception"):
  with members:
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "coded random access how coding theory helps to build random access protocols"
    - "spatially coupled random access on graphs"

Connected through hyperedge HE-4 (induced by source paper "sign compute resolve for tree splitting random access"):
  with members:
    - "identifying randomly activated users via sign compute resolve on graphs"
    - "coded random access applying codes on graphs to design random access protocols"
    - "many access channels the gaussian case with random user activities"
    - "coded splitting tree protocols"
    - "random access with physical layer network coding"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"
    - "collision helps algebraic collision recovery for wireless erasure networks"

Connected through hyperedge HE-5 (induced by source paper "performance analysis of csma with multi packet reception the inhomogeneous case"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "multiple access via compute and forward"
    - "successive integer forcing and its sum rate optimality"
    - "asynchronous physical layer network coding with quasi cyclic codes"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward on a multiaccess relay channel coding and symmetric rate optimization"
    - "random access with physical layer network coding"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-6 (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"
    - "aloha random access that operates as a rateless code"
    - "bounded contention coding for wireless networks in the high snr regime"
    - "frameless aloha protocol for wireless networks"
    - "reliable physical layer network coding"

Connected through hyperedge HE-7 (induced by source paper "finite length analysis of frameless aloha with multi user detection"):
  with members:
    - "finite length analysis of frameless aloha"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "inactivation decoding analysis for lt codes"
    - "coded random access applying codes on graphs to design random access protocols"
    - "aloha random access that operates as a rateless code"
    - "frameless aloha protocol for wireless networks"
    - "analysis of the second moment of the lt decoder"

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)