{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004461544,0.0005482213,0.0006351568,0.001099932,0.0008525521,0.001656051,0.0009256362,0.001197432,0.008853654],"category_scores_gemma":[0.004454507,0.0004579611,0.0006219113,0.001422022,0.001497427,0.003464775,0.002095833,0.001780813,0.002129119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009971746,"about_ca_system_score_gemma":0.0006399765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001085194,"about_ca_topic_score_gemma":0.001373273,"domain_scores_codex":[0.9985862,0.000302075,0.0000816515,0.0004887856,0.0003319984,0.0002093477],"domain_scores_gemma":[0.9976588,0.001118825,0.0002526527,0.000469206,0.0003495653,0.0001509959],"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.0002919277,0.0001321275,0.002409036,0.0006649781,0.0000674459,0.0004680116,0.0008334397,0.01914594,0.02661281,0.7779341,0.02751678,0.1439233],"study_design_scores_gemma":[0.00005081596,0.00008692762,0.001264446,0.00007243001,0.00002790208,0.0008108041,0.0003137072,0.05472012,0.00800672,0.8743914,0.06021976,0.00003482881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1337395,0.001453911,0.7986434,0.002104545,0.0003843393,0.0006063419,0.003543275,0.003359159,0.05616556],"genre_scores_gemma":[0.5805346,0.001079247,0.3905882,0.0008957904,0.0003605729,0.000425065,0.005355821,0.0006137075,0.02014707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008853654,"threshold_uncertainty_score":0.02961838,"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."}}