{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008406143,0.00524267,0.004907578,0.005039708,0.004847047,0.01686442,0.01023226,0.005554632,0.04606844],"category_scores_gemma":[0.04684132,0.002404776,0.004334863,0.008193035,0.005423328,0.0251232,0.01035914,0.01043226,0.01083502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00861058,"about_ca_system_score_gemma":0.01205468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004708875,"about_ca_topic_score_gemma":0.01182258,"domain_scores_codex":[0.979871,0.003436137,0.001437208,0.002163416,0.006768815,0.006323427],"domain_scores_gemma":[0.9249548,0.04629212,0.002774533,0.018373,0.005102111,0.002503491],"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.005250181,0.0008312156,0.002081838,0.002061348,0.0003746621,0.0002156969,0.0007557597,0.1933833,0.01437278,0.5037296,0.05658244,0.2203613],"study_design_scores_gemma":[0.00031453,0.0003547039,0.0005749281,0.0004301702,0.0004841952,0.0003659749,0.0004293475,0.5103123,0.013992,0.4586512,0.01392175,0.0001688632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08750116,0.01040093,0.704492,0.006983931,0.001917891,0.0006750437,0.00202661,0.01401206,0.1719904],"genre_scores_gemma":[0.5721151,0.004150231,0.3611172,0.002044931,0.00161536,0.001509003,0.002744985,0.005812193,0.04889102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04606844,"threshold_uncertainty_score":0.1541144,"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."}}