{"id":"W4386834334","doi":"10.18280/ria.370417","title":"Parallelizing Depth-First Search for Pathway Finding: A Comprehensive Investigation","year":2023,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Information retrieval","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001039237,0.0005660218,0.0007847419,0.001195711,0.0005187523,0.001013806,0.000802896,0.0005855478,0.001412458],"category_scores_gemma":[0.004676537,0.0003430446,0.0005314129,0.002010508,0.0005202554,0.001486209,0.0006785292,0.0007075378,0.0002808092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008333375,"about_ca_system_score_gemma":0.002197701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003478769,"about_ca_topic_score_gemma":0.004742042,"domain_scores_codex":[0.9994929,0.0001406827,0.00003005048,0.00009611752,0.0002059002,0.00003438044],"domain_scores_gemma":[0.998458,0.00104995,0.0001038388,0.0001646546,0.0001895219,0.0000341231],"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.0002165368,0.0001881242,0.002481484,0.0009156199,0.000101113,0.000184676,0.0002324775,0.2872056,0.02419583,0.02749154,0.001816549,0.6549704],"study_design_scores_gemma":[0.00008215276,0.0002232041,0.001108111,0.00005957608,0.00006161079,0.0004290648,0.000132605,0.9451832,0.01620381,0.02599831,0.01048807,0.00003025894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08079428,0.006615842,0.9050594,0.0006146006,0.00005543005,0.0002701541,0.0001885174,0.0008653387,0.005536467],"genre_scores_gemma":[0.2031106,0.005656252,0.7890092,0.0001186575,0.00003762893,0.0001622716,0.0003597901,0.0001230243,0.001422536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003478769,"threshold_uncertainty_score":0.006917059,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1447638006056924,"score_gpt":0.3224520307446102,"score_spread":0.1776882301389178,"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."}}