{"id":"W2463954311","doi":"10.1145/3280823","title":"Deterministic Graph Exploration with Advice","year":2018,"lang":"en","type":"preprint","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Oracle; Advice (programming); Graph; Computer science; Theoretical computer science; Time complexity; Combinatorics; A priori and a posteriori; Node (physics); Discrete mathematics; Mathematics; Algorithm","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.001290835,0.00108742,0.001168601,0.0005797908,0.0008839584,0.001526791,0.002081885,0.001988171,0.006028649],"category_scores_gemma":[0.01721119,0.0005754884,0.001324667,0.0009732285,0.002015066,0.004739573,0.00288817,0.002754943,0.001209344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169959,"about_ca_system_score_gemma":0.00203479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00388375,"about_ca_topic_score_gemma":0.005048534,"domain_scores_codex":[0.9977826,0.0004485072,0.0001350826,0.0006966458,0.0004820593,0.0004550616],"domain_scores_gemma":[0.9891349,0.00729894,0.0005775278,0.001900358,0.0005871716,0.0005009854],"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.002246948,0.0003177543,0.005604558,0.001143547,0.000164493,0.0005458184,0.001154299,0.6045905,0.0141136,0.1966269,0.01522788,0.1582637],"study_design_scores_gemma":[0.0001540357,0.0001743999,0.0004855033,0.00004841778,0.00004729159,0.0001686231,0.00009594285,0.7372419,0.003877182,0.2488973,0.00877826,0.00003100243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1245615,0.001015293,0.8508173,0.002896179,0.0001862129,0.0002485891,0.001031075,0.004987994,0.01425582],"genre_scores_gemma":[0.5591396,0.0006212975,0.4276135,0.0007201427,0.0001584214,0.0003326984,0.00134948,0.0006235621,0.009441286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006028649,"threshold_uncertainty_score":0.02016783,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04404600970732654,"score_gpt":0.2913510131177562,"score_spread":0.2473050034104297,"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."}}