{"id":"W1985671439","doi":"10.1145/1011767.1011777","title":"Lower bounds for adaptive collect and related objects","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Computer science; Upper and lower bounds; Algorithm; Mathematics","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.007374337,0.002415696,0.002310539,0.003173947,0.003821749,0.008142478,0.005566036,0.002872069,0.0149044],"category_scores_gemma":[0.05243484,0.001409968,0.003676978,0.00345218,0.004777811,0.02133997,0.007500337,0.007946027,0.002582757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006501537,"about_ca_system_score_gemma":0.004033717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002642585,"about_ca_topic_score_gemma":0.003560654,"domain_scores_codex":[0.9844276,0.002297436,0.000832863,0.002298541,0.006658816,0.003484746],"domain_scores_gemma":[0.9213471,0.05705995,0.003762062,0.0113484,0.004924302,0.001558055],"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.00117395,0.0005580409,0.00903206,0.001084031,0.000241687,0.0003889349,0.001023463,0.1141281,0.0116246,0.7097457,0.01393052,0.1370689],"study_design_scores_gemma":[0.00008915927,0.000282398,0.001947771,0.0002052047,0.0002140787,0.0004468792,0.0001890902,0.5123128,0.01216998,0.4570232,0.01500525,0.0001141922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07776367,0.004288379,0.849639,0.003672628,0.0003546861,0.0004645327,0.0009189735,0.002475046,0.06042311],"genre_scores_gemma":[0.6479779,0.002515638,0.3138941,0.001575752,0.001115367,0.001233738,0.001769608,0.002309469,0.02760843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0149044,"threshold_uncertainty_score":0.04986024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01036159351749001,"score_gpt":0.2247643378607285,"score_spread":0.2144027443432385,"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."}}