{"id":"W2118345845","doi":"10.5555/982792.982935","title":"Bipartite roots of graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Complete bipartite graph; Graph isomorphism; Discrete mathematics; Time complexity; Graph; Line 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.0002623708,0.0001795686,0.0002476926,0.0001694841,0.0001014356,0.00009164349,0.0006379812,0.00008420121,0.00001162452],"category_scores_gemma":[0.000008125356,0.0001471265,0.0001789127,0.0004883083,0.00005798268,0.000318011,0.0001058088,0.0001319591,0.00008785137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004739486,"about_ca_system_score_gemma":0.00004352159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001295214,"about_ca_topic_score_gemma":0.00001683082,"domain_scores_codex":[0.9984662,0.00006009231,0.0003836655,0.0004067269,0.000360926,0.0003223811],"domain_scores_gemma":[0.998935,0.00003833977,0.0001537453,0.0006599204,0.00009659665,0.0001163904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003550887,0.0002556606,0.0003285287,0.00005669099,0.0001336884,0.00005529217,0.001434176,0.03413075,0.01822599,0.9359263,0.001634311,0.007783087],"study_design_scores_gemma":[0.01196551,0.00923718,0.01177916,0.002283826,0.0001248481,0.0005357188,0.0006476586,0.373506,0.3268313,0.1942159,0.06430931,0.004563529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06124002,0.0003701847,0.8891243,0.004437004,0.005521492,0.0006118834,0.00002194719,0.0004885655,0.0381846],"genre_scores_gemma":[0.9944232,0.00003574919,0.004695212,0.0002409256,0.0001584068,0.00002379296,0.000003420173,0.00001518307,0.0004041478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9331831,"threshold_uncertainty_score":0.5999646,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0109872731967097,"score_gpt":0.2419567528321393,"score_spread":0.2309694796354296,"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."}}