{"id":"W2942961654","doi":"10.4230/lipics.icalp.2019.35","title":"Query-To-Communication Lifting for BPP Using Inner Product","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation","keywords":"Gadget; Mathematical proof; Computer science; Mathematics; Search engine indexing; Entropy (arrow of time); Product (mathematics); Theoretical computer science; Discrete mathematics; Combinatorics; Information retrieval","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.001103189,0.0003614353,0.0004392419,0.0003934266,0.0005694631,0.0006588951,0.002156761,0.0001318605,0.0000139053],"category_scores_gemma":[0.000185612,0.0003477712,0.0002671487,0.0006711466,0.00007145342,0.002259922,0.0009649714,0.0003433267,0.0001288411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001394076,"about_ca_system_score_gemma":0.0001121887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003187814,"about_ca_topic_score_gemma":0.00001555013,"domain_scores_codex":[0.9973055,0.00004710015,0.001018087,0.0004063606,0.0004270892,0.0007959101],"domain_scores_gemma":[0.9969767,0.0002538627,0.0004410609,0.001757855,0.0003846732,0.0001858681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005329413,0.001818579,0.02584758,0.004576843,0.0009305395,0.000004379192,0.08324867,0.009688656,0.00361023,0.3679332,0.01544903,0.4863594],"study_design_scores_gemma":[0.00263224,0.000350733,0.0008334983,0.0004466749,0.00003437377,0.00005212511,0.0007674552,0.823657,0.003546779,0.007115212,0.1595293,0.001034552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2437135,0.00007997978,0.7479534,0.001081569,0.001666261,0.003275909,0.000195706,0.00034971,0.001684016],"genre_scores_gemma":[0.4554339,0.00000929173,0.5421661,0.001543161,0.0001951044,0.0001669375,0.0001466822,0.000046466,0.0002923964],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8139684,"threshold_uncertainty_score":0.9998974,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02559971745356479,"score_gpt":0.2813312082238702,"score_spread":0.2557314907703054,"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."}}