{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156798,0.000517846,0.0004615672,0.0008538532,0.003293037,0.003072119,0.001122799,0.002075016,0.09204441],"category_scores_gemma":[0.007466613,0.0002242198,0.0004102394,0.001115319,0.0007924273,0.004601624,0.002769615,0.001807482,0.02036431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001216671,"about_ca_system_score_gemma":0.001209763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001876506,"about_ca_topic_score_gemma":0.003534721,"domain_scores_codex":[0.9985529,0.0006150177,0.00003762227,0.0003067252,0.0002728963,0.0002148793],"domain_scores_gemma":[0.9977571,0.0006060828,0.000213319,0.0004977512,0.0003707654,0.0005550163],"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.0003073665,0.00009945458,0.001524927,0.0001590834,0.00004396308,0.0004533524,0.0006809834,0.005795821,0.001181626,0.5819921,0.2773355,0.1304259],"study_design_scores_gemma":[0.0000345769,0.00004542864,0.001082204,0.00004937529,0.00003175077,0.0003598834,0.00086697,0.01437907,0.0009624492,0.3510906,0.6310663,0.00003144173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04647278,0.001645439,0.1247041,0.02490934,0.00565373,0.0002418351,0.00236623,0.001252024,0.7927546],"genre_scores_gemma":[0.3954504,0.00104479,0.02444801,0.001654376,0.001756411,0.0001845645,0.001158577,0.0003196855,0.5739832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.09204441,"threshold_uncertainty_score":0.3079193,"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."}}