{"id":"W1977603728","doi":"10.1016/j.tcs.2008.04.034","title":"Memoryless search algorithms in a network with faulty advice","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Advice (programming); Node (physics); Shortest path problem; Computer science; Network topology; Graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Path (computing); Discrete mathematics; Mathematics; Randomized algorithm; Algorithm; Theoretical computer science; Computer network; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.002793342,0.0007549641,0.00171584,0.001645218,0.001915576,0.002232034,0.003398106,0.00332599,0.003083773],"category_scores_gemma":[0.03228931,0.0008101314,0.0006038616,0.001548289,0.002327602,0.004503811,0.002439727,0.002611487,0.0004252801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00186148,"about_ca_system_score_gemma":0.001689192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005595906,"about_ca_topic_score_gemma":0.005580949,"domain_scores_codex":[0.9984554,0.0004921557,0.00009736625,0.000323498,0.0003424539,0.0002891546],"domain_scores_gemma":[0.9670666,0.02582105,0.001467323,0.00301436,0.001808548,0.0008220425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002487174,0.0002226686,0.004211336,0.0003167833,0.0001489322,0.0006279,0.0007273987,0.7603053,0.003725661,0.1437159,0.008159156,0.07535177],"study_design_scores_gemma":[0.00009698999,0.0000514149,0.000140005,0.00001462285,0.0000313165,0.00006326856,0.00004187727,0.8947093,0.001256205,0.1030964,0.0004891811,0.000009427737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4333864,0.001222719,0.5516863,0.004496874,0.0002332046,0.0001100015,0.0003671773,0.001850918,0.006646406],"genre_scores_gemma":[0.8957735,0.0002893343,0.09632033,0.0002915827,0.0001314901,0.00009485664,0.0001508627,0.0001614526,0.00678668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005595906,"threshold_uncertainty_score":0.01477277,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01864963886820921,"score_gpt":0.2649793731140586,"score_spread":0.2463297342458494,"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."}}