{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001320011,0.000142478,0.0002284505,0.0006599114,0.0005815687,0.0004553729,0.0002957024,0.0002469073,0.001862641],"category_scores_gemma":[0.0009232369,0.0002056859,0.0002428454,0.0006711415,0.0005866924,0.0009010414,0.0006891579,0.0001882583,0.0001217067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003593399,"about_ca_system_score_gemma":0.0001776978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001563832,"about_ca_topic_score_gemma":0.001465279,"domain_scores_codex":[0.9997661,0.00004896496,0.00001848838,0.0000739633,0.00005357683,0.00003895683],"domain_scores_gemma":[0.9992943,0.0002531151,0.0001615976,0.000134099,0.00007967614,0.00007714571],"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.0005115916,0.0001447077,0.02118608,0.0003576407,0.0001643931,0.002630254,0.003150595,0.03884465,0.1397476,0.6999862,0.004323305,0.08895288],"study_design_scores_gemma":[0.0000727593,0.0001825814,0.02419741,0.00004676301,0.0001966751,0.003010168,0.001772326,0.1750316,0.04380588,0.7358533,0.0157877,0.00004305029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9551487,0.00006640875,0.03875627,0.00007071534,0.000004774981,0.0000355554,0.0001944918,0.0001139781,0.005608944],"genre_scores_gemma":[0.9878878,0.00003418851,0.01047125,0.00001978581,0.000007538124,0.00002068451,0.0004511398,0.00001803206,0.001089566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001862641,"threshold_uncertainty_score":0.006231189,"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."}}