{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001779579,0.00006620051,0.0001561555,0.0001266405,0.000222607,0.0003663182,0.0008633601,0.00002459038,0.000002131333],"category_scores_gemma":[0.00002106541,0.00003370028,0.00004119653,0.0003753663,0.00008475893,0.001713789,0.0001918783,0.00003975327,0.000004959558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002098306,"about_ca_system_score_gemma":0.00009858819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001002968,"about_ca_topic_score_gemma":7.975273e-7,"domain_scores_codex":[0.9987013,0.0001433739,0.0003625311,0.000142337,0.0004857777,0.0001646472],"domain_scores_gemma":[0.9990551,0.000188396,0.0002502693,0.000163755,0.0002268142,0.0001156879],"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.00002158385,0.00006516669,0.003422748,0.00006430718,0.00004094202,0.00005831382,0.001790504,0.05120998,0.0001993376,0.6956526,0.05298465,0.1944899],"study_design_scores_gemma":[0.002412027,0.002130196,0.002838344,0.001464294,0.00001027976,0.001019032,0.0003009681,0.9470037,0.0002393005,0.02790431,0.01426444,0.0004131096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002861521,0.0002113529,0.9917259,0.003251015,0.0009953337,0.00006117778,3.05527e-7,0.00002388697,0.000869567],"genre_scores_gemma":[0.7192848,0.0001311385,0.2797422,0.0001711753,0.0005628288,0.000001383792,3.436807e-8,0.000002797832,0.0001036164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8957937,"threshold_uncertainty_score":0.3532415,"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."}}