{"id":"W2009792106","doi":"10.1002/jgt.20123","title":"Spanning subgraphs of graphs partitioned into two isomorphic pieces","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Countable set; Induced subgraph; Cograph; Discrete mathematics; Induced subgraph isomorphism problem; Graph; Pathwidth; Line graph; Voltage graph; Vertex (graph theory)","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.004017192,0.0002327595,0.0004945935,0.001537195,0.0002204301,0.00008003292,0.001788115,0.00007660386,0.00007911809],"category_scores_gemma":[0.0002609761,0.0001947205,0.0005036585,0.001753803,0.0005055701,0.001540719,0.0002015254,0.0005504173,0.0000222973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003948138,"about_ca_system_score_gemma":0.0001166554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004595301,"about_ca_topic_score_gemma":0.00001305037,"domain_scores_codex":[0.9967722,0.0006522678,0.0009424374,0.0002897602,0.0008810366,0.0004622991],"domain_scores_gemma":[0.9969305,0.0006109145,0.000890863,0.0006612969,0.0006417546,0.0002647077],"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.0003069903,0.0002732844,0.003243619,0.00003612478,0.0002007398,0.0000595532,0.001965996,0.002193831,0.01385103,0.9416921,0.0004759669,0.03570072],"study_design_scores_gemma":[0.001138109,0.0004463335,0.001209028,0.0001277624,0.00003013605,0.0001881932,0.0002457303,0.0003749929,0.02085193,0.97391,0.001250826,0.0002268973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5061958,0.005713677,0.4847662,0.00141982,0.0005623641,0.0001949513,0.00000602951,0.00007771662,0.001063438],"genre_scores_gemma":[0.9656857,0.0003686271,0.03356275,0.0001967123,0.0001212278,0.000004891148,9.62161e-7,0.00001631542,0.00004279181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4594899,"threshold_uncertainty_score":0.7940472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01714410709455434,"score_gpt":0.2990813890537635,"score_spread":0.2819372819592092,"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."}}