{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077759,0.0008782867,0.0008616602,0.002684739,0.001440261,0.00200971,0.001468831,0.001271799,0.0122066],"category_scores_gemma":[0.005924345,0.0005997722,0.001159003,0.003163315,0.000867211,0.004650704,0.001691113,0.001220412,0.001961731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009096382,"about_ca_system_score_gemma":0.001935047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005030544,"about_ca_topic_score_gemma":0.0129618,"domain_scores_codex":[0.999293,0.0001195263,0.00004814472,0.0001796964,0.0002225372,0.0001370736],"domain_scores_gemma":[0.9973254,0.001371922,0.0002037409,0.0004739382,0.0004517979,0.0001730856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005721906,0.000608664,0.01313684,0.00145893,0.0001542776,0.0008749604,0.001063721,0.0553414,0.01894535,0.1485897,0.02959397,0.72966],"study_design_scores_gemma":[0.0001511167,0.0003548288,0.003073947,0.0003114467,0.0002349202,0.0007490578,0.001614262,0.3212115,0.03187072,0.5858791,0.05446812,0.00008089195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3161336,0.0007531102,0.6407647,0.001179143,0.0001606369,0.0007360501,0.005399484,0.006799111,0.02807415],"genre_scores_gemma":[0.2914894,0.0004559445,0.6853817,0.0001622472,0.00004060248,0.0001716725,0.006865369,0.00100036,0.01443284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0122066,"threshold_uncertainty_score":0.0408352,"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."}}