{"id":"W2001271834","doi":"10.1145/1989727.1989732","title":"Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Adversary; Computer science; Scalability; Latency (audio); Adversary model; Cryptography; Theoretical computer science; Parallel computing; Algorithm; Discrete mathematics; Mathematics; Computer security","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009443681,0.0001130056,0.0001822317,0.00003286855,0.0002271856,0.0001506143,0.006892935,0.0000470771,0.00002231342],"category_scores_gemma":[0.0003099967,0.00005182539,0.0002405823,0.000326077,0.00006080337,0.0004627911,0.0008889864,0.0003330056,0.00003072026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002725296,"about_ca_system_score_gemma":0.00008638518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002853973,"about_ca_topic_score_gemma":0.000002279056,"domain_scores_codex":[0.9986627,0.0001399517,0.0004122699,0.0001209035,0.0004351872,0.0002290031],"domain_scores_gemma":[0.9974392,0.00009439413,0.0004518981,0.001759785,0.0001712812,0.00008341295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001580409,0.0005399784,0.02582495,0.00008392108,0.0007138806,0.0004086215,0.04034558,0.00485592,0.004766014,0.06362005,0.758585,0.1000981],"study_design_scores_gemma":[0.001704709,0.0002864051,0.01870391,0.0005951216,0.0001089141,0.004242992,0.0008509836,0.01761642,0.008481612,0.0471057,0.8996963,0.000606937],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5970131,0.006028553,0.2653813,0.05884486,0.01068825,0.001007634,0.0000534536,0.0002148326,0.06076802],"genre_scores_gemma":[0.9928918,0.00001569528,0.00436479,0.001946892,0.0003381511,0.000001696038,5.57579e-8,0.000008108875,0.0004327438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3958787,"threshold_uncertainty_score":0.9984803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02488932264454965,"score_gpt":0.2243628494667722,"score_spread":0.1994735268222225,"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."}}