{"id":"W2050352628","doi":"10.1145/1806689.1806785","title":"Odd cycle packing","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Packing problems; Digraph; Disjoint sets; Mathematics; Feedback arc set; Vertex (graph theory); Directed graph; Upper and lower bounds; Graph; Integer (computer science); Discrete mathematics; Computer science; Line 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":[],"consensus_categories":[],"category_scores_codex":[0.000248548,0.00004777208,0.00004600185,0.00006219521,0.00008300944,0.00008354472,0.000774814,0.00002573042,0.0001589076],"category_scores_gemma":[0.00006049745,0.00003894306,0.00002557372,0.0002640724,0.00004834444,0.0003972376,0.0002586812,0.0002027053,0.0003204483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003924783,"about_ca_system_score_gemma":0.00001773352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005464483,"about_ca_topic_score_gemma":0.00002115099,"domain_scores_codex":[0.9993408,0.0000184829,0.00006092811,0.0001891549,0.0001681968,0.0002224131],"domain_scores_gemma":[0.9992459,0.0000839963,0.00001278763,0.0005376459,0.00004016625,0.00007947061],"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":[6.597517e-7,0.000009909703,0.0004590056,8.512228e-7,0.000001369452,0.000005085083,0.00005602529,0.000006033489,0.02640139,0.9181076,0.0001357881,0.05481633],"study_design_scores_gemma":[0.000214787,0.00003586835,0.003367225,0.000002742021,5.347911e-7,0.00002828855,0.00001955779,0.03524378,0.05099805,0.8898878,0.01999918,0.000202198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1041943,0.000007984554,0.8123524,0.0007697208,0.0003103856,0.00006235476,1.840248e-7,0.0002818434,0.08202083],"genre_scores_gemma":[0.8880684,0.000001019254,0.1105221,0.000175097,0.00003713724,0.000003767163,1.185426e-7,0.000004076542,0.001188315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.783874,"threshold_uncertainty_score":0.4118822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01480484433241463,"score_gpt":0.3016482736980654,"score_spread":0.2868434293656507,"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."}}