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: "a joint typicality approach to algebraic network information theory"
  Abstract: This paper presents a joint typicality framework for encoding and decoding nested linear codes for multi-user networks. This framework provides a new perspective on compute-forward within the context of discrete memoryless networks. In particular, it establishes an achievable rate region for computing the weighted sum of nested linear codewords over a discrete memoryless multiple-access channel (MAC). When specialized to the Gaussian MAC, this rate region recovers and improves upon the lattice-based compute-forward rate region of Nazer and Gastpar, thus providing a unified approach for discrete memoryless and Gaussian networks. Furthermore, this framework can be used to shed light on the joint decoding rate region for compute-forward, which is considered an open problem. Specifically, this work establishes an achievable rate region for simultaneously decoding two linear combinations of nested linear codewords from K senders.

Connected through hyperedge HE-1 (induced by source paper "homologous codes for multiple access channels"):
  with members:
    - "on general lattice quantization noise"
    - "towards an algebraic network information theory simultaneous joint typicality decoding"
    - "communication versus computation duality for multiple access channels and source coding"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "optimal achievable rates for interference networks with random codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "achievable rate region based on coset codes for multiple access channel with states"

Connected through hyperedge HE-2 (induced by source paper "gaussian multiple access via compute and forward"):
  with members:
    - "asymmetric compute and forward with csit"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"
    - "lattice strategies for the dirty multiple access channel"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-3 (induced by source paper "communication versus computation duality for multiple access channels and source coding"):
  with members:
    - "towards an algebraic network information theory simultaneous joint typicality decoding"
    - "typical sumsets of linear codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiple access via compute and forward"
    - "lattices over eisenstein integers for compute and forward"
    - "uplink downlink duality for integer forcing"
    - "successive integer forcing and its sum rate optimality"

Connected through hyperedge HE-5 (induced by source paper "how to compute modulo prime power sums"):
  with members:
    - "on the necessity of structured codes for communications over mac with feedback"
    - "a new achievable rate region for multiple access channel with states"
    - "trade off between communication and cooperation in the interference channel"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "polar codes for the two user multiple access channel"

Connected through hyperedge HE-6 (induced by source paper "coded network function virtualization fault tolerance via in network coding"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "network function virtualization state of the art and research challenges"
    - "the complexity rate tradeoff of centralized radio access networks"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"

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)