{"id":"W2062659098","doi":"10.1007/s00453-010-9442-9","title":"Complexity of Finding Graph Roots with Girth Conditions","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics; Graph; Theory of computation; Graph power; Line graph; Algorithm","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.0002314643,0.0001160083,0.0001667711,0.0002109628,0.0001839304,0.00004200034,0.0009042229,0.00004780641,0.00006921997],"category_scores_gemma":[0.00004068399,0.00009795212,0.00005559442,0.0007561777,0.0006669929,0.000373903,0.0001910926,0.0003525823,0.00002631987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008801457,"about_ca_system_score_gemma":0.0000649381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002088879,"about_ca_topic_score_gemma":0.00005231341,"domain_scores_codex":[0.9988233,0.00005138128,0.0001635801,0.0003095694,0.0003335599,0.0003185403],"domain_scores_gemma":[0.9987592,0.0001703852,0.00008872832,0.0006969176,0.0001586039,0.0001261546],"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.0000104245,0.0001033293,0.001322594,0.0000118436,0.00003432478,0.00002075713,0.00015292,0.00003290165,0.02175294,0.9661279,0.0001643275,0.01026568],"study_design_scores_gemma":[0.001033052,0.0003273992,0.04695035,0.00003712183,0.0000115138,0.0001389188,0.00006059877,0.01476001,0.07020706,0.8647317,0.001295642,0.0004465777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2749002,0.00001935717,0.7206496,0.0005484083,0.0002327649,0.0002570208,0.00004436224,0.0001707915,0.003177504],"genre_scores_gemma":[0.8179756,0.000001258569,0.1818396,0.00003603088,0.00002919511,0.00001453147,0.000006520151,0.000008946386,0.00008833094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5430754,"threshold_uncertainty_score":0.3994372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03151075115654251,"score_gpt":0.3065646750993019,"score_spread":0.2750539239427593,"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."}}