{"id":"W4378611059","doi":"10.9734/bpi/ratmcs/v1/5816e","title":"On the DAG Decomposition into Minimum Number of Chains","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Disjoint sets; Node (physics); Path (computing); Directed acyclic graph; Mathematics; Time complexity; Bounded function; Discrete mathematics; Decomposition; Computer science; Computer network; Chemistry; Physics","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.0007459184,0.002072698,0.00121168,0.001246688,0.001072315,0.001971044,0.001283064,0.0008384646,0.0146914],"category_scores_gemma":[0.002666126,0.000945715,0.001316185,0.003562282,0.001041457,0.005320741,0.002026514,0.002317001,0.004382545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001547299,"about_ca_system_score_gemma":0.001713831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00225673,"about_ca_topic_score_gemma":0.002627553,"domain_scores_codex":[0.9994167,0.0001163312,0.0000340664,0.0002184576,0.0001358038,0.00007858212],"domain_scores_gemma":[0.9990844,0.0004038411,0.00006268969,0.0002570459,0.0001238897,0.00006830297],"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.0003216657,0.0001548845,0.0004277372,0.001229423,0.00006814228,0.0001936765,0.0002914308,0.1003624,0.008438262,0.2686731,0.08556297,0.5342763],"study_design_scores_gemma":[0.0001211232,0.0001210753,0.0003823208,0.0002674893,0.00005811808,0.000357191,0.0001862633,0.205396,0.00516349,0.659999,0.1279067,0.0000411999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01219286,0.00384558,0.9446639,0.001880815,0.0003566902,0.0002407577,0.001400688,0.001453869,0.03396479],"genre_scores_gemma":[0.05451079,0.004536918,0.9001691,0.0005824242,0.0003184251,0.0003337875,0.002963362,0.001232839,0.03535233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0146914,"threshold_uncertainty_score":0.04914767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0348428957038564,"score_gpt":0.3327993574749583,"score_spread":0.2979564617711019,"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."}}