{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941848,0.001431313,0.002219683,0.001098411,0.003345052,0.003427279,0.003895966,0.002305521,0.007312958],"category_scores_gemma":[0.01936636,0.0006657959,0.00149613,0.001030408,0.003820738,0.01043469,0.008190532,0.006539042,0.003830001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724926,"about_ca_system_score_gemma":0.003355883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103903,"about_ca_topic_score_gemma":0.0007958755,"domain_scores_codex":[0.9939178,0.0014436,0.0004163138,0.0008164056,0.002329882,0.001075943],"domain_scores_gemma":[0.9836426,0.005615021,0.002146003,0.006553615,0.001545981,0.0004968769],"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.003042164,0.0006460231,0.003822025,0.001121083,0.0003495796,0.0007057488,0.00270292,0.05361556,0.1471624,0.4894794,0.02102402,0.2763291],"study_design_scores_gemma":[0.0005814562,0.001075133,0.0009813249,0.0003185501,0.000195528,0.001131266,0.0007757517,0.3462787,0.1824556,0.3956091,0.0703501,0.0002474748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0537543,0.0004539896,0.9241758,0.002494776,0.0003052129,0.0004940758,0.0001789719,0.003933665,0.0142092],"genre_scores_gemma":[0.5928252,0.0004756343,0.3914685,0.0006666199,0.0001848067,0.0008353877,0.0003057646,0.001426046,0.0118121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007312958,"threshold_uncertainty_score":0.02613533,"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."}}