{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574931,0.001364077,0.002436514,0.003674725,0.004791316,0.01144308,0.00188135,0.002732472,0.05878545],"category_scores_gemma":[0.01077366,0.001297483,0.001150605,0.009630731,0.00529837,0.005316196,0.004224553,0.008660317,0.007123151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.03888617,"about_ca_system_score_gemma":0.01263042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1286341,"about_ca_topic_score_gemma":0.1019579,"domain_scores_codex":[0.9983777,0.0002679235,0.00007792564,0.0005044229,0.0005778229,0.0001942047],"domain_scores_gemma":[0.9949403,0.002469691,0.0003381658,0.00068135,0.001080486,0.0004899939],"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.0001469532,0.00004817793,0.001307258,0.0006391184,0.00007686772,0.0002111669,0.0005403769,0.007184387,0.0003254816,0.7281266,0.1788533,0.0825404],"study_design_scores_gemma":[0.00003903846,0.00001967592,0.002024026,0.0006652523,0.00003738326,0.000128617,0.0002602508,0.005053563,0.0005265973,0.7128529,0.2783254,0.00006713398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03286555,0.2051529,0.02255826,0.1469909,0.01166729,0.0001088905,0.00556797,0.001010393,0.5740779],"genre_scores_gemma":[0.370761,0.1260043,0.03179787,0.006883919,0.01127374,0.0002970205,0.005688903,0.0009035374,0.4463897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1286341,"threshold_uncertainty_score":0.2821402,"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."}}