{"id":"W2563013149","doi":"10.1016/j.jcss.2016.11.008","title":"Collision-free network exploration","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Node (physics); Upper and lower bounds; Network topology; Tree (set theory); Topology (electrical circuits); Collision; Mobile agent; Distributed computing; Computer network; Combinatorics; Mathematics; Computer security; Physics","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.0007903245,0.0006730603,0.001039093,0.001256643,0.001091294,0.0008811989,0.001558853,0.001599135,0.008276407],"category_scores_gemma":[0.005882457,0.0005385312,0.000728795,0.001045302,0.001098447,0.001877222,0.003052907,0.001013449,0.0006696223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007789013,"about_ca_system_score_gemma":0.001218268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003656162,"about_ca_topic_score_gemma":0.004438678,"domain_scores_codex":[0.9996367,0.0001233125,0.000013169,0.00006173165,0.000098725,0.00006639445],"domain_scores_gemma":[0.9978816,0.001593533,0.0001053225,0.0001620117,0.0001368254,0.0001208132],"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.0002971421,0.00008157875,0.0007337325,0.00009620938,0.00005198473,0.00009373383,0.0001188321,0.91859,0.001210991,0.03632667,0.003224488,0.03917459],"study_design_scores_gemma":[0.00003395843,0.00003715315,0.00009229431,0.000009306703,0.000009011338,0.00002790825,0.00002302838,0.9864667,0.0002434151,0.01241621,0.0006364419,0.000004543184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1577213,0.0008829802,0.7882025,0.001350346,0.0001865425,0.0003422538,0.0003383688,0.0007109724,0.0502647],"genre_scores_gemma":[0.8421841,0.0002920293,0.1392017,0.0002264384,0.00005365892,0.0003203334,0.000246062,0.0001420861,0.01733355],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008276407,"threshold_uncertainty_score":0.02768731,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03322928801255541,"score_gpt":0.2567984962280194,"score_spread":0.2235692082154639,"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."}}