{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005106071,0.0001578624,0.0003828339,0.001430387,0.0001620074,0.0000424949,0.001612475,0.00007215203,0.00004527304],"category_scores_gemma":[0.0001146461,0.0001359662,0.0004165852,0.00157549,0.0003863653,0.00069544,0.0001409945,0.0004182341,0.000006519426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003667031,"about_ca_system_score_gemma":0.00007919383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001557015,"about_ca_topic_score_gemma":0.000002373686,"domain_scores_codex":[0.9975413,0.0003369698,0.0008013201,0.0001868405,0.0007171271,0.0004164583],"domain_scores_gemma":[0.9969568,0.0009514426,0.0006352369,0.0005941258,0.0006133024,0.0002490764],"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.0001145127,0.0002011581,0.001260803,0.00001831037,0.0001092342,0.00008362668,0.0004466837,0.000129131,0.03129669,0.9506061,0.0001251899,0.01560857],"study_design_scores_gemma":[0.0005667821,0.0003697651,0.006642465,0.00007624344,0.00001922902,0.0002850291,0.0002137623,0.00004664697,0.03768823,0.9537174,0.000238617,0.0001358179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1939235,0.0009994308,0.8018116,0.00007988976,0.000306758,0.0000947782,0.000002814759,0.00002696257,0.002754286],"genre_scores_gemma":[0.9660482,0.00006733154,0.03368516,0.00009093762,0.00004497504,9.787633e-7,5.336718e-7,0.00001424726,0.00004760741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7721247,"threshold_uncertainty_score":0.5544542,"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."}}