{"id":"W2174851824","doi":"10.1016/j.tcs.2012.01.035","title":"More efficient periodic traversal in anonymous undirected graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Tree traversal; Undirected graph; Combinatorics; Graph; Set (abstract data type); Node (physics); Computer science; Mathematics; Period length; Discrete mathematics; Time complexity; Integer (computer science); Binary logarithm; Algorithm","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.00176046,0.0001739378,0.0001883833,0.0004441333,0.000296245,0.0003524221,0.001775376,0.00005593543,0.00007995266],"category_scores_gemma":[0.00007297395,0.0001444571,0.0000560158,0.002678639,0.00213558,0.0006026324,0.0006791117,0.0002426716,0.00009587863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009463426,"about_ca_system_score_gemma":0.0001438627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006379005,"about_ca_topic_score_gemma":7.156308e-7,"domain_scores_codex":[0.9972143,0.0001650489,0.0002714129,0.0005329737,0.0008185562,0.0009977033],"domain_scores_gemma":[0.9986118,0.0001375311,0.00004376307,0.0005997982,0.0001261014,0.0004809847],"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.000004685816,0.0001739644,0.0008655295,0.000003823864,0.00000149884,0.000007045658,0.003078297,0.003783732,0.0002522294,0.9840782,0.00002015877,0.007730895],"study_design_scores_gemma":[0.0003460715,0.0000940325,0.01076134,0.00001830253,0.000001541798,0.00003146293,0.00002297795,0.9791734,0.0007692759,0.008479576,0.00006678537,0.0002352842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1484281,0.00003817551,0.8465651,0.0009541232,0.0005691954,0.0002209057,6.77541e-7,0.0002188892,0.003004859],"genre_scores_gemma":[0.9063234,0.000003797697,0.09313408,0.0004718091,0.00004186059,0.00000782481,7.868427e-7,0.0000066977,0.000009756997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9755986,"threshold_uncertainty_score":0.7868633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01068565830296577,"score_gpt":0.2572362291670868,"score_spread":0.246550570864121,"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."}}