{"id":"W2089845008","doi":"10.1007/s00453-015-9982-0","title":"Anonymous Meeting in Networks","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Node (physics); Computer science; Theory of computation; Deterministic algorithm; Upper and lower bounds; Time complexity; Algorithm; Construct (python library); Existential quantification; Theoretical computer science; Mathematics; Discrete mathematics; Computer network","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.0004522248,0.00006190976,0.00008138754,0.0000792361,0.00003039298,0.00009300731,0.0004246492,0.00004099846,0.000006098369],"category_scores_gemma":[0.00005255019,0.00005911989,0.00001673051,0.0004425563,0.00001740654,0.0002553967,0.0001717346,0.0001168673,0.00005191279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003659708,"about_ca_system_score_gemma":0.00006222107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005862235,"about_ca_topic_score_gemma":0.00001283828,"domain_scores_codex":[0.9991813,0.00006877742,0.0001399777,0.0001938729,0.0001727643,0.0002433553],"domain_scores_gemma":[0.9995134,0.00003853846,0.00002819077,0.0002273045,0.0000670942,0.0001254272],"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.000009685884,0.0002256744,0.00246202,0.000008543024,0.00001651696,0.000168241,0.003286301,0.4023358,0.00004311292,0.04625153,0.01788076,0.5273118],"study_design_scores_gemma":[0.0002992301,0.00003036375,0.0001003359,0.000007867326,3.507006e-7,0.000006630535,0.00002256558,0.9931725,0.00004614261,0.001495655,0.004736642,0.00008172021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000450756,0.0001513903,0.9789221,0.001161049,0.0002523651,0.0001051404,2.079909e-7,0.0001321176,0.01882489],"genre_scores_gemma":[0.5088516,0.00002801866,0.4887587,0.001165529,0.0001836426,0.00002330812,0.000005009703,0.00001528313,0.0009688363],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5908366,"threshold_uncertainty_score":0.2410839,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0283711810022501,"score_gpt":0.2560131383583552,"score_spread":0.2276419573561051,"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."}}