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: "converses for secret key agreement and secure computing"
  Abstract: We consider information theoretic secret key agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the secret key length, which is derived using a reduction of binary hypothesis testing to multiparty secret key agreement. Building on this basic result, we derive new converses for multiparty secret key agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to secret key agreement. Finally, we derive a necessary condition for the feasibility of secure computation by trusted parties that seek to compute a function of their collective data, using an interactive public communication that by itself does not give away the value of the function. In many cases, we strengthen and improve upon previously known converse bounds. Our results are single-shot and use only the given joint distribution of the correlated observations. For the case when the correlated observations consist of independent and identically distributed (in time) sequences, we derive strong versions of previously known converses.

Connected through hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication"):
  with members:
    - "private authentication with physical identifiers through broadcast channel measurements"
    - "controllable identifier measurements for private authentication with secret keys"
    - "secure and reliable key agreement with physical unclonable functions"
    - "coding for positive rate in the source model key agreement problem"
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "privacy secrecy and storage with multiple noisy measurements of identifiers"
    - "polar coding for secret key generation"
    - "secret key generation using correlated sources and channels"

Connected through hyperedge HE-2 (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-3 (induced by source paper "communication for generating correlation a survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact soft covering exponent"
    - "on exact and infty r enyi common informations"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "communication complexity of estimating correlations"):
  with members:
    - "geometric lower bounds for distributed parameter estimation under communication constraints"
    - "strong data processing inequalities for channels and bayesian networks"
    - "secret key generation with limited interaction"
    - "smoothing brascamp lieb inequalities and strong converses for common randomness generation"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "communication lower bounds for statistical estimation problems via a distributed data processing inequality"
    - "communication with imperfectly shared randomness"
    - "an optimal lower bound on the communication complexity of gap hamming distance"

Connected through hyperedge HE-5 (induced by source paper "strong converse using change of measure arguments"):
  with members:
    - "a new proof of nonsignalling multiprover parallel repetition theorem"
    - "communication for generating correlation a survey"
    - "communication for generating correlation a unifying survey"
    - "improved finite blocklength converses for slepian wolf coding via linear programming"
    - "second order region for gray wyner network"
    - "strong converses are just edge removal properties"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "wiretap channel capacity secrecy criteria strong converse and phase change"

Connected through hyperedge HE-6 (induced by source paper "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "two measures of dependence"
    - "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"
    - "universal channel coding for exponential family of channels"
    - "universal channel coding for general output alphabet"
    - "encoding tasks and renyi entropy"
    - "renyi divergence and kullback leibler divergence"

Connected through hyperedge HE-7 (induced by source paper "controllable identifier measurements for private authentication with secret keys"):
  with members:
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "privacy secrecy and storage with noisy identifiers"
    - "secret key based authentication with a privacy constraint"
    - "secure biometrics concepts authentication architectures and challenges"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-8 (induced by source paper "one shot variable length secret key agreement approaching mutual information"):
  with members:
    - "universal multiparty data exchange and secret key agreement"
    - "on slepian wolf theorem with interaction"
    - "secret key agreement general capacity and second order asymptotics"
    - "information equals amortized communication"

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)