{"id":"W6910493941","doi":"10.4230/lipics.disc.2022.11","title":"How to Meet at a Node of Any Connected Graph","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Strongly connected component; Graph; Node (physics); Set (abstract data type); Task (project management); Finite set; Directed graph; Integer (computer science)","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.0008072332,0.0008324228,0.0006820341,0.0005775017,0.001348628,0.002194649,0.001646709,0.002059701,0.008274027],"category_scores_gemma":[0.008807166,0.0004891649,0.001037873,0.0009498961,0.00205021,0.005795,0.001486149,0.001571628,0.001964427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001063223,"about_ca_system_score_gemma":0.001110896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00312852,"about_ca_topic_score_gemma":0.003183405,"domain_scores_codex":[0.9987403,0.000345735,0.00007919951,0.0004476768,0.0002242853,0.000162877],"domain_scores_gemma":[0.9953299,0.003067744,0.0003262412,0.0005686452,0.0002825394,0.0004249245],"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.0005821618,0.0002451384,0.00312734,0.001600418,0.000179603,0.0009890603,0.001881733,0.1916711,0.01473862,0.6025008,0.03095373,0.1515304],"study_design_scores_gemma":[0.00009757435,0.0001862725,0.001139245,0.0001387073,0.0001082817,0.0008475074,0.001443574,0.1812963,0.007669691,0.7536562,0.05333536,0.00008134577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2045389,0.001546491,0.7214252,0.00876407,0.0005275378,0.0007723263,0.001621334,0.001433074,0.05937107],"genre_scores_gemma":[0.5701687,0.002327388,0.3996288,0.0006940539,0.000201112,0.0005768797,0.002989535,0.0005747403,0.02283883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008274027,"threshold_uncertainty_score":0.02767932,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01739965683460564,"score_gpt":0.2415029935148019,"score_spread":0.2241033366801962,"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."}}