{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068771,0.001482823,0.00274567,0.001765854,0.002183973,0.007308778,0.004469884,0.004021594,0.02558992],"category_scores_gemma":[0.0297768,0.001203108,0.002644198,0.003114928,0.00324774,0.01233328,0.004331609,0.004352597,0.002380894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002710855,"about_ca_system_score_gemma":0.003919782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004390266,"about_ca_topic_score_gemma":0.00547319,"domain_scores_codex":[0.995945,0.0009907114,0.0002464493,0.00104429,0.001091347,0.0006821175],"domain_scores_gemma":[0.9514175,0.04214189,0.001542611,0.002694418,0.001079511,0.001124053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.006056318,0.001595147,0.02055726,0.003244269,0.0007126484,0.001503939,0.00233379,0.4361375,0.02011598,0.2190507,0.06203205,0.2266604],"study_design_scores_gemma":[0.0008592776,0.0002393857,0.002330639,0.00008169535,0.0002832285,0.0006270587,0.0008376851,0.3753119,0.005118792,0.6114576,0.002776611,0.00007611555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7379958,0.001407274,0.2081728,0.01218671,0.0003655626,0.0005938038,0.005982887,0.002960868,0.03033427],"genre_scores_gemma":[0.8634877,0.0009091246,0.1153621,0.0007470151,0.0006013671,0.0003638006,0.007250994,0.0009002167,0.01037766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02558992,"threshold_uncertainty_score":0.08560681,"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."}}