{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781623,0.0009144694,0.0005461281,0.0009677159,0.001298723,0.002283215,0.001573113,0.0009457947,0.01403383],"category_scores_gemma":[0.003648373,0.0007548447,0.0007012662,0.001701894,0.001778037,0.0044322,0.002117483,0.002977929,0.00304101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007485414,"about_ca_system_score_gemma":0.001189747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001301137,"about_ca_topic_score_gemma":0.001495985,"domain_scores_codex":[0.9992624,0.0001589273,0.00003792019,0.0001311074,0.0002448939,0.0001647216],"domain_scores_gemma":[0.9981399,0.0008129214,0.0001572167,0.0003665088,0.0003147414,0.0002087552],"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.00009805537,0.0000567862,0.0002158512,0.0001176703,0.0000102111,0.0001519292,0.000244691,0.005319046,0.002264498,0.9426757,0.007912159,0.04093345],"study_design_scores_gemma":[0.0000226976,0.00001160773,0.00006735628,0.00002373168,0.00001007455,0.0001116491,0.00008741565,0.006901991,0.001376815,0.9800086,0.01136547,0.00001263451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1081026,0.001081887,0.6133751,0.002030742,0.0008331098,0.0003268293,0.001393551,0.0009625859,0.2718937],"genre_scores_gemma":[0.659346,0.001716939,0.2636653,0.0006407244,0.0003594282,0.0005435123,0.002018532,0.0008734509,0.07083605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01403383,"threshold_uncertainty_score":0.04694784,"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."}}