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: "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"
  Abstract: Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear combination of X1 and X2 to within a mean-square distortion of D. We obtain an inner bound to the optimal rate-distortion region for this problem. A portion of this inner bound is achieved by a scheme that reconstructs the linear function directly rather than reconstructing the individual components X1 and X2 first. This results in a better rate region for certain parameter values. Our coding scheme relies on lattice coding techniques in contrast to more prevalent random coding arguments used to demonstrate achievable rate regions in information theory. We then consider the case of linear reconstruction of K sources and provide an inner bound to the optimal rate-distortion region. Some parts of the inner bound are achieved using the following coding structure: lattice vector quantization followed by "correlated" lattice-structured binning.

Connected through hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding"):
  with members:
    - "homologous codes for multiple access channels"
    - "gaussian multiple access via compute and forward"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "equivalence of additive combinatorial linear inequalities for shannon entropy and differential entropy"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "secure compute and forward in a bidirectional relay"
    - "distributed decode forward for relay networks"

Connected through hyperedge HE-2 (induced by source paper "on distributed quantization for classification"):
  with members:
    - "generating diverse high fidelity images with vq vae 2"
    - "geometric lower bounds for distributed parameter estimation under communication constraints"
    - "training and inference with integers in deep neural networks"
    - "rate distortion for model compression from theory to practice"
    - "neural joint source channel coding"
    - "distributed simulation and distributed inference"
    - "quantization and training of neural networks for efficient integer arithmetic only inference"
    - "incremental network quantization towards lossless cnns with low precision weights"

Connected through hyperedge HE-3 (induced by source paper "multilevel ldpc lattices with efficient encoding and decoding and a generalization of construction d"):
  with members:
    - "ldpc lattice codes for full duplex relay channels"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "construction of capacity achieving lattice codes polar lattices"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "connections between construction d and related constructions of lattices"
    - "on the performance of 1 level ldpc lattices"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "distributed structure joint expurgation for the multiple access channel"):
  with members:
    - "error exponent for multiple access channels lower bounds"
    - "a new upper bound on the average error exponent for multiple access channels"
    - "lattice strategies for the dirty multiple access channel"

Connected through hyperedge HE-5 (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"
    - "a joint typicality approach to algebraic network information theory"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "a joint typicality approach to algebraic network information theory"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "secure compute and forward in a bidirectional relay"
    - "asymmetric compute and forward with csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "renyi divergence and kullback leibler divergence"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-7 (induced by source paper "rate distortion for lossy in network function computation information dissipation and sequential reverse water filling"):
  with members:
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "computing linear transformations with unreliable components"
    - "a generalized cut set bound for deterministic multi flow networks and its applications"
    - "dissipation of information in channels with input constraints"
    - "a generalized typicality for abstract alphabets"
    - "strong data processing inequalities and phi sobolev inequalities for discrete channels"
    - "on cooperation in multi terminal computation and rate distortion"
    - "network coding for computing cut set bounds"

Connected through hyperedge HE-8 (induced by source paper "graph codes for distributed instant message collection in an arbitrary noisy broadcast network"):
  with members:
    - "sum networks from undirected graphs construction and capacity analysis"
    - "energy efficient distributed coding for data collection in a noisy sparse network"
    - "computing linear transformations with unreliable components"
    - "update efficiency and local repairability limits for capacity approaching codes"
    - "computation over gaussian networks with orthogonal components"
    - "computing linear functions by linear coding over networks"
    - "network coding for computing cut set bounds"
    - "towards a queueing based framework for in network function computation"

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)