{"id":"W2556309115","doi":"10.1145/3576900","title":"On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; École Normale Supérieure; Simon Fraser University; Alan Turing Institute; National Science Foundation","keywords":"Upper and lower bounds; Hypercube; Combinatorics; Mathematics; Random walk; Discrete mathematics; Random graph; Coalescence (physics); Graph; Physics; Statistics","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.006025289,0.002368929,0.002684454,0.003905577,0.002618635,0.004445966,0.003688873,0.003566264,0.006453561],"category_scores_gemma":[0.06978592,0.001338881,0.002429746,0.004301237,0.005769169,0.02156834,0.004057768,0.006244033,0.001404732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003947002,"about_ca_system_score_gemma":0.001441225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002773824,"about_ca_topic_score_gemma":0.002035076,"domain_scores_codex":[0.9956847,0.001141104,0.0002160627,0.001290745,0.000743895,0.0009234798],"domain_scores_gemma":[0.9049739,0.07850593,0.005119987,0.005747787,0.00256859,0.003083846],"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.0009100633,0.0002578126,0.008539911,0.0009978946,0.0002500348,0.0006287187,0.002118349,0.2049751,0.01463355,0.6828647,0.01088318,0.07294088],"study_design_scores_gemma":[0.00005262523,0.0002061387,0.001951359,0.0001416239,0.0001764771,0.0004574888,0.0004465986,0.3132099,0.003836329,0.6728305,0.006570362,0.0001206395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1457939,0.01225485,0.8169084,0.006041084,0.0004827052,0.000170054,0.0006136981,0.001161007,0.01657435],"genre_scores_gemma":[0.8702073,0.009954402,0.1089058,0.001424492,0.001510688,0.0004225365,0.0007925748,0.001725268,0.005056928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006453561,"threshold_uncertainty_score":0.03186512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01420146614824277,"score_gpt":0.2595415855637024,"score_spread":0.2453401194154596,"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."}}