{"id":"W1509846055","doi":"10.1007/978-3-642-30347-0_9","title":"Conflict-Free Graph Orientations with Parity Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multigraph; Combinatorics; Disjoint sets; Vertex (graph theory); Parity (physics); Mixed graph; Computer science; Graph; Discrete mathematics; Mathematics; Line graph; Voltage graph; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001186867,0.0005983156,0.0005476181,0.001149517,0.0004642574,0.0004811453,0.005857232,0.0002841732,0.00008543699],"category_scores_gemma":[0.000163049,0.0005039519,0.0001246405,0.001289975,0.004511765,0.001204846,0.002019022,0.001293595,0.00006868331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000220758,"about_ca_system_score_gemma":0.0007164999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001351981,"about_ca_topic_score_gemma":0.00009033129,"domain_scores_codex":[0.9950985,0.00007353816,0.0004681618,0.001590359,0.001598482,0.001170927],"domain_scores_gemma":[0.9950069,0.0008498187,0.0002852178,0.002915063,0.0005037024,0.0004392948],"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.00001751033,0.00005790268,0.0004585696,0.00003356301,0.00002965348,0.0001144934,0.001123239,0.003688448,0.00008205885,0.5731988,0.00002894099,0.4211668],"study_design_scores_gemma":[0.0009794858,0.0003754608,0.000549247,0.0003447403,0.00001885288,0.000336354,9.330481e-7,0.01668685,0.001504148,0.9744858,0.00342885,0.00128933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007822944,0.0005470629,0.9897763,0.000538955,0.0007793686,0.0005996966,0.00002370133,0.0002163373,0.007440357],"genre_scores_gemma":[0.1655571,0.0001129015,0.8320665,0.001264873,0.0003917732,0.0000424722,0.00001374893,0.00007022261,0.0004803785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4198775,"threshold_uncertainty_score":0.9997412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02898540035179802,"score_gpt":0.289376068478391,"score_spread":0.260390668126593,"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."}}