{"id":"W4230523959","doi":"10.22215/etd/2008-08073","title":"Algorithms for static and dynamic path problems in trees","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Path (computing); Computer science; Humanities; Art; Operating system","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.0001477138,0.0002132601,0.0002463103,0.000266631,0.00006435714,0.000200828,0.000571477,0.00008265881,0.000005172275],"category_scores_gemma":[0.00001299791,0.0001883639,0.00004161519,0.0002352202,0.00001436334,0.0005731985,0.00007699242,0.0001007722,0.00000754728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000278342,"about_ca_system_score_gemma":0.00004536799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000101084,"about_ca_topic_score_gemma":0.001251749,"domain_scores_codex":[0.9987242,0.00001600041,0.0002742138,0.0005276938,0.0001956292,0.0002622871],"domain_scores_gemma":[0.9994371,0.00005450656,0.0001088559,0.0003170078,0.00003787727,0.00004466273],"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.000007110774,0.0001556237,0.00009172194,0.0006067056,0.00004902396,0.00002790524,0.00240912,0.0000526627,0.00002697971,0.007824078,0.004809914,0.9839392],"study_design_scores_gemma":[0.001164425,0.0002293115,0.008247934,0.0002689427,0.00002080812,0.00000419563,0.0005424471,0.9704722,0.00002415113,0.01085428,0.007496884,0.000674485],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007486308,0.001315669,0.9780863,0.000346219,0.001332716,0.002816555,0.0001047474,0.0003348267,0.008176637],"genre_scores_gemma":[0.02161575,0.006726006,0.7561101,0.0004339864,0.0001338035,0.001381652,0.0096375,0.000132603,0.2038285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9832647,"threshold_uncertainty_score":0.7681258,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01727759919918152,"score_gpt":0.2691569636644638,"score_spread":0.2518793644652823,"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."}}