{"id":"W1976577139","doi":"10.1016/j.dam.2012.01.024","title":"Finding and listing induced paths and cycles","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Listing (finance); Time complexity; Running time; Discrete mathematics; 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.0005581881,0.0001413814,0.0001753856,0.00008699736,0.0001900093,0.0001363449,0.0002801365,0.0000528466,0.000003080371],"category_scores_gemma":[0.00009261602,0.0001200992,0.00001798149,0.0001935453,0.00008010338,0.0003432222,0.0005232702,0.0001554987,0.0000115602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001209288,"about_ca_system_score_gemma":0.000008465665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001019808,"about_ca_topic_score_gemma":4.158888e-7,"domain_scores_codex":[0.9989687,0.00001679257,0.000186727,0.0002157316,0.0002125054,0.000399506],"domain_scores_gemma":[0.9990419,0.0003427422,0.00008807507,0.000345558,0.00001651118,0.0001652197],"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.000001632132,0.00002115547,0.0003082454,0.00009528441,0.000009018214,0.000001226342,0.005162427,9.155509e-7,0.01822472,0.9579905,0.000005937463,0.0181789],"study_design_scores_gemma":[0.0007553099,0.00006289844,0.003735986,0.000145429,0.00002748389,0.00009053021,0.004269614,0.02150313,0.02369349,0.9446557,0.0002203911,0.0008400778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6389355,0.0001807731,0.3509968,0.00007589997,0.00004187519,0.0002610553,0.000001949979,0.0001302522,0.009375917],"genre_scores_gemma":[0.7996876,0.00001327839,0.2001778,0.00003104252,0.00003209703,0.00002202056,7.662837e-7,0.00001380728,0.00002149045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1607521,"threshold_uncertainty_score":0.4897503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04743536414002111,"score_gpt":0.3154596740394087,"score_spread":0.2680243098993876,"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."}}