{"id":"W2057121017","doi":"10.1007/s00446-013-0201-4","title":"Time versus space trade-offs for rendezvous in trees","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Node (physics); Logarithm; Tree (set theory); Constant (computer programming); Computer science; Binary logarithm; Task (project management); Combinatorics; Line (geometry); Mathematics; Discrete mathematics; Algorithm; Physics; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.0002601281,0.0001350468,0.0001778789,0.00009703777,0.0001354144,0.000252907,0.0006264866,0.00006617559,0.0000239313],"category_scores_gemma":[0.0001137938,0.0001356936,0.00006407197,0.0005698639,0.00003386365,0.0002932454,0.0001301505,0.0001343604,0.00007217583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008057903,"about_ca_system_score_gemma":0.00005314161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003269019,"about_ca_topic_score_gemma":0.000006256992,"domain_scores_codex":[0.9986693,0.00006980079,0.0002619957,0.0003529762,0.0001829441,0.0004630371],"domain_scores_gemma":[0.9990861,0.0003313541,0.00008206448,0.0003168435,0.00007145182,0.0001121554],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001064833,0.0008116948,0.001960839,0.0001066889,0.0001308964,0.00003584257,0.004224226,0.5129594,0.003980462,0.0930328,0.06659097,0.3160596],"study_design_scores_gemma":[0.001378834,0.00009871519,0.002067086,0.00002169735,0.00000178814,0.000001997369,0.00005321052,0.9932109,0.0002490576,0.0005885724,0.002158708,0.0001694754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01318307,0.00004265402,0.9816476,0.003310262,0.0002333056,0.0005058224,0.00001946732,0.0002879082,0.0007699648],"genre_scores_gemma":[0.9459422,0.000002712619,0.05366658,0.00009954915,0.00005783082,0.00002605914,0.0001184723,0.0000116277,0.00007498762],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9327591,"threshold_uncertainty_score":0.5533425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02343529895674592,"score_gpt":0.2642404078515405,"score_spread":0.2408051088947945,"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."}}