{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004433977,0.00007428748,0.0001484979,0.0005676061,0.000241248,0.00006047429,0.001247488,0.0001068123,6.963575e-7],"category_scores_gemma":[0.0002290722,0.00006490683,0.00001295366,0.004246622,0.002650355,0.0006843774,0.0003985729,0.0001153372,0.000004258556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002736451,"about_ca_system_score_gemma":0.0004608609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001915889,"about_ca_topic_score_gemma":0.000004773961,"domain_scores_codex":[0.9990749,0.000003668842,0.000195856,0.000317849,0.0001973981,0.000210295],"domain_scores_gemma":[0.9991131,0.000009751692,0.0000694616,0.000467449,0.0003053096,0.00003495633],"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":[7.976815e-7,0.00001723042,0.001273755,0.000009697535,0.000003522149,0.000003981516,0.00001767559,0.000004049234,0.005754934,0.9102333,0.0008388881,0.0818422],"study_design_scores_gemma":[0.0014939,0.0001953482,0.008191042,0.0003316015,0.00001866781,0.00008369514,0.0002561654,0.009500931,0.1201514,0.1015966,0.7577173,0.0004633351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5748848,0.001324392,0.3531969,0.02401562,0.005133665,0.0005335914,0.00001150932,0.0007055403,0.0401939],"genre_scores_gemma":[0.9941782,0.00002065274,0.005407217,0.00007071323,0.000007412817,0.000006834456,2.179563e-7,7.698769e-7,0.0003080038],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8086367,"threshold_uncertainty_score":0.9765342,"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."}}