{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01268536,0.002153109,0.002003231,0.002782623,0.003301402,0.0069404,0.004626761,0.003466486,0.01665659],"category_scores_gemma":[0.03889777,0.001299096,0.005649112,0.00288223,0.009956924,0.02594136,0.01478901,0.01776591,0.002841866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007394546,"about_ca_system_score_gemma":0.00276693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034188,"about_ca_topic_score_gemma":0.0007652686,"domain_scores_codex":[0.9839163,0.004330596,0.0006733562,0.002623662,0.005679739,0.002776285],"domain_scores_gemma":[0.9496573,0.03458267,0.002276972,0.009791799,0.002235465,0.001455767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005225539,0.00005744421,0.0001820795,0.00007417433,0.00001882574,0.00006865619,0.0001790281,0.006818827,0.001282256,0.9837831,0.00105324,0.006430132],"study_design_scores_gemma":[0.00002491942,0.00007685171,0.000192467,0.00004413147,0.00003647141,0.00008121796,0.00004840108,0.07644757,0.002343241,0.9168258,0.003841406,0.00003749921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03622363,0.0007917893,0.9042105,0.005631358,0.0003684067,0.0003375004,0.0003306139,0.000593027,0.05151321],"genre_scores_gemma":[0.8104089,0.00189202,0.1598783,0.003435118,0.001951831,0.001281755,0.0005640781,0.0007246529,0.01986332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01665659,"threshold_uncertainty_score":0.06708741,"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."}}