{"id":"W3081818585","doi":"10.1002/net.21987","title":"Plowing with precedence in polynomial time","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Consejo Nacional de Ciencia y Tecnología; Bundesministerium für Bildung und Forschung; Deutscher Akademischer Austauschdienst","keywords":"Heuristics; Traverse; Tree traversal; Time complexity; Computer science; State (computer science); Mathematical optimization; Polynomial; Mathematics; Algorithm; Geography; Cartography","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.00008737108,0.00007125919,0.00008439508,0.00002327775,0.00003042693,0.0001471611,0.0006418067,0.00002305593,0.00001691097],"category_scores_gemma":[0.000005859496,0.00006093517,0.00001349115,0.0003893167,0.00001317212,0.0005934691,0.000273667,0.0001158779,0.00008116773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009456215,"about_ca_system_score_gemma":0.00001103974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008490269,"about_ca_topic_score_gemma":0.000005298519,"domain_scores_codex":[0.9993311,0.00001937889,0.00008595057,0.0002502773,0.0001158693,0.0001973853],"domain_scores_gemma":[0.999693,0.00002278866,0.0000235137,0.0001941927,0.00000631584,0.00006022123],"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.0001093775,0.0001259852,0.01138529,0.00003182537,0.0000644477,0.0004723622,0.002092828,0.1274018,0.0001416711,0.005733815,0.1223954,0.7300451],"study_design_scores_gemma":[0.0002525813,0.00006310155,0.001368181,0.00002060587,0.000001856239,9.394624e-7,0.000004910318,0.989701,0.00001667629,0.00001538952,0.008449996,0.0001047639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005318969,0.00008985386,0.9791639,0.003061003,0.0001825577,0.0001772004,7.876204e-7,0.0002299363,0.01177578],"genre_scores_gemma":[0.9566025,0.00001672191,0.03934274,0.002749532,0.0006377111,0.00001260377,0.00001045881,0.0000141996,0.0006134872],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9512836,"threshold_uncertainty_score":0.2484864,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008302955797465502,"score_gpt":0.1769456819335898,"score_spread":0.1686427261361243,"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."}}