{"id":"W1861862848","doi":"10.1007/11561927_14","title":"Time and Space Lower Bounds for Implementations Using k-CAS","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Implementation; Upper and lower bounds; Queue; Binary logarithm; Priority queue; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics; Programming language","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006009924,0.0004050771,0.0004436054,0.0003630595,0.0004064447,0.0007903873,0.00131376,0.0001984353,0.0000179057],"category_scores_gemma":[0.0000326113,0.0003878965,0.0001063554,0.0003391296,0.000464731,0.000667399,0.000574319,0.0002848325,0.00001528832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002706366,"about_ca_system_score_gemma":0.0003819343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002354918,"about_ca_topic_score_gemma":0.00008656922,"domain_scores_codex":[0.9972271,0.00001565227,0.0004592525,0.001176902,0.0005237549,0.000597278],"domain_scores_gemma":[0.9982912,0.0002654065,0.0002565172,0.00079299,0.0002344506,0.0001594662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001695035,0.00007920063,0.00005118572,0.0001196287,0.00005410861,0.00006912933,0.001993991,0.06236921,0.001303205,0.09311393,0.0004117351,0.8404177],"study_design_scores_gemma":[0.0004154259,0.0001416372,0.00004333862,0.0002492871,0.0000125503,0.0001028355,2.383987e-7,0.9493725,0.0002326467,0.0212195,0.02760616,0.0006038902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002527936,0.000475857,0.9958681,0.0008387273,0.001001093,0.0005613981,0.00006009809,0.0000854123,0.000856559],"genre_scores_gemma":[0.06589626,0.00003156877,0.9296643,0.001352061,0.001121523,0.00002380472,0.00002837527,0.00005618936,0.001825947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8870033,"threshold_uncertainty_score":0.9998573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02203146703464354,"score_gpt":0.2870211703615573,"score_spread":0.2649897033269137,"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."}}