{"id":"W4399888599","doi":"10.1007/978-3-031-63021-7_24","title":"Directed Path Partition Problem on Directed Acyclic Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Directed acyclic graph; Computer science; Partition (number theory); Directed graph; Path (computing); Longest path problem; Theoretical computer science; Algorithm; Graph; Combinatorics; Chordal graph; Mathematics; Programming language","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.0009814126,0.001144784,0.001871025,0.001358135,0.0009883172,0.002717743,0.002583648,0.002197661,0.01331144],"category_scores_gemma":[0.006183462,0.0009956212,0.000849501,0.003330323,0.001189446,0.006538575,0.002498569,0.002299218,0.001440795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00153037,"about_ca_system_score_gemma":0.001242206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002713088,"about_ca_topic_score_gemma":0.002516197,"domain_scores_codex":[0.9990498,0.000301334,0.00004340284,0.000277799,0.0001943955,0.0001333054],"domain_scores_gemma":[0.9961706,0.002983569,0.0001819752,0.0002900679,0.000174073,0.0001998206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007406579,0.0004865135,0.001118923,0.001856072,0.0001943898,0.0003670165,0.0005356149,0.3621076,0.004437749,0.2971286,0.05535569,0.2756712],"study_design_scores_gemma":[0.0001883953,0.000117371,0.0006234841,0.0001672142,0.0000782897,0.0002962062,0.0003952864,0.383967,0.002645066,0.5948974,0.01659244,0.00003190058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1581158,0.003697199,0.7547633,0.004512402,0.000360185,0.0008174028,0.005610657,0.001321106,0.07080191],"genre_scores_gemma":[0.4609353,0.004399439,0.4709519,0.0007272424,0.0005161914,0.0009880465,0.01061692,0.0008055354,0.05005944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01331144,"threshold_uncertainty_score":0.04453123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01887843626430891,"score_gpt":0.2743530151173555,"score_spread":0.2554745788530466,"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."}}