{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001419844,0.0004935565,0.0004238979,0.00104946,0.0003863563,0.0004822068,0.003667016,0.0002532414,0.00006458737],"category_scores_gemma":[0.0001173498,0.000443662,0.0001269261,0.0008058044,0.0008594075,0.0009580296,0.001535955,0.001231562,0.0002912853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003296505,"about_ca_system_score_gemma":0.0003512779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000462815,"about_ca_topic_score_gemma":0.00001712702,"domain_scores_codex":[0.9955612,0.00006211204,0.0004171975,0.001476156,0.001376653,0.001106641],"domain_scores_gemma":[0.9967198,0.0008371299,0.0002172228,0.001716269,0.0002147108,0.0002948368],"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.000006356207,0.00002854861,0.00002245629,0.00002074104,0.000005911748,0.00004108193,0.0003541857,0.02145863,0.00007647662,0.5023957,0.00001640537,0.4755735],"study_design_scores_gemma":[0.0001827876,0.000213422,0.00003682232,0.0003904762,0.000002997208,0.00004954179,5.532177e-8,0.06721306,0.0009679832,0.9285161,0.001878082,0.0005486605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003686923,0.0004682996,0.9847944,0.0005303556,0.0007590707,0.0004417048,0.000003245141,0.000213467,0.01275261],"genre_scores_gemma":[0.2464263,0.00006394096,0.7496155,0.001977121,0.000664626,0.00004777241,0.000006433243,0.00007695305,0.001121323],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4750248,"threshold_uncertainty_score":0.9998015,"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."}}