{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002538187,0.0003570387,0.0002796038,0.0004438204,0.0003616877,0.0004707347,0.001729536,0.000245159,0.0001098504],"category_scores_gemma":[0.00002292109,0.0003164621,0.0001257344,0.0006139395,0.0001347294,0.0006138553,0.0000845701,0.0007091679,0.0002245772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008023737,"about_ca_system_score_gemma":0.0002756121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004538771,"about_ca_topic_score_gemma":0.00004727616,"domain_scores_codex":[0.9976546,0.0001414741,0.0003513299,0.0008868216,0.000599323,0.0003664774],"domain_scores_gemma":[0.9971314,0.0001244174,0.0001659282,0.002003517,0.0003729852,0.0002017743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009247544,0.0009552923,0.000007284175,0.0002378364,0.0003368505,0.00008197261,0.003947649,0.2799608,0.00002483569,0.00127949,0.0008235754,0.7122519],"study_design_scores_gemma":[0.001106549,0.001221119,0.0001144694,0.0003618675,0.00008356968,0.00005087311,0.0001047746,0.9609646,0.0007748778,0.0308588,0.003287139,0.001071327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007666213,0.00002080486,0.9946108,0.001965587,0.0009661822,0.0005675322,0.00003346171,0.0007446687,0.001014322],"genre_scores_gemma":[0.04323817,0.0002683033,0.9539878,0.0006046419,0.0001524059,0.0004905497,0.00004660089,0.00005696418,0.001154608],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7111806,"threshold_uncertainty_score":0.9999288,"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."}}