{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004301419,0.0002693539,0.0002972489,0.0004382909,0.0002979377,0.0002114962,0.001331337,0.0001377703,0.0001165135],"category_scores_gemma":[0.00005154041,0.0002702383,0.0001460555,0.001598532,0.0000672582,0.0004053755,0.00002962851,0.0003991511,0.003731587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009344468,"about_ca_system_score_gemma":0.00008726741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004741846,"about_ca_topic_score_gemma":0.00004590695,"domain_scores_codex":[0.9976145,0.00009411644,0.0004051912,0.0007404267,0.0006102087,0.0005355519],"domain_scores_gemma":[0.9983001,0.0002607619,0.00009420226,0.00110074,0.00007859439,0.0001655979],"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.000107596,0.00119334,0.0001911479,0.0001141863,0.0001687239,0.0007877452,0.01341051,0.01604402,0.002593125,0.006447039,0.01953378,0.9394088],"study_design_scores_gemma":[0.005766362,0.002031535,0.003959815,0.003192503,0.00005908246,0.0003312537,0.001701149,0.7964581,0.02466038,0.123999,0.03464962,0.003191223],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0557839,0.0001087723,0.9217845,0.0100953,0.002019608,0.001011687,0.0002331371,0.001685969,0.007277187],"genre_scores_gemma":[0.9777489,0.0001148302,0.01277203,0.002322623,0.00006691449,0.0001729295,0.00002081849,0.00005135141,0.006729558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9362175,"threshold_uncertainty_score":0.999975,"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."}}