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: "the infinite message limit of two terminal interactive source coding"
  Abstract: A two-terminal interactive function computation problem with alternating messages is studied within the framework of distributed block source coding theory. For any finite number of messages, a single-letter characterization of the sum-rate-distortion function was established in previous works using standard information-theoretic techniques. This, however, does not provide a satisfactory characterization of the infinite-message limit, which is a new, unexplored dimension for asymptotic-analysis in distributed block source coding involving potentially an infinite number of infinitesimal-rate messages. In this paper, the infinite-message sum-rate-distortion function, viewed as a functional of the joint source pmf and the distortion levels, is characterized as the least element of a partially ordered family of functionals having certain convex-geometric properties. The new characterization does not involve evaluating the infinite-message limit of a finite-message sum-rate-distortion expression. This characterization leads to a family of lower bounds for the infinite-message sum-rate-distortion expression and a simple criterion to test the optimality of any achievable infinite-message sum-rate-distortion expression. For computing the amplewise Boolean AND function, the infinite-message minimum sum-rates are characterized in closed analytic form. These sum-rates are shown to be achievable using infinitely many infinitesimal-rate messages. The new convex-geometric characterization is used to develop an iterative algorithm for evaluating any finite-message sumrate-distortion function. It is also used to construct the first examples which demonstrate that for lossy source reproduction, two messages can strictly improve the one-message Wyner-Ziv rate-distortion function settling an unresolved question from a 1985 paper.

Connected through hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact exponent for soft covering"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"
    - "strong functional representation lemma and applications to coding theorems"

Connected through hyperedge HE-2 (induced by source paper "coding for positive rate in the source model key agreement problem"):
  with members:
    - "comparison of channels criteria for domination by a symmetric channel"
    - "on the optimality of secret key agreement via omniscience"
    - "two measures of dependence"
    - "converses for secret key agreement and secure computing"
    - "common information and secret key capacity"
    - "secret key generation for a pairwise independent network model"

Connected through hyperedge HE-3 (induced by source paper "information complexity of the and function in the two party and multiparty settings"):
  with members:
    - "trading information complexity for error"
    - "information complexity is computable"
    - "information equals amortized communication"
    - "asymptotically optimal lower bounds on the nih multi party information"

Connected through hyperedge HE-4 (induced by source paper "privacy guaranteed two agent interactions using information theoretic mechanisms"):
  with members:
    - "extremal mechanisms for local differential privacy"
    - "from the information bottleneck to the privacy funnel"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "privacy against statistical inference"
    - "competitive privacy in the smart grid an information theoretic approach"
    - "multiterminal source coding with an entropy based distortion measure"

Connected through hyperedge HE-5 (induced by source paper "communication and randomness lower bounds for secure computation"):
  with members:
    - "assisted common information with an application to secure two party sampling"
    - "two shannon type problems on secure multi party computations"
    - "how to securely compute the modulo two sum of binary sources"
    - "lower bounds on information complexity via zero communication protocols and applications"

Connected through hyperedge HE-6 (induced by source paper "lower bounds for interactive function computation via wyner common information"):
  with members:
    - "information complexity is computable"
    - "assisted common information with an application to secure two party sampling"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "tension bounds for information complexity"

Connected through hyperedge HE-7 (induced by source paper "interactive function computation via polar coding"):
  with members:
    - "achieving marton s region for broadcast channels using polar codes"
    - "how to achieve the capacity of asymmetric channels"
    - "computation in multicast networks function alignment and converse theorems"
    - "polar codes for q ary channels q 2 r"
    - "how to construct polar codes"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "polar codes for the m user mac"
    - "when is a function securely computable"

Connected through hyperedge HE-8 (induced by source paper "interaction strictly improves the wyner ziv rate distortion function"):
  with members:
    - "distributed source coding for interactive 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)