{"id":"W7135606448","doi":"","title":"LIPIcs","year":2025,"lang":"en","type":"article","venue":"Institute of Science and Technology Austria","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Nvidia","keywords":"Upper and lower bounds; Asynchronous communication; Communication complexity; Computational complexity theory; Time complexity; Key (lock); Binary logarithm; Value (mathematics)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005510077,0.000918902,0.0006511481,0.001092437,0.002039379,0.004376573,0.001131757,0.001154504,0.1918823],"category_scores_gemma":[0.003358761,0.0002979159,0.0008656206,0.00144927,0.001323092,0.004548311,0.002715877,0.002433922,0.0611365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002079259,"about_ca_system_score_gemma":0.001037953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001818137,"about_ca_topic_score_gemma":0.001304361,"domain_scores_codex":[0.9991351,0.0001487807,0.00006579557,0.0003090894,0.0002186094,0.0001227855],"domain_scores_gemma":[0.9990771,0.0002837184,0.0001053652,0.0002158589,0.0002192439,0.0000986259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001376443,0.00004840967,0.0006304428,0.0002360421,0.00001941551,0.0002084817,0.000195174,0.0027511,0.001235808,0.8663306,0.05886896,0.06933788],"study_design_scores_gemma":[0.00003290057,0.00005376968,0.0006242989,0.000125508,0.00001582025,0.0004046348,0.0001878665,0.007026709,0.001382203,0.5503629,0.4397547,0.0000286321],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01915653,0.006624415,0.1306943,0.01368868,0.003384773,0.0002278859,0.004264667,0.001297875,0.8206608],"genre_scores_gemma":[0.3398029,0.006385165,0.05066002,0.004360014,0.002140117,0.0006739678,0.00629019,0.001224602,0.5884631],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1918823,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009278245920948081,"score_gpt":0.2582649941789484,"score_spread":0.2489867482580003,"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."}}