{"id":"W2058105885","doi":"10.1145/1150334.1150337","title":"Bipartite roots of graphs","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Graph isomorphism; Complete bipartite graph; Discrete mathematics; Cograph; Time complexity; Edge-transitive graph; Line graph; Isomorphism (crystallography); Graph; Pathwidth; Voltage graph","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.0002121499,0.0001310222,0.0001560212,0.0003747687,0.000150065,0.00003620583,0.001085356,0.00005771165,0.00004970826],"category_scores_gemma":[0.00001441762,0.0001246414,0.0001352911,0.001169502,0.0001325099,0.0003835977,0.00001722501,0.0002071117,0.0000674754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002416348,"about_ca_system_score_gemma":0.00003358691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007312698,"about_ca_topic_score_gemma":0.00002659694,"domain_scores_codex":[0.9986404,0.00007110465,0.000244255,0.0003355413,0.0003935164,0.0003151596],"domain_scores_gemma":[0.9984515,0.0001945734,0.00005744012,0.00111415,0.0001060012,0.00007634415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004205387,0.0008554641,0.0001973476,0.00002769727,0.00006876209,0.00003094886,0.0001373156,0.0139645,0.01369156,0.1391606,0.0001929892,0.8316307],"study_design_scores_gemma":[0.001223168,0.0005257432,0.009773755,0.00004736004,0.00001934099,0.00003992575,0.00003915665,0.02397064,0.1870961,0.7727718,0.00398471,0.000508287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008027884,0.00008783397,0.9899929,0.0004808747,0.0002191975,0.0001428446,0.00001425831,0.0001661929,0.0008679722],"genre_scores_gemma":[0.790545,0.00003044786,0.208572,0.0000529692,0.00002161468,0.00003853414,0.000001668897,0.00001563131,0.000722159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8311225,"threshold_uncertainty_score":0.508273,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01969786754119153,"score_gpt":0.2844186336568095,"score_spread":0.264720766115618,"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."}}