{"id":"W4247937443","doi":"10.1002/jgt.20262","title":"Compatible circuit decompositions of 4‐regular graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Combinatorics; Mathematics; Eulerian path; Conjecture; Vertex (graph theory); Discrete mathematics; Cubic graph; Graph; Line graph; Voltage graph; Pure mathematics; Lagrangian","routes":{"ca_aff":true,"ca_fund":true,"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.0002635354,0.0002723802,0.0003039287,0.0009832521,0.0006435206,0.00105271,0.0004624664,0.0004325237,0.003204431],"category_scores_gemma":[0.001257656,0.0003848739,0.0005183042,0.0005263554,0.0008182728,0.001282434,0.0008362604,0.0005384837,0.0002082227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006270784,"about_ca_system_score_gemma":0.0003370916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007815526,"about_ca_topic_score_gemma":0.001072426,"domain_scores_codex":[0.999524,0.0000564402,0.00003168654,0.0001570744,0.0001013703,0.0001294273],"domain_scores_gemma":[0.9990195,0.0002787198,0.0002218314,0.00016469,0.000109486,0.0002057622],"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.001070135,0.0002367662,0.01964816,0.0002419902,0.0001051349,0.002270662,0.001605877,0.04189754,0.1001786,0.7905712,0.002522716,0.03965124],"study_design_scores_gemma":[0.0002038579,0.0003246218,0.01119341,0.00007635338,0.0001478387,0.001567439,0.0008268341,0.1700555,0.05524059,0.7473035,0.01299286,0.00006711329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9503687,0.00008454382,0.04388661,0.00009679361,0.00001650586,0.00005151791,0.0002628515,0.0002323599,0.005000045],"genre_scores_gemma":[0.9905267,0.00002777991,0.008269839,0.00002679145,0.000008070017,0.00003205126,0.0002766494,0.00002569692,0.0008064359],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003204431,"threshold_uncertainty_score":0.0107199,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02060022984580104,"score_gpt":0.2970902916336,"score_spread":0.2764900617877989,"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."}}