{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006646538,0.0002631386,0.000389198,0.0004967715,0.0005603479,0.000317596,0.001659623,0.00007511114,0.00009060414],"category_scores_gemma":[0.0001276754,0.0002552745,0.0002098264,0.00104827,0.00007235031,0.001063716,0.001719478,0.0001869199,0.00001967005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001704274,"about_ca_system_score_gemma":0.00009696448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001034516,"about_ca_topic_score_gemma":0.00002545352,"domain_scores_codex":[0.9973912,0.00008387858,0.0007505566,0.0002863069,0.0008127734,0.0006753378],"domain_scores_gemma":[0.9979699,0.0001259418,0.0003671351,0.0008715043,0.0003730989,0.0002924507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009385445,0.002614598,0.01568667,0.002305142,0.001011893,0.00003984571,0.1305961,0.07719415,0.00415383,0.4393366,0.3119888,0.01413391],"study_design_scores_gemma":[0.006471232,0.001511205,0.0004899394,0.00009310192,0.00003278436,0.0001124837,0.003125477,0.5515879,0.004569876,0.002392319,0.4284701,0.001143586],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09446351,0.00004536571,0.887173,0.006294584,0.001179182,0.002709265,0.00122847,0.0004399406,0.006466658],"genre_scores_gemma":[0.8705347,0.00001616234,0.122376,0.004278485,0.00004767824,0.0004991098,0.0003450817,0.00004970932,0.001853086],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7760712,"threshold_uncertainty_score":0.9999899,"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."}}