{"id":"W2479313071","doi":"10.1017/cbo9780511546884.016","title":"The Path-Greedy Algorithm","year":2007,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Path (computing); Greedy algorithm; Computer science; Algorithm; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008663652,0.001775848,0.001537274,0.001696739,0.001084988,0.002144258,0.002825687,0.001818326,0.03760302],"category_scores_gemma":[0.00454296,0.0006049307,0.001113808,0.003072243,0.0009036728,0.002743071,0.002619466,0.002315718,0.0215521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071836,"about_ca_system_score_gemma":0.00317994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004288845,"about_ca_topic_score_gemma":0.005704047,"domain_scores_codex":[0.9989452,0.00023381,0.00005633289,0.0002436255,0.0003662288,0.0001549408],"domain_scores_gemma":[0.9989977,0.0004464959,0.00003565781,0.0002613623,0.0001979823,0.00006083429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002517906,0.0001337414,0.0003004993,0.0003847794,0.00008487878,0.0001030427,0.00008626733,0.07374545,0.00196833,0.06541234,0.1101364,0.7473924],"study_design_scores_gemma":[0.0002283775,0.000162638,0.0003789744,0.0001669343,0.00008556034,0.0005757893,0.0001245465,0.627667,0.004322263,0.2566845,0.1095412,0.00006216632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003356803,0.002463774,0.9498488,0.000784279,0.0004458832,0.0002280455,0.000796189,0.003732336,0.03834385],"genre_scores_gemma":[0.05674447,0.002355457,0.8929518,0.0005609115,0.0002644714,0.0004689866,0.002762758,0.00156612,0.04232508],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03760302,"threshold_uncertainty_score":0.1257946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0239906268607839,"score_gpt":0.2091627212669497,"score_spread":0.1851720944061658,"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."}}