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: "when is a function securely computable"
  Abstract: A subset of a set of terminals that observe correlated signals seek to compute a given function of the signals using public communication. It is required that the value of the function be kept secret from an eavesdropper with access to the communication. We show that the function is securely computable if and only if its entropy is less than the "aided secret key" capacity of an associated secrecy generation model, for which a single-letter characterization is provided.

Connected through hyperedge HE-1 (induced by source paper "interactive secure function computation"):
  with members:
    - "robust privacy utility tradeoffs under differential privacy and hamming distortion"
    - "communication rounds tradeoffs for common randomness and secret key generation"
    - "secret key agreement under discussion rate constraints"
    - "communication and randomness lower bounds for secure computation"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "information complexity density and simulation of protocols"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "distributed channel synthesis"

Connected through hyperedge HE-2 (induced by source paper "multivariate dependence beyond shannon information"):
  with members:
    - "invariant components of synergy redundancy and unique information among three variables"
    - "measuring multivariate redundant information with pointwise common change in surprisal"
    - "understanding interdependency through complex information sharing"
    - "extropy complementary dual of entropy"
    - "model free quantification of time series predictability"
    - "quantifying unique information"
    - "intersection information based on common randomness"
    - "bivariate measure of redundant information"

Connected through hyperedge HE-3 (induced by source paper "secure computation of randomized functions further results"):
  with members:
    - "secure computation of randomized functions"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "channel simulation via interactive communications"

Connected through hyperedge HE-4 (induced by source paper "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "non asymptotic and asymptotic analyses of information processing on markov chains"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "secret key generation from gaussian sources using lattice hashing"
    - "non asymptotic analysis of privacy amplification via renyi entropy and inf spectral entropy"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-5 (induced by source paper "on secure computation over the binary modulo 2 adder multiple access wiretap channel"):
  with members:
    - "nomographic functions efficient computation in clustered gaussian sensor networks"
    - "two shannon type problems on secure multi party computations"
    - "how to securely compute the modulo two sum of binary sources"
    - "distributed function computation with confidentiality"
    - "computation over mismatched channels"
    - "robust analog function computation via wireless multiple access channels"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-6 (induced by source paper "secure computation of randomized functions"):
  with members:
    - "communication and randomness lower bounds for secure computation"

Connected through hyperedge HE-7 (induced by source paper "converses for secret key agreement and secure computing"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "interactive communication for data exchange"
    - "information complexity density and simulation of protocols"
    - "secret key agreement general capacity and second order asymptotics"
    - "assisted common information with an application to secure two party sampling"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "on the efficiency of classical and quantum secure function evaluation"

Connected through hyperedge HE-8 (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"
    - "polar codes are optimal for lossy source coding"

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)