{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00113757,0.0007906689,0.000650588,0.002147248,0.0003750426,0.0008834196,0.003849598,0.0003975389,0.00003633648],"category_scores_gemma":[0.0001426557,0.0006825792,0.0002469794,0.002628155,0.001031927,0.0007397869,0.001585651,0.001817205,0.0003127094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004256704,"about_ca_system_score_gemma":0.0003914307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001253715,"about_ca_topic_score_gemma":0.00005076741,"domain_scores_codex":[0.9935591,0.000103225,0.0006409059,0.002705094,0.00181094,0.001180782],"domain_scores_gemma":[0.9961832,0.0008641614,0.00023921,0.002040664,0.0003502358,0.0003225287],"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.00003064136,0.00008724224,0.00003263991,0.0001246805,0.00003886731,0.0004111747,0.0006814512,0.008833796,0.000705856,0.507421,0.0001288113,0.4815038],"study_design_scores_gemma":[0.0001907913,0.0003132167,0.00008054385,0.0008950575,0.000008316737,0.00004271161,8.480028e-8,0.1709642,0.001638085,0.8230379,0.002140502,0.0006886371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001909093,0.0007584291,0.9778327,0.0009718295,0.001884998,0.0009527879,0.00001983195,0.001963917,0.01542455],"genre_scores_gemma":[0.3110147,0.0005226342,0.6770782,0.002652109,0.001083855,0.0002631469,0.00007055021,0.0003406298,0.006974195],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4808152,"threshold_uncertainty_score":0.9995626,"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."}}