{"id":"W1974192323","doi":"10.1016/s0166-218x(03)00189-6","title":"Searching with mobile agents in networks with liars","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Hypercube; Node (physics); Computer science; Graph; Theoretical computer science; Shortest path problem; Path (computing); Mathematics; Combinatorics; Discrete mathematics; Topology (electrical circuits); 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003704094,0.0001509505,0.0001823593,0.00009301495,0.00008755957,0.0001769181,0.0003980963,0.00004191471,0.00002265245],"category_scores_gemma":[0.00000852143,0.0001049757,0.00001752452,0.0005610717,0.00005284553,0.0001698081,0.00007870472,0.0002079515,0.00001956043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002958147,"about_ca_system_score_gemma":0.00005667748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003078605,"about_ca_topic_score_gemma":0.00001253124,"domain_scores_codex":[0.998776,0.00003035548,0.000199922,0.0002760407,0.0003454697,0.0003722593],"domain_scores_gemma":[0.9992512,0.00007630771,0.00007551068,0.0004545251,0.00003239504,0.0001100914],"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.000007655205,0.0001297847,0.0001601871,0.00006621586,0.00001906421,0.00001852304,0.003225198,0.4289472,0.00003167081,0.5658911,0.00005613504,0.001447267],"study_design_scores_gemma":[0.001150346,0.0001614919,0.00007836187,0.0001311116,0.000006986294,0.00002227103,0.0007574062,0.9872518,0.0003203042,0.00874933,0.0009809682,0.0003896779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006355923,0.00001368098,0.9504954,0.00003580537,0.00001350912,0.0005963728,3.938381e-7,0.00008757518,0.04240135],"genre_scores_gemma":[0.4273596,0.00001772316,0.5721427,0.0001113159,0.000005792536,0.0001500421,0.00000342748,0.00002285533,0.0001865606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5583046,"threshold_uncertainty_score":0.4280785,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01888278756495439,"score_gpt":0.2604277314904491,"score_spread":0.2415449439254947,"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."}}