{"id":"W78658037","doi":"10.1007/978-3-642-30541-2_2","title":"On a DAG Partitioning Problem","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Directed acyclic graph; Bounded function; Combinatorics; Graph; Feedback arc set; Pathwidth; Graph partition; Computer science; Directed graph; Mathematics; Strongly connected component; Discrete mathematics; Time complexity; Line graph; Voltage graph","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.001098206,0.001554439,0.001609176,0.001163082,0.001804893,0.00297392,0.002627404,0.002450227,0.01985394],"category_scores_gemma":[0.0073208,0.0009404791,0.001574625,0.003305616,0.001213067,0.007416095,0.003824587,0.003410274,0.002560347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001359514,"about_ca_system_score_gemma":0.001217937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002391535,"about_ca_topic_score_gemma":0.002830708,"domain_scores_codex":[0.9989012,0.0003104227,0.00005810324,0.0003193211,0.0002409321,0.0001700337],"domain_scores_gemma":[0.9971533,0.001800101,0.0001291105,0.0005021899,0.0002193403,0.000195957],"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.0006421444,0.0005845158,0.001048607,0.001131299,0.0001460339,0.0004041685,0.0004638805,0.111863,0.004704532,0.375005,0.1074595,0.3965473],"study_design_scores_gemma":[0.0001354801,0.00008828352,0.0004738493,0.0001116019,0.00008442385,0.0003227183,0.0002602445,0.1647759,0.00145988,0.8033234,0.0289389,0.00002516637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1010849,0.003129713,0.7484433,0.0134167,0.001163477,0.0006628326,0.002420943,0.001408585,0.1282696],"genre_scores_gemma":[0.3075062,0.004031378,0.5972952,0.001872522,0.001297554,0.0006733908,0.007748984,0.001252747,0.07832208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01985394,"threshold_uncertainty_score":0.06641805,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02681623236933309,"score_gpt":0.2855424506560266,"score_spread":0.2587262182866935,"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."}}