{"id":"W2610562287","doi":"","title":"The number of increasing nonconsecutive subpaths in a path","year":2006,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Path (computing); Computer science","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.001630958,0.001120835,0.001191003,0.003609564,0.003085087,0.003893831,0.002673366,0.00208596,0.01562794],"category_scores_gemma":[0.01472026,0.0009241324,0.001207529,0.004085131,0.002070552,0.005585579,0.002109618,0.003209653,0.001254405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002074207,"about_ca_system_score_gemma":0.002119382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002007624,"about_ca_topic_score_gemma":0.003005664,"domain_scores_codex":[0.9979553,0.0003573545,0.0001498074,0.0005299657,0.0005142589,0.0004932763],"domain_scores_gemma":[0.9732428,0.01865355,0.001961037,0.00141989,0.002356336,0.002366398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00375095,0.001414735,0.04898558,0.002583456,0.0004466058,0.002749423,0.002793859,0.09874626,0.04709412,0.5298457,0.02074661,0.2408428],"study_design_scores_gemma":[0.0003028841,0.001422197,0.02838639,0.0004196973,0.0005755686,0.004640731,0.002675642,0.3211835,0.02240968,0.5824624,0.03537954,0.00014179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8711562,0.0006703312,0.08822671,0.00168099,0.0001369545,0.0005034851,0.00340351,0.0004683964,0.03375342],"genre_scores_gemma":[0.7672688,0.00129342,0.1912987,0.0002998486,0.0001204497,0.0006478267,0.004709008,0.0002945002,0.03406737],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01562794,"threshold_uncertainty_score":0.05228072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005753194385482556,"score_gpt":0.1968608752115206,"score_spread":0.191107680826038,"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."}}