{"id":"W3186306330","doi":"10.4230/lipics.ccc.2021.30","title":"On Query-To-Communication Lifting for Adversary Bounds","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Communication complexity; Mathematics; Gadget; Adversary; Constant (computer programming); Computation; Quantum; Discrete mathematics; Secure two-party computation; Quantum computer; Bounded function; Theoretical computer science; Computer science; Combinatorics; Secure multi-party computation; Algorithm; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007565152,0.0003202402,0.0003573875,0.0002819995,0.0007431839,0.0007474601,0.001635365,0.0001808063,0.00001635416],"category_scores_gemma":[0.0003605288,0.0003235147,0.0003394889,0.0006661611,0.00006892243,0.001978382,0.0008129596,0.000345135,0.00008770667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009858317,"about_ca_system_score_gemma":0.0001388984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001321459,"about_ca_topic_score_gemma":0.00003623549,"domain_scores_codex":[0.9976311,0.00005364091,0.0008555942,0.0003698087,0.0004147868,0.0006750374],"domain_scores_gemma":[0.9966883,0.0005057312,0.0002997778,0.001810618,0.0004436698,0.0002518734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002273076,0.0008309796,0.00130426,0.0007276642,0.0002341912,0.00000686587,0.02092843,0.0002754974,0.0002011819,0.8910442,0.04122975,0.04298966],"study_design_scores_gemma":[0.007391332,0.001028247,0.002013784,0.0008045789,0.00008903143,0.00009757612,0.003372853,0.1285895,0.007028653,0.07150722,0.7761714,0.001905813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0707729,0.0001160639,0.9193888,0.001629666,0.0009551286,0.001199323,0.0009670513,0.0003213543,0.004649652],"genre_scores_gemma":[0.5967332,0.00007522549,0.3926626,0.007660829,0.0001689274,0.0003655484,0.002192547,0.00004919742,0.00009195467],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.819537,"threshold_uncertainty_score":0.9999217,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01267810794723745,"score_gpt":0.2669322982956679,"score_spread":0.2542541903484304,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}