{"id":"W7099757918","doi":"","title":"THE UNIVERSITY OF CALGARY The Classical and Quantum Complexity of the Goldreich-Levin Problem with Applications to Bit Commitment","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"License; Bit (key); Copyright law","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002722002,0.00008203334,0.0001104114,0.00001941244,0.0005979009,0.00003484953,0.001219486,0.00002079319,0.000003606694],"category_scores_gemma":[0.00000455562,0.00003736677,0.0000490595,0.0004797018,0.001081481,0.00006135234,0.0006391638,0.000124004,0.000002317209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002720618,"about_ca_system_score_gemma":0.00008347623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004744916,"about_ca_topic_score_gemma":0.001673398,"domain_scores_codex":[0.9992259,0.00008939092,0.0001284443,0.0001839856,0.0002335909,0.0001387049],"domain_scores_gemma":[0.998917,0.0001752566,0.00007903755,0.0007001973,0.000075683,0.00005277486],"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.000007585769,0.00008104595,0.0003197967,0.000007326794,0.00001707843,2.694834e-7,0.0004648998,0.00008257548,0.00004695296,0.9912549,0.0002537414,0.007463836],"study_design_scores_gemma":[0.001746001,0.0007309318,0.1602049,0.0001530897,0.00007114829,0.00004922958,0.001724721,0.05258487,0.002342016,0.6712447,0.1086796,0.0004689123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.012995,0.00007774367,0.9506483,0.03214683,0.00003283947,0.0009442695,0.000007746587,0.00004001978,0.003107255],"genre_scores_gemma":[0.9075233,0.00002361577,0.09183913,0.0003198906,0.00001165672,0.00001191043,6.89309e-7,0.000004187983,0.0002656406],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8945283,"threshold_uncertainty_score":0.4598631,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02823603562915798,"score_gpt":0.2273549514697166,"score_spread":0.1991189158405586,"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."}}