{"id":"W2080745503","doi":"10.1016/j.tcs.2007.05.011","title":"Map construction of unknown graphs by multiple agents","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Traverse; Graph; Computer science; Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001867603,0.0001162555,0.0001457769,0.0002242864,0.0002288482,0.0001502487,0.001529601,0.00004638466,0.00005669726],"category_scores_gemma":[0.00006344343,0.00009899014,0.00005019026,0.00107108,0.002948696,0.0005235983,0.000530092,0.0001309966,0.00003666134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003156983,"about_ca_system_score_gemma":0.0000672348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003911548,"about_ca_topic_score_gemma":5.743824e-7,"domain_scores_codex":[0.9979697,0.00006497555,0.0003187314,0.0004548858,0.0007164613,0.0004752235],"domain_scores_gemma":[0.9986632,0.000208043,0.00008581177,0.0004957786,0.0002747492,0.0002723527],"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.000005120755,0.00005627928,0.0003392832,0.00000633767,0.000002354878,0.000002005952,0.0001902355,0.0001525585,0.001264511,0.9679481,0.0001964916,0.0298367],"study_design_scores_gemma":[0.0004488461,0.0002055421,0.0007316648,0.00002231862,0.000002142585,0.0000183892,0.00001029701,0.8393288,0.0284041,0.1296229,0.0009966564,0.0002083234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0168092,0.0000149641,0.9794729,0.0004398478,0.0005698132,0.0001490553,0.000001632267,0.0001123258,0.002430257],"genre_scores_gemma":[0.6762913,0.000004046058,0.3234783,0.0001935502,0.00001536568,0.000001049191,9.999135e-7,0.000003187419,0.00001215404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8391763,"threshold_uncertainty_score":0.9997647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01071225163422513,"score_gpt":0.2594873612681509,"score_spread":0.2487751096339258,"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."}}